./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/lazy01.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/pthread/lazy01.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 b5d87933b05ad3566f9bc28daac5c0aeceb8a45433a1cac3d51a8d34f7f284f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:53:48,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:53:48,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 00:53:48,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:53:48,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:53:48,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:53:48,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:53:48,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:53:48,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:53:48,170 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:53:48,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:53:48,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:53:48,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:53:48,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:53:48,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:53:48,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:53:48,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:53:48,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:53:48,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:53:48,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:53:48,172 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:53:48,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:53:48,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:53:48,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:53:48,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:53:48,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:53:48,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:53:48,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:53:48,172 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 -> b5d87933b05ad3566f9bc28daac5c0aeceb8a45433a1cac3d51a8d34f7f284f0 [2025-02-08 00:53:48,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:53:48,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:53:48,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:53:48,405 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:53:48,405 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:53:48,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/lazy01.i [2025-02-08 00:53:49,600 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7abe14ad9/59685dd406c94590ac728e07eddf07e7/FLAG6e636590d [2025-02-08 00:53:49,882 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:53:49,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/lazy01.i [2025-02-08 00:53:49,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7abe14ad9/59685dd406c94590ac728e07eddf07e7/FLAG6e636590d [2025-02-08 00:53:50,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7abe14ad9/59685dd406c94590ac728e07eddf07e7 [2025-02-08 00:53:50,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:53:50,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:53:50,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:53:50,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:53:50,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:53:50,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:53:50" (1/1) ... [2025-02-08 00:53:50,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39718001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:53:50, skipping insertion in model container [2025-02-08 00:53:50,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:53:50" (1/1) ... [2025-02-08 00:53:50,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:53:50,448 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/pthread/lazy01.i[31042,31055] [2025-02-08 00:53:50,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:53:50,467 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:53:50,500 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/pthread/lazy01.i[31042,31055] [2025-02-08 00:53:50,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:53:50,528 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:53:50,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:53:50 WrapperNode [2025-02-08 00:53:50,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:53:50,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:53:50,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:53:50,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:53:50,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:53:50" (1/1) ... [2025-02-08 00:53:50,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:53:50" (1/1) ... [2025-02-08 00:53:50,556 INFO L138 Inliner]: procedures = 169, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2025-02-08 00:53:50,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:53:50,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:53:50,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:53:50,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:53:50,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:53:50" (1/1) ... [2025-02-08 00:53:50,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:53:50" (1/1) ... [2025-02-08 00:53:50,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:53:50" (1/1) ... [2025-02-08 00:53:50,577 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-02-08 00:53:50,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:53:50" (1/1) ... [2025-02-08 00:53:50,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:53:50" (1/1) ... [2025-02-08 00:53:50,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:53:50" (1/1) ... [2025-02-08 00:53:50,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:53:50" (1/1) ... [2025-02-08 00:53:50,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:53:50" (1/1) ... [2025-02-08 00:53:50,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:53:50" (1/1) ... [2025-02-08 00:53:50,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:53:50,587 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:53:50,588 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:53:50,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:53:50,588 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:53:50" (1/1) ... [2025-02-08 00:53:50,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:53:50,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:53:50,612 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-08 00:53:50,614 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-08 00:53:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 00:53:50,639 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 00:53:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 00:53:50,639 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 00:53:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 00:53:50,639 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 00:53:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 00:53:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:53:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:53:50,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 00:53:50,640 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 00:53:50,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:53:50,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:53:50,641 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 00:53:50,729 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:53:50,730 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:53:50,828 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 00:53:50,829 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:53:50,892 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:53:50,893 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:53:50,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:53:50 BoogieIcfgContainer [2025-02-08 00:53:50,893 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:53:50,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:53:50,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:53:50,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:53:50,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:53:50" (1/3) ... [2025-02-08 00:53:50,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e9ef15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:53:50, skipping insertion in model container [2025-02-08 00:53:50,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:53:50" (2/3) ... [2025-02-08 00:53:50,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e9ef15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:53:50, skipping insertion in model container [2025-02-08 00:53:50,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:53:50" (3/3) ... [2025-02-08 00:53:50,902 INFO L128 eAbstractionObserver]: Analyzing ICFG lazy01.i [2025-02-08 00:53:50,916 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:53:50,917 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lazy01.i that has 4 procedures, 33 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-08 00:53:50,918 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 00:53:50,957 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 00:53:50,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 87 flow [2025-02-08 00:53:51,000 INFO L124 PetriNetUnfolderBase]: 1/30 cut-off events. [2025-02-08 00:53:51,003 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 00:53:51,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 1/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-02-08 00:53:51,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 33 transitions, 87 flow [2025-02-08 00:53:51,008 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 24 transitions, 63 flow [2025-02-08 00:53:51,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:53:51,032 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@344300fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:53:51,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 00:53:51,040 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:53:51,041 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-02-08 00:53:51,041 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 00:53:51,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:53:51,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:53:51,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 00:53:51,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:53:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1755207786, now seen corresponding path program 1 times [2025-02-08 00:53:51,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:53:51,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364457345] [2025-02-08 00:53:51,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:53:51,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:53:51,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 00:53:51,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 00:53:51,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:53:51,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:53:51,287 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-08 00:53:51,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:53:51,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364457345] [2025-02-08 00:53:51,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364457345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:53:51,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:53:51,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:53:51,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954219515] [2025-02-08 00:53:51,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:53:51,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:53:51,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:53:51,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:53:51,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:53:51,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2025-02-08 00:53:51,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-08 00:53:51,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:53:51,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2025-02-08 00:53:51,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:53:51,575 INFO L124 PetriNetUnfolderBase]: 358/632 cut-off events. [2025-02-08 00:53:51,575 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 00:53:51,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 632 events. 358/632 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2917 event pairs, 124 based on Foata normal form. 4/628 useless extension candidates. Maximal degree in co-relation 1183. Up to 524 conditions per place. [2025-02-08 00:53:51,589 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 26 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2025-02-08 00:53:51,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 34 transitions, 147 flow [2025-02-08 00:53:51,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:53:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 00:53:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-02-08 00:53:51,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-02-08 00:53:51,609 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 63 flow. Second operand 3 states and 57 transitions. [2025-02-08 00:53:51,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 34 transitions, 147 flow [2025-02-08 00:53:51,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 135 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 00:53:51,619 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2025-02-08 00:53:51,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2025-02-08 00:53:51,624 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2025-02-08 00:53:51,625 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2025-02-08 00:53:51,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-08 00:53:51,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:53:51,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:53:51,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:53:51,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 00:53:51,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:53:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1613686005, now seen corresponding path program 1 times [2025-02-08 00:53:51,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:53:51,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330734440] [2025-02-08 00:53:51,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:53:51,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:53:51,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 00:53:51,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 00:53:51,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:53:51,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:53:51,788 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-08 00:53:51,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:53:51,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330734440] [2025-02-08 00:53:51,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330734440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:53:51,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:53:51,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:53:51,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292377665] [2025-02-08 00:53:51,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:53:51,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:53:51,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:53:51,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:53:51,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:53:51,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-02-08 00:53:51,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-08 00:53:51,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:53:51,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-02-08 00:53:51,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:53:51,878 INFO L124 PetriNetUnfolderBase]: 130/322 cut-off events. [2025-02-08 00:53:51,879 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 00:53:51,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 322 events. 130/322 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1399 event pairs, 38 based on Foata normal form. 55/370 useless extension candidates. Maximal degree in co-relation 372. Up to 160 conditions per place. [2025-02-08 00:53:51,882 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 24 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2025-02-08 00:53:51,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 154 flow [2025-02-08 00:53:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:53:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 00:53:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-02-08 00:53:51,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-02-08 00:53:51,884 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 3 states and 60 transitions. [2025-02-08 00:53:51,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 154 flow [2025-02-08 00:53:51,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 00:53:51,885 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 80 flow [2025-02-08 00:53:51,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2025-02-08 00:53:51,886 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2025-02-08 00:53:51,886 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 80 flow [2025-02-08 00:53:51,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-08 00:53:51,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:53:51,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:53:51,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:53:51,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 00:53:51,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:53:51,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2048590296, now seen corresponding path program 1 times [2025-02-08 00:53:51,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:53:51,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120978652] [2025-02-08 00:53:51,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:53:51,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:53:51,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 00:53:51,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 00:53:51,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:53:51,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:53:51,971 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-08 00:53:51,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:53:51,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120978652] [2025-02-08 00:53:51,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120978652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:53:51,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:53:51,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:53:51,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658374046] [2025-02-08 00:53:51,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:53:51,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:53:51,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:53:51,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:53:51,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:53:51,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2025-02-08 00:53:51,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-08 00:53:51,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:53:51,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2025-02-08 00:53:51,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:53:52,057 INFO L124 PetriNetUnfolderBase]: 150/327 cut-off events. [2025-02-08 00:53:52,058 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-02-08 00:53:52,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 327 events. 150/327 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1309 event pairs, 41 based on Foata normal form. 5/329 useless extension candidates. Maximal degree in co-relation 304. Up to 197 conditions per place. [2025-02-08 00:53:52,061 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 30 selfloop transitions, 4 changer transitions 2/41 dead transitions. [2025-02-08 00:53:52,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 198 flow [2025-02-08 00:53:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:53:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 00:53:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-02-08 00:53:52,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553030303030303 [2025-02-08 00:53:52,063 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 80 flow. Second operand 4 states and 73 transitions. [2025-02-08 00:53:52,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 198 flow [2025-02-08 00:53:52,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 00:53:52,064 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 87 flow [2025-02-08 00:53:52,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2025-02-08 00:53:52,064 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2025-02-08 00:53:52,065 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 87 flow [2025-02-08 00:53:52,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-08 00:53:52,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:53:52,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:53:52,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:53:52,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 00:53:52,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:53:52,066 INFO L85 PathProgramCache]: Analyzing trace with hash 787041896, now seen corresponding path program 1 times [2025-02-08 00:53:52,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:53:52,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181002376] [2025-02-08 00:53:52,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:53:52,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:53:52,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 00:53:52,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 00:53:52,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:53:52,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:53:52,103 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-08 00:53:52,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:53:52,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181002376] [2025-02-08 00:53:52,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181002376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:53:52,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:53:52,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:53:52,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954606034] [2025-02-08 00:53:52,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:53:52,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:53:52,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:53:52,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:53:52,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:53:52,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-02-08 00:53:52,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-08 00:53:52,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:53:52,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-02-08 00:53:52,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:53:52,168 INFO L124 PetriNetUnfolderBase]: 146/315 cut-off events. [2025-02-08 00:53:52,169 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-02-08 00:53:52,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 315 events. 146/315 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1236 event pairs, 35 based on Foata normal form. 4/316 useless extension candidates. Maximal degree in co-relation 306. Up to 142 conditions per place. [2025-02-08 00:53:52,171 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 31 selfloop transitions, 5 changer transitions 2/43 dead transitions. [2025-02-08 00:53:52,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 209 flow [2025-02-08 00:53:52,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:53:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 00:53:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-02-08 00:53:52,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2025-02-08 00:53:52,173 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 87 flow. Second operand 4 states and 71 transitions. [2025-02-08 00:53:52,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 209 flow [2025-02-08 00:53:52,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 201 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 00:53:52,174 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 95 flow [2025-02-08 00:53:52,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2025-02-08 00:53:52,175 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2025-02-08 00:53:52,175 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 95 flow [2025-02-08 00:53:52,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-08 00:53:52,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:53:52,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:53:52,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:53:52,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 00:53:52,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:53:52,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1104866750, now seen corresponding path program 1 times [2025-02-08 00:53:52,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:53:52,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554730533] [2025-02-08 00:53:52,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:53:52,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:53:52,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 00:53:52,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 00:53:52,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:53:52,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:53:52,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:53:52,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 00:53:52,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 00:53:52,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:53:52,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:53:52,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:53:52,225 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:53:52,226 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thread3Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-02-08 00:53:52,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-08 00:53:52,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-02-08 00:53:52,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-02-08 00:53:52,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-02-08 00:53:52,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:53:52,228 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 00:53:52,257 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 00:53:52,257 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:53:52,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:53:52 BasicIcfg [2025-02-08 00:53:52,262 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:53:52,263 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:53:52,263 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:53:52,263 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:53:52,264 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:53:50" (3/4) ... [2025-02-08 00:53:52,264 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 00:53:52,304 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 2. [2025-02-08 00:53:52,333 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 00:53:52,334 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 00:53:52,334 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:53:52,335 INFO L158 Benchmark]: Toolchain (without parser) took 2143.10ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 61.9MB in the end (delta: 43.4MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2025-02-08 00:53:52,335 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:53:52,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.21ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 84.7MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:53:52,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.05ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 83.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:53:52,336 INFO L158 Benchmark]: Boogie Preprocessor took 28.63ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 81.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:53:52,338 INFO L158 Benchmark]: IcfgBuilder took 305.79ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 60.3MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:53:52,338 INFO L158 Benchmark]: TraceAbstraction took 1367.71ms. Allocated memory is still 142.6MB. Free memory was 59.6MB in the beginning and 69.4MB in the end (delta: -9.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:53:52,338 INFO L158 Benchmark]: Witness Printer took 70.83ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 61.9MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:53:52,339 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.21ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 84.7MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.05ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 83.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.63ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 81.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 305.79ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 60.3MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1367.71ms. Allocated memory is still 142.6MB. Free memory was 59.6MB in the beginning and 69.4MB in the end (delta: -9.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 70.83ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 61.9MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L703] 0 int data = 0; [L731] 0 pthread_t t1, t2, t3; [L732] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, data=0, mutex={3:0}, t1=-2] [L733] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, data=0, mutex={3:0}, t1=-2, t2=-1] [L734] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, data=0, mutex={3:0}, t1=-2, t2=-1, t3=0] [L707] 1 data++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, data=1, mutex={3:0}] [L714] 2 data+=2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L721] COND TRUE 3 data >= 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L722] 3 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] - UnprovableResult [Line: 734]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 57 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 3 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 157 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 00:53:52,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE