./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c -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 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:37:48,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:37:48,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:37:48,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:37:48,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:37:48,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:37:48,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:37:48,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:37:48,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:37:48,389 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:37:48,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:37:48,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:37:48,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:37:48,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:37:48,389 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:37:48,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:37:48,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:37:48,390 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:37:48,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:37:48,390 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:37:48,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:37:48,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:37:48,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:37:48,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:37:48,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:37:48,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:37:48,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:37:48,391 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2025-02-06 04:37:48,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:37:48,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:37:48,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:37:48,578 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:37:48,578 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:37:48,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-02-06 04:37:49,723 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77bbf8a0d/4e0df31e3ff145f6bf28c2a01f615e00/FLAGd2eaa7270 [2025-02-06 04:37:50,002 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:37:50,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2025-02-06 04:37:50,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77bbf8a0d/4e0df31e3ff145f6bf28c2a01f615e00/FLAGd2eaa7270 [2025-02-06 04:37:50,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77bbf8a0d/4e0df31e3ff145f6bf28c2a01f615e00 [2025-02-06 04:37:50,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:37:50,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:37:50,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:37:50,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:37:50,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:37:50,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:37:50" (1/1) ... [2025-02-06 04:37:50,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c774eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:50, skipping insertion in model container [2025-02-06 04:37:50,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:37:50" (1/1) ... [2025-02-06 04:37:50,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:37:50,197 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/weaver/popl20-bad-counter-queue.wvr.c[2142,2155] [2025-02-06 04:37:50,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:37:50,217 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:37:50,234 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/weaver/popl20-bad-counter-queue.wvr.c[2142,2155] [2025-02-06 04:37:50,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:37:50,251 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:37:50,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:50 WrapperNode [2025-02-06 04:37:50,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:37:50,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:37:50,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:37:50,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:37:50,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:50" (1/1) ... [2025-02-06 04:37:50,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:50" (1/1) ... [2025-02-06 04:37:50,288 INFO L138 Inliner]: procedures = 23, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 125 [2025-02-06 04:37:50,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:37:50,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:37:50,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:37:50,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:37:50,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:50" (1/1) ... [2025-02-06 04:37:50,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:50" (1/1) ... [2025-02-06 04:37:50,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:50" (1/1) ... [2025-02-06 04:37:50,306 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-06 04:37:50,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:50" (1/1) ... [2025-02-06 04:37:50,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:50" (1/1) ... [2025-02-06 04:37:50,313 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:50" (1/1) ... [2025-02-06 04:37:50,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:50" (1/1) ... [2025-02-06 04:37:50,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:50" (1/1) ... [2025-02-06 04:37:50,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:50" (1/1) ... [2025-02-06 04:37:50,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:37:50,318 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:37:50,318 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:37:50,318 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:37:50,321 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:50" (1/1) ... [2025-02-06 04:37:50,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:37:50,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:37:50,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:37:50,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:37:50,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:37:50,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:37:50,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:37:50,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:37:50,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:37:50,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:37:50,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:37:50,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:37:50,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:37:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:37:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:37:50,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:37:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:37:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:37:50,384 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:37:50,449 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:37:50,451 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:37:50,613 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:37:50,613 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:37:50,783 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:37:50,784 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:37:50,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:37:50 BoogieIcfgContainer [2025-02-06 04:37:50,784 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:37:50,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:37:50,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:37:50,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:37:50,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:37:50" (1/3) ... [2025-02-06 04:37:50,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32bdaef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:37:50, skipping insertion in model container [2025-02-06 04:37:50,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:37:50" (2/3) ... [2025-02-06 04:37:50,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32bdaef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:37:50, skipping insertion in model container [2025-02-06 04:37:50,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:37:50" (3/3) ... [2025-02-06 04:37:50,791 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-02-06 04:37:50,800 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:37:50,801 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue.wvr.c that has 3 procedures, 22 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-06 04:37:50,801 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:37:50,851 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:37:50,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 62 flow [2025-02-06 04:37:50,889 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-02-06 04:37:50,892 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:37:50,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 3/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-02-06 04:37:50,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 62 flow [2025-02-06 04:37:50,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 21 transitions, 54 flow [2025-02-06 04:37:50,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:37:50,916 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;@3aabfc2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:37:50,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 04:37:50,926 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:37:50,926 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-02-06 04:37:50,927 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:37:50,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:50,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:37:50,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:37:50,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:50,934 INFO L85 PathProgramCache]: Analyzing trace with hash -903908434, now seen corresponding path program 1 times [2025-02-06 04:37:50,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:50,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868855313] [2025-02-06 04:37:50,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:50,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:50,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:37:51,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:37:51,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:51,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:51,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868855313] [2025-02-06 04:37:51,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868855313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:37:51,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:37:51,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:37:51,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876724008] [2025-02-06 04:37:51,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:37:51,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:37:51,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:51,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:37:51,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:37:51,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-02-06 04:37:51,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:51,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:51,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-02-06 04:37:51,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:51,258 INFO L124 PetriNetUnfolderBase]: 147/258 cut-off events. [2025-02-06 04:37:51,259 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-06 04:37:51,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 258 events. 147/258 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 823 event pairs, 42 based on Foata normal form. 1/216 useless extension candidates. Maximal degree in co-relation 480. Up to 168 conditions per place. [2025-02-06 04:37:51,261 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 29 selfloop transitions, 3 changer transitions 1/34 dead transitions. [2025-02-06 04:37:51,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 34 transitions, 155 flow [2025-02-06 04:37:51,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:37:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:37:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-02-06 04:37:51,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2025-02-06 04:37:51,270 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 3 states and 43 transitions. [2025-02-06 04:37:51,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 34 transitions, 155 flow [2025-02-06 04:37:51,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 34 transitions, 141 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:37:51,275 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 65 flow [2025-02-06 04:37:51,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=24, PETRI_TRANSITIONS=23} [2025-02-06 04:37:51,278 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2025-02-06 04:37:51,278 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 65 flow [2025-02-06 04:37:51,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:51,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:51,278 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:37:51,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:37:51,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:37:51,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1987199316, now seen corresponding path program 1 times [2025-02-06 04:37:51,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:51,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219807280] [2025-02-06 04:37:51,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:51,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:51,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 04:37:51,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:37:51,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:51,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:51,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:51,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:51,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219807280] [2025-02-06 04:37:51,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219807280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:37:51,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:37:51,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:37:51,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124744146] [2025-02-06 04:37:51,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:37:51,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:37:51,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:51,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:37:51,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:37:51,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-02-06 04:37:51,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:51,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:51,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-02-06 04:37:51,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:51,551 INFO L124 PetriNetUnfolderBase]: 224/411 cut-off events. [2025-02-06 04:37:51,551 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-02-06 04:37:51,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 411 events. 224/411 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1631 event pairs, 153 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 326. Up to 258 conditions per place. [2025-02-06 04:37:51,554 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 42 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-02-06 04:37:51,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 48 transitions, 226 flow [2025-02-06 04:37:51,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:37:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:37:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-02-06 04:37:51,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2025-02-06 04:37:51,555 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 65 flow. Second operand 5 states and 59 transitions. [2025-02-06 04:37:51,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 48 transitions, 226 flow [2025-02-06 04:37:51,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 48 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:37:51,556 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 98 flow [2025-02-06 04:37:51,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2025-02-06 04:37:51,556 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2025-02-06 04:37:51,556 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 98 flow [2025-02-06 04:37:51,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:51,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:51,557 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:37:51,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:37:51,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:37:51,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:51,557 INFO L85 PathProgramCache]: Analyzing trace with hash 560658685, now seen corresponding path program 1 times [2025-02-06 04:37:51,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:51,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211588137] [2025-02-06 04:37:51,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:51,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:51,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 04:37:51,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:37:51,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:51,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:51,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:51,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211588137] [2025-02-06 04:37:51,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211588137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:37:51,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:37:51,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:37:51,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911505891] [2025-02-06 04:37:51,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:37:51,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:37:51,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:51,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:37:51,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:37:51,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-02-06 04:37:51,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:51,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:51,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-02-06 04:37:51,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:51,731 INFO L124 PetriNetUnfolderBase]: 169/310 cut-off events. [2025-02-06 04:37:51,731 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-02-06 04:37:51,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 310 events. 169/310 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1117 event pairs, 121 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 625. Up to 258 conditions per place. [2025-02-06 04:37:51,733 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 21 selfloop transitions, 2 changer transitions 16/40 dead transitions. [2025-02-06 04:37:51,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 215 flow [2025-02-06 04:37:51,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:37:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:37:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-02-06 04:37:51,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2025-02-06 04:37:51,735 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 98 flow. Second operand 5 states and 53 transitions. [2025-02-06 04:37:51,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 215 flow [2025-02-06 04:37:51,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 211 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:37:51,736 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 86 flow [2025-02-06 04:37:51,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2025-02-06 04:37:51,737 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2025-02-06 04:37:51,737 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 86 flow [2025-02-06 04:37:51,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:51,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:51,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:37:51,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:37:51,738 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:37:51,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:51,738 INFO L85 PathProgramCache]: Analyzing trace with hash 167461705, now seen corresponding path program 1 times [2025-02-06 04:37:51,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:51,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825096925] [2025-02-06 04:37:51,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:51,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:51,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:37:51,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:37:51,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:51,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:51,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:51,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825096925] [2025-02-06 04:37:51,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825096925] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:37:51,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54267254] [2025-02-06 04:37:51,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:51,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:51,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:37:51,901 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-02-06 04:37:51,905 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-02-06 04:37:51,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:37:51,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:37:51,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:51,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:51,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:37:51,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:37:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:52,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:37:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:37:52,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54267254] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:37:52,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:37:52,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-02-06 04:37:52,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317634506] [2025-02-06 04:37:52,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:37:52,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:37:52,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:52,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:37:52,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:37:52,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-02-06 04:37:52,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:52,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:52,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-02-06 04:37:52,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:52,120 INFO L124 PetriNetUnfolderBase]: 147/258 cut-off events. [2025-02-06 04:37:52,121 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-02-06 04:37:52,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 258 events. 147/258 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 812 event pairs, 45 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 683. Up to 138 conditions per place. [2025-02-06 04:37:52,125 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 27 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2025-02-06 04:37:52,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 181 flow [2025-02-06 04:37:52,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:37:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:37:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2025-02-06 04:37:52,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-02-06 04:37:52,126 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 86 flow. Second operand 5 states and 45 transitions. [2025-02-06 04:37:52,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 181 flow [2025-02-06 04:37:52,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 33 transitions, 155 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-02-06 04:37:52,128 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 91 flow [2025-02-06 04:37:52,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2025-02-06 04:37:52,129 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 6 predicate places. [2025-02-06 04:37:52,129 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 91 flow [2025-02-06 04:37:52,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:52,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:52,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:37:52,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 04:37:52,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:52,335 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:37:52,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:52,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2018433192, now seen corresponding path program 1 times [2025-02-06 04:37:52,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:52,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084096787] [2025-02-06 04:37:52,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:52,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:52,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:37:52,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:37:52,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:52,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:52,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:37:52,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:37:52,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084096787] [2025-02-06 04:37:52,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084096787] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:37:52,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664031186] [2025-02-06 04:37:52,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:52,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:52,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:37:52,492 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-02-06 04:37:52,494 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-02-06 04:37:52,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:37:52,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:37:52,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:52,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:37:52,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:37:52,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:37:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:37:52,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:37:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:37:52,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664031186] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:37:52,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:37:52,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-02-06 04:37:52,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926847427] [2025-02-06 04:37:52,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:37:52,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:37:52,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:37:52,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:37:52,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:37:52,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-02-06 04:37:52,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:52,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:37:52,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-02-06 04:37:52,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:37:52,739 INFO L124 PetriNetUnfolderBase]: 145/253 cut-off events. [2025-02-06 04:37:52,742 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-02-06 04:37:52,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 253 events. 145/253 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 791 event pairs, 38 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 656. Up to 142 conditions per place. [2025-02-06 04:37:52,743 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 30 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2025-02-06 04:37:52,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 204 flow [2025-02-06 04:37:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:37:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:37:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2025-02-06 04:37:52,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2025-02-06 04:37:52,745 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 91 flow. Second operand 5 states and 46 transitions. [2025-02-06 04:37:52,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 204 flow [2025-02-06 04:37:52,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 195 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:37:52,747 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 108 flow [2025-02-06 04:37:52,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-02-06 04:37:52,748 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2025-02-06 04:37:52,748 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 108 flow [2025-02-06 04:37:52,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:37:52,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:37:52,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:37:52,772 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-02-06 04:37:52,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:37:52,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:37:52,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:37:52,954 INFO L85 PathProgramCache]: Analyzing trace with hash 508650219, now seen corresponding path program 1 times [2025-02-06 04:37:52,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:37:52,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101145254] [2025-02-06 04:37:52,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:37:52,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:37:52,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:37:52,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:37:52,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:52,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:37:52,978 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:37:52,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:37:52,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:37:52,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:37:52,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:37:53,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:37:53,020 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:37:53,021 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-02-06 04:37:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-02-06 04:37:53,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-02-06 04:37:53,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:37:53,023 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 04:37:53,048 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:37:53,048 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:37:53,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:37:53 BasicIcfg [2025-02-06 04:37:53,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:37:53,052 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:37:53,052 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:37:53,052 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:37:53,052 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:37:50" (3/4) ... [2025-02-06 04:37:53,053 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 04:37:53,091 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 34. [2025-02-06 04:37:53,140 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:37:53,140 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:37:53,140 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:37:53,145 INFO L158 Benchmark]: Toolchain (without parser) took 3101.99ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 129.1MB in the beginning and 448.4MB in the end (delta: -319.3MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2025-02-06 04:37:53,145 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 226.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:37:53,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.30ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 117.3MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:37:53,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.66ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 115.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:37:53,146 INFO L158 Benchmark]: Boogie Preprocessor took 28.30ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 113.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:37:53,146 INFO L158 Benchmark]: IcfgBuilder took 466.54ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 74.4MB in the end (delta: 39.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 04:37:53,146 INFO L158 Benchmark]: TraceAbstraction took 2265.63ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 74.4MB in the beginning and 457.7MB in the end (delta: -383.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:37:53,146 INFO L158 Benchmark]: Witness Printer took 92.49ms. Allocated memory is still 503.3MB. Free memory was 457.7MB in the beginning and 448.4MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:37:53,147 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 226.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.30ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 117.3MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.66ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 115.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.30ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 113.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 466.54ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 74.4MB in the end (delta: 39.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2265.63ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 74.4MB in the beginning and 457.7MB in the end (delta: -383.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 92.49ms. Allocated memory is still 503.3MB. Free memory was 457.7MB in the beginning and 448.4MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 78]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={-3:0}, counter=0, i=0, size=1] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={-3:0}, counter=0, i=1, size=1] [L88] COND FALSE 0 !(i < size) [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-3:0}, N=1, counter=0, t1=-5] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-3:0}, N=1, counter=0, t1=-5, t2=-4] [L57] 2 int i=0; VAL [A={-3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L48] 1 int i=0; VAL [A={-3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-6, i=0, tmp=-6] [L59] 2 counter = tmp VAL [A={-3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=6, i=0, tmp=6] [L48] 1 i++ VAL [A={-3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=6, i=1] [L48] COND FALSE 1 !(i