./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i --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/pthread-C-DAC/pthread-demo-datarace-3.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 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:28:12,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:28:12,863 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:28:12,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:28:12,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:28:12,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:28:12,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:28:12,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:28:12,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:28:12,882 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:28:12,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:28:12,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:28:12,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:28:12,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:28:12,882 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:28:12,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:28:12,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:28:12,883 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:28:12,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:28:12,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:28:12,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:28:12,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:28:12,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:28:12,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:28:12,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:28:12,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:28:12,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:28:12,883 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:28:12,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:28:12,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:28:12,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:28:12,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:28:12,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:28:12,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:28:12,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:28:12,884 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:28:12,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:28:12,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:28:12,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:28:12,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:28:12,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:28:12,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:28:12,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:28:12,884 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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2025-02-06 04:28:13,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:28:13,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:28:13,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:28:13,121 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:28:13,122 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:28:13,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2025-02-06 04:28:14,265 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e4bed653/4fa10523429043d5b11f35935b7939e0/FLAG8b473d550 [2025-02-06 04:28:14,547 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:28:14,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2025-02-06 04:28:14,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e4bed653/4fa10523429043d5b11f35935b7939e0/FLAG8b473d550 [2025-02-06 04:28:14,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e4bed653/4fa10523429043d5b11f35935b7939e0 [2025-02-06 04:28:14,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:28:14,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:28:14,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:28:14,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:28:14,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:28:14,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:28:14" (1/1) ... [2025-02-06 04:28:14,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301a885f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:28:14, skipping insertion in model container [2025-02-06 04:28:14,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:28:14" (1/1) ... [2025-02-06 04:28:14,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:28:14,743 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-C-DAC/pthread-demo-datarace-3.i[818,831] [2025-02-06 04:28:15,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:28:15,027 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:28:15,036 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-C-DAC/pthread-demo-datarace-3.i[818,831] [2025-02-06 04:28:15,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:28:15,137 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:28:15,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:28:15 WrapperNode [2025-02-06 04:28:15,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:28:15,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:28:15,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:28:15,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:28:15,143 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:28:15" (1/1) ... [2025-02-06 04:28:15,161 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:28:15" (1/1) ... [2025-02-06 04:28:15,178 INFO L138 Inliner]: procedures = 364, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 111 [2025-02-06 04:28:15,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:28:15,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:28:15,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:28:15,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:28:15,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:28:15" (1/1) ... [2025-02-06 04:28:15,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:28:15" (1/1) ... [2025-02-06 04:28:15,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:28:15" (1/1) ... [2025-02-06 04:28:15,198 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 04:28:15,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:28:15" (1/1) ... [2025-02-06 04:28:15,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:28:15" (1/1) ... [2025-02-06 04:28:15,202 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:28:15" (1/1) ... [2025-02-06 04:28:15,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:28:15" (1/1) ... [2025-02-06 04:28:15,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:28:15" (1/1) ... [2025-02-06 04:28:15,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:28:15" (1/1) ... [2025-02-06 04:28:15,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:28:15,206 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:28:15,206 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:28:15,206 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:28:15,206 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:28:15" (1/1) ... [2025-02-06 04:28:15,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:28:15,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:28:15,231 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:28:15,234 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:28:15,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:28:15,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:28:15,247 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2025-02-06 04:28:15,247 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2025-02-06 04:28:15,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:28:15,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:28:15,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:28:15,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:28:15,248 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:28:15,339 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:28:15,340 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:28:15,489 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:28:15,489 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:28:15,650 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:28:15,651 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:28:15,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:28:15 BoogieIcfgContainer [2025-02-06 04:28:15,651 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:28:15,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:28:15,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:28:15,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:28:15,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:28:14" (1/3) ... [2025-02-06 04:28:15,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e1271e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:28:15, skipping insertion in model container [2025-02-06 04:28:15,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:28:15" (2/3) ... [2025-02-06 04:28:15,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e1271e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:28:15, skipping insertion in model container [2025-02-06 04:28:15,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:28:15" (3/3) ... [2025-02-06 04:28:15,659 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2025-02-06 04:28:15,671 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:28:15,672 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-3.i that has 2 procedures, 20 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-06 04:28:15,672 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:28:15,704 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 04:28:15,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 22 transitions, 51 flow [2025-02-06 04:28:15,748 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2025-02-06 04:28:15,750 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:28:15,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 21 events. 3/21 cut-off events. For 1/1 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/17 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-02-06 04:28:15,755 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 22 transitions, 51 flow [2025-02-06 04:28:15,757 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 18 transitions, 42 flow [2025-02-06 04:28:15,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:28:15,780 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;@53b74afe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:28:15,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 04:28:15,787 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:28:15,789 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-02-06 04:28:15,790 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:28:15,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:28:15,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:28:15,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:28:15,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:28:15,795 INFO L85 PathProgramCache]: Analyzing trace with hash 972646802, now seen corresponding path program 1 times [2025-02-06 04:28:15,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:28:15,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589150178] [2025-02-06 04:28:15,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:28:15,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:28:15,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 04:28:15,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 04:28:15,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:28:15,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:28:16,022 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:28:16,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:28:16,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589150178] [2025-02-06 04:28:16,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589150178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:28:16,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:28:16,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:28:16,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892091132] [2025-02-06 04:28:16,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:28:16,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:28:16,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:28:16,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:28:16,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:28:16,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-02-06 04:28:16,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:28:16,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:28:16,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-02-06 04:28:16,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:28:16,128 INFO L124 PetriNetUnfolderBase]: 37/88 cut-off events. [2025-02-06 04:28:16,128 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:28:16,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 88 events. 37/88 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 274 event pairs, 15 based on Foata normal form. 6/93 useless extension candidates. Maximal degree in co-relation 154. Up to 53 conditions per place. [2025-02-06 04:28:16,131 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 20 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2025-02-06 04:28:16,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 26 transitions, 102 flow [2025-02-06 04:28:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:28:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:28:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-02-06 04:28:16,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-02-06 04:28:16,142 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 42 flow. Second operand 3 states and 41 transitions. [2025-02-06 04:28:16,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 26 transitions, 102 flow [2025-02-06 04:28:16,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 26 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:28:16,148 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 50 flow [2025-02-06 04:28:16,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2025-02-06 04:28:16,152 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2025-02-06 04:28:16,154 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 50 flow [2025-02-06 04:28:16,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:28:16,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:28:16,154 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:28:16,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:28:16,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:28:16,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:28:16,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1542010021, now seen corresponding path program 1 times [2025-02-06 04:28:16,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:28:16,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699911844] [2025-02-06 04:28:16,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:28:16,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:28:16,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 04:28:16,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 04:28:16,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:28:16,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:28:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:28:16,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:28:16,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699911844] [2025-02-06 04:28:16,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699911844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:28:16,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:28:16,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:28:16,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098685133] [2025-02-06 04:28:16,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:28:16,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:28:16,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:28:16,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:28:16,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:28:16,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 22 [2025-02-06 04:28:16,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:28:16,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:28:16,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 22 [2025-02-06 04:28:16,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:28:16,360 INFO L124 PetriNetUnfolderBase]: 51/121 cut-off events. [2025-02-06 04:28:16,362 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-06 04:28:16,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 121 events. 51/121 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 370 event pairs, 20 based on Foata normal form. 5/126 useless extension candidates. Maximal degree in co-relation 65. Up to 65 conditions per place. [2025-02-06 04:28:16,364 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 20 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-02-06 04:28:16,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 27 transitions, 118 flow [2025-02-06 04:28:16,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:28:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:28:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-02-06 04:28:16,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-02-06 04:28:16,365 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 50 flow. Second operand 3 states and 42 transitions. [2025-02-06 04:28:16,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 27 transitions, 118 flow [2025-02-06 04:28:16,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:28:16,367 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 60 flow [2025-02-06 04:28:16,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-02-06 04:28:16,367 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2025-02-06 04:28:16,368 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 60 flow [2025-02-06 04:28:16,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:28:16,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:28:16,368 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:28:16,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:28:16,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:28:16,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:28:16,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1336724921, now seen corresponding path program 1 times [2025-02-06 04:28:16,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:28:16,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901441080] [2025-02-06 04:28:16,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:28:16,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:28:16,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:28:16,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:28:16,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:28:16,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:28:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:28:16,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:28:16,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901441080] [2025-02-06 04:28:16,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901441080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:28:16,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:28:16,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:28:16,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665380778] [2025-02-06 04:28:16,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:28:16,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:28:16,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:28:16,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:28:16,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:28:16,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-02-06 04:28:16,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:28:16,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:28:16,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-02-06 04:28:16,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:28:16,570 INFO L124 PetriNetUnfolderBase]: 81/193 cut-off events. [2025-02-06 04:28:16,570 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-02-06 04:28:16,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 193 events. 81/193 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 711 event pairs, 27 based on Foata normal form. 10/203 useless extension candidates. Maximal degree in co-relation 143. Up to 85 conditions per place. [2025-02-06 04:28:16,573 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 30 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2025-02-06 04:28:16,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 37 transitions, 182 flow [2025-02-06 04:28:16,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:28:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:28:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-02-06 04:28:16,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-02-06 04:28:16,576 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 60 flow. Second operand 4 states and 55 transitions. [2025-02-06 04:28:16,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 37 transitions, 182 flow [2025-02-06 04:28:16,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 37 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:28:16,577 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 74 flow [2025-02-06 04:28:16,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2025-02-06 04:28:16,578 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2025-02-06 04:28:16,578 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 74 flow [2025-02-06 04:28:16,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:28:16,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:28:16,579 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:28:16,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:28:16,579 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:28:16,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:28:16,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1590034288, now seen corresponding path program 2 times [2025-02-06 04:28:16,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:28:16,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571186450] [2025-02-06 04:28:16,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:28:16,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:28:16,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-06 04:28:16,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 21 statements. [2025-02-06 04:28:16,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:28:16,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:28:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 04:28:16,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:28:16,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571186450] [2025-02-06 04:28:16,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571186450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:28:16,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:28:16,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:28:16,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524885582] [2025-02-06 04:28:16,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:28:16,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:28:16,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:28:16,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:28:16,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:28:16,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 22 [2025-02-06 04:28:16,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:28:16,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:28:16,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 22 [2025-02-06 04:28:16,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:28:16,749 INFO L124 PetriNetUnfolderBase]: 99/229 cut-off events. [2025-02-06 04:28:16,749 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-02-06 04:28:16,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 229 events. 99/229 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 815 event pairs, 30 based on Foata normal form. 7/236 useless extension candidates. Maximal degree in co-relation 198. Up to 89 conditions per place. [2025-02-06 04:28:16,751 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 30 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2025-02-06 04:28:16,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 38 transitions, 212 flow [2025-02-06 04:28:16,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:28:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:28:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-02-06 04:28:16,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-02-06 04:28:16,752 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 74 flow. Second operand 4 states and 56 transitions. [2025-02-06 04:28:16,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 38 transitions, 212 flow [2025-02-06 04:28:16,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 38 transitions, 194 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 04:28:16,753 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 84 flow [2025-02-06 04:28:16,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2025-02-06 04:28:16,754 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 8 predicate places. [2025-02-06 04:28:16,754 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 84 flow [2025-02-06 04:28:16,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:28:16,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:28:16,754 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:28:16,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:28:16,754 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:28:16,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:28:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash -554322016, now seen corresponding path program 3 times [2025-02-06 04:28:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:28:16,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540894430] [2025-02-06 04:28:16,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:28:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:28:16,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-02-06 04:28:16,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 26 statements. [2025-02-06 04:28:16,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:28:16,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:28:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 04:28:16,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:28:16,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540894430] [2025-02-06 04:28:16,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540894430] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:28:16,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12117836] [2025-02-06 04:28:16,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:28:16,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:28:16,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:28:16,850 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:28:16,851 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:28:16,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-02-06 04:28:16,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 26 statements. [2025-02-06 04:28:16,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:28:16,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:28:16,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:28:16,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:28:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 04:28:16,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:28:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 04:28:17,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12117836] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:28:17,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:28:17,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-06 04:28:17,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870273785] [2025-02-06 04:28:17,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:28:17,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:28:17,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:28:17,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:28:17,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:28:17,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2025-02-06 04:28:17,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 84 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:28:17,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:28:17,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2025-02-06 04:28:17,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:28:17,202 INFO L124 PetriNetUnfolderBase]: 295/599 cut-off events. [2025-02-06 04:28:17,202 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2025-02-06 04:28:17,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1626 conditions, 599 events. 295/599 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2403 event pairs, 26 based on Foata normal form. 56/655 useless extension candidates. Maximal degree in co-relation 517. Up to 98 conditions per place. [2025-02-06 04:28:17,208 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 73 selfloop transitions, 8 changer transitions 0/84 dead transitions. [2025-02-06 04:28:17,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 84 transitions, 514 flow [2025-02-06 04:28:17,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:28:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:28:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2025-02-06 04:28:17,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6306818181818182 [2025-02-06 04:28:17,224 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 84 flow. Second operand 8 states and 111 transitions. [2025-02-06 04:28:17,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 84 transitions, 514 flow [2025-02-06 04:28:17,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 84 transitions, 472 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-02-06 04:28:17,226 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 136 flow [2025-02-06 04:28:17,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=136, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2025-02-06 04:28:17,227 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 18 predicate places. [2025-02-06 04:28:17,227 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 136 flow [2025-02-06 04:28:17,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:28:17,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:28:17,227 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:28:17,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:28:17,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:28:17,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:28:17,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:28:17,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1730667446, now seen corresponding path program 4 times [2025-02-06 04:28:17,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:28:17,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264388334] [2025-02-06 04:28:17,429 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:28:17,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:28:17,443 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-02-06 04:28:17,449 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 04:28:17,449 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:28:17,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:28:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-06 04:28:17,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:28:17,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264388334] [2025-02-06 04:28:17,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264388334] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:28:17,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167809963] [2025-02-06 04:28:17,525 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:28:17,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:28:17,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:28:17,527 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:28:17,529 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:28:17,595 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-02-06 04:28:17,615 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 04:28:17,615 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:28:17,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:28:17,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:28:17,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:28:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:28:17,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:28:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:28:17,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167809963] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:28:17,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:28:17,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-02-06 04:28:17,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502670583] [2025-02-06 04:28:17,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:28:17,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 04:28:17,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:28:17,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 04:28:17,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2025-02-06 04:28:17,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2025-02-06 04:28:17,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 136 flow. Second operand has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 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:28:17,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:28:17,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2025-02-06 04:28:17,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:28:18,822 INFO L124 PetriNetUnfolderBase]: 811/1724 cut-off events. [2025-02-06 04:28:18,823 INFO L125 PetriNetUnfolderBase]: For 4611/4611 co-relation queries the response was YES. [2025-02-06 04:28:18,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5358 conditions, 1724 events. 811/1724 cut-off events. For 4611/4611 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7866 event pairs, 10 based on Foata normal form. 189/1913 useless extension candidates. Maximal degree in co-relation 1986. Up to 288 conditions per place. [2025-02-06 04:28:18,838 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 330 selfloop transitions, 124 changer transitions 0/457 dead transitions. [2025-02-06 04:28:18,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 457 transitions, 2812 flow [2025-02-06 04:28:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-02-06 04:28:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-02-06 04:28:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 806 transitions. [2025-02-06 04:28:18,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6005961251862891 [2025-02-06 04:28:18,845 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 136 flow. Second operand 61 states and 806 transitions. [2025-02-06 04:28:18,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 457 transitions, 2812 flow [2025-02-06 04:28:18,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 457 transitions, 2604 flow, removed 96 selfloop flow, removed 2 redundant places. [2025-02-06 04:28:18,860 INFO L231 Difference]: Finished difference. Result has 138 places, 140 transitions, 1300 flow [2025-02-06 04:28:18,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=1300, PETRI_PLACES=138, PETRI_TRANSITIONS=140} [2025-02-06 04:28:18,861 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 118 predicate places. [2025-02-06 04:28:18,861 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 140 transitions, 1300 flow [2025-02-06 04:28:18,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 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:28:18,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:28:18,861 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:28:18,868 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:28:19,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:28:19,062 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:28:19,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:28:19,062 INFO L85 PathProgramCache]: Analyzing trace with hash 429030636, now seen corresponding path program 5 times [2025-02-06 04:28:19,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:28:19,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984247344] [2025-02-06 04:28:19,063 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:28:19,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:28:19,086 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 67 statements into 15 equivalence classes. [2025-02-06 04:28:19,106 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 04:28:19,106 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-02-06 04:28:19,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:28:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-02-06 04:28:19,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:28:19,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984247344] [2025-02-06 04:28:19,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984247344] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:28:19,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127220534] [2025-02-06 04:28:19,179 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:28:19,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:28:19,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:28:19,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:28:19,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:28:19,259 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 67 statements into 15 equivalence classes. [2025-02-06 04:28:19,283 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 04:28:19,283 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-02-06 04:28:19,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:28:19,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 04:28:19,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:28:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 04:28:19,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:28:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 04:28:19,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127220534] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:28:19,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:28:19,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 17, 17] total 26 [2025-02-06 04:28:19,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900783117] [2025-02-06 04:28:19,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:28:19,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 04:28:19,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:28:19,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 04:28:19,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=405, Unknown=0, NotChecked=0, Total=650 [2025-02-06 04:28:19,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2025-02-06 04:28:19,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 140 transitions, 1300 flow. Second operand has 26 states, 26 states have (on average 8.692307692307692) internal successors, (226), 26 states have internal predecessors, (226), 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:28:19,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:28:19,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2025-02-06 04:28:19,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:28:21,868 INFO L124 PetriNetUnfolderBase]: 1387/2971 cut-off events. [2025-02-06 04:28:21,868 INFO L125 PetriNetUnfolderBase]: For 147502/147502 co-relation queries the response was YES. [2025-02-06 04:28:21,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14222 conditions, 2971 events. 1387/2971 cut-off events. For 147502/147502 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 14505 event pairs, 18 based on Foata normal form. 195/3166 useless extension candidates. Maximal degree in co-relation 12787. Up to 484 conditions per place. [2025-02-06 04:28:21,897 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 566 selfloop transitions, 239 changer transitions 0/808 dead transitions. [2025-02-06 04:28:21,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 808 transitions, 8082 flow [2025-02-06 04:28:21,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-02-06 04:28:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2025-02-06 04:28:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 1362 transitions. [2025-02-06 04:28:21,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5840480274442539 [2025-02-06 04:28:21,906 INFO L175 Difference]: Start difference. First operand has 138 places, 140 transitions, 1300 flow. Second operand 106 states and 1362 transitions. [2025-02-06 04:28:21,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 808 transitions, 8082 flow [2025-02-06 04:28:21,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 808 transitions, 7816 flow, removed 54 selfloop flow, removed 7 redundant places. [2025-02-06 04:28:21,985 INFO L231 Difference]: Finished difference. Result has 285 places, 259 transitions, 3596 flow [2025-02-06 04:28:21,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=3596, PETRI_PLACES=285, PETRI_TRANSITIONS=259} [2025-02-06 04:28:21,986 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 265 predicate places. [2025-02-06 04:28:21,986 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 259 transitions, 3596 flow [2025-02-06 04:28:21,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.692307692307692) internal successors, (226), 26 states have internal predecessors, (226), 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:28:21,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:28:21,986 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:28:21,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 04:28:22,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:28:22,187 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:28:22,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:28:22,188 INFO L85 PathProgramCache]: Analyzing trace with hash 803038574, now seen corresponding path program 6 times [2025-02-06 04:28:22,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:28:22,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466492916] [2025-02-06 04:28:22,188 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:28:22,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:28:22,203 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 90 statements into 21 equivalence classes. [2025-02-06 04:28:22,225 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 54 of 90 statements. [2025-02-06 04:28:22,225 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-02-06 04:28:22,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:28:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-02-06 04:28:22,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:28:22,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466492916] [2025-02-06 04:28:22,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466492916] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:28:22,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148409920] [2025-02-06 04:28:22,337 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:28:22,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:28:22,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:28:22,338 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:28:22,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:28:22,405 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 90 statements into 21 equivalence classes. [2025-02-06 04:28:22,438 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 54 of 90 statements. [2025-02-06 04:28:22,438 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-02-06 04:28:22,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:28:22,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:28:22,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:28:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-02-06 04:28:22,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:28:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-02-06 04:28:22,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148409920] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:28:22,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:28:22,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 04:28:22,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946116700] [2025-02-06 04:28:22,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:28:22,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:28:22,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:28:22,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:28:22,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:28:22,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-02-06 04:28:22,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 259 transitions, 3596 flow. Second operand has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 13 states have internal predecessors, (138), 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:28:22,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:28:22,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-02-06 04:28:22,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:28:23,479 INFO L124 PetriNetUnfolderBase]: 2349/4882 cut-off events. [2025-02-06 04:28:23,479 INFO L125 PetriNetUnfolderBase]: For 386409/386643 co-relation queries the response was YES. [2025-02-06 04:28:23,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33796 conditions, 4882 events. 2349/4882 cut-off events. For 386409/386643 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 29019 event pairs, 294 based on Foata normal form. 358/5110 useless extension candidates. Maximal degree in co-relation 31346. Up to 1113 conditions per place. [2025-02-06 04:28:23,533 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 287 selfloop transitions, 136 changer transitions 0/437 dead transitions. [2025-02-06 04:28:23,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 437 transitions, 6390 flow [2025-02-06 04:28:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:28:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:28:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2025-02-06 04:28:23,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-02-06 04:28:23,534 INFO L175 Difference]: Start difference. First operand has 285 places, 259 transitions, 3596 flow. Second operand 12 states and 168 transitions. [2025-02-06 04:28:23,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 437 transitions, 6390 flow [2025-02-06 04:28:23,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 437 transitions, 5318 flow, removed 341 selfloop flow, removed 52 redundant places. [2025-02-06 04:28:23,894 INFO L231 Difference]: Finished difference. Result has 251 places, 265 transitions, 3420 flow [2025-02-06 04:28:23,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=2680, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3420, PETRI_PLACES=251, PETRI_TRANSITIONS=265} [2025-02-06 04:28:23,895 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 231 predicate places. [2025-02-06 04:28:23,895 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 265 transitions, 3420 flow [2025-02-06 04:28:23,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 13 states have internal predecessors, (138), 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:28:23,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:28:23,895 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:28:23,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 04:28:24,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-06 04:28:24,096 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:28:24,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:28:24,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1702713010, now seen corresponding path program 7 times [2025-02-06 04:28:24,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:28:24,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102120895] [2025-02-06 04:28:24,097 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:28:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:28:24,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 04:28:24,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 04:28:24,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:28:24,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:28:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-02-06 04:28:24,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:28:24,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102120895] [2025-02-06 04:28:24,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102120895] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:28:24,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885204665] [2025-02-06 04:28:24,308 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:28:24,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:28:24,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:28:24,310 INFO L229 MonitoredProcess]: Starting monitored process 6 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:28:24,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 04:28:24,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 04:28:24,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 04:28:24,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:28:24,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:28:24,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 04:28:24,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:28:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-02-06 04:28:24,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:28:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-02-06 04:28:24,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885204665] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:28:24,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:28:24,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-02-06 04:28:24,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546741568] [2025-02-06 04:28:24,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:28:24,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 04:28:24,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:28:24,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 04:28:24,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-02-06 04:28:24,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-02-06 04:28:24,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 265 transitions, 3420 flow. Second operand has 23 states, 23 states have (on average 10.869565217391305) internal successors, (250), 23 states have internal predecessors, (250), 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:28:24,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:28:24,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-02-06 04:28:24,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:28:26,724 INFO L124 PetriNetUnfolderBase]: 4599/9382 cut-off events. [2025-02-06 04:28:26,724 INFO L125 PetriNetUnfolderBase]: For 959372/959852 co-relation queries the response was YES. [2025-02-06 04:28:26,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72434 conditions, 9382 events. 4599/9382 cut-off events. For 959372/959852 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 58567 event pairs, 444 based on Foata normal form. 606/9708 useless extension candidates. Maximal degree in co-relation 66945. Up to 2163 conditions per place. [2025-02-06 04:28:26,812 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 547 selfloop transitions, 146 changer transitions 0/707 dead transitions. [2025-02-06 04:28:26,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 707 transitions, 9364 flow [2025-02-06 04:28:26,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 04:28:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 04:28:26,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 312 transitions. [2025-02-06 04:28:26,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6446280991735537 [2025-02-06 04:28:26,813 INFO L175 Difference]: Start difference. First operand has 251 places, 265 transitions, 3420 flow. Second operand 22 states and 312 transitions. [2025-02-06 04:28:26,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 707 transitions, 9364 flow [2025-02-06 04:28:27,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 707 transitions, 8450 flow, removed 352 selfloop flow, removed 4 redundant places. [2025-02-06 04:28:27,433 INFO L231 Difference]: Finished difference. Result has 279 places, 276 transitions, 3696 flow [2025-02-06 04:28:27,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=2946, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3696, PETRI_PLACES=279, PETRI_TRANSITIONS=276} [2025-02-06 04:28:27,435 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 259 predicate places. [2025-02-06 04:28:27,435 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 276 transitions, 3696 flow [2025-02-06 04:28:27,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.869565217391305) internal successors, (250), 23 states have internal predecessors, (250), 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:28:27,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:28:27,435 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:28:27,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 04:28:27,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:28:27,637 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:28:27,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:28:27,639 INFO L85 PathProgramCache]: Analyzing trace with hash 599252390, now seen corresponding path program 8 times [2025-02-06 04:28:27,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:28:27,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194326522] [2025-02-06 04:28:27,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:28:27,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:28:27,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-02-06 04:28:27,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 04:28:27,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:28:27,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:28:27,731 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:28:27,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 04:28:27,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 04:28:27,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:28:27,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:28:27,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:28:27,841 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:28:27,841 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-06 04:28:27,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-02-06 04:28:27,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:28:27,844 INFO L422 BasicCegarLoop]: Path program histogram: [8, 1, 1] [2025-02-06 04:28:27,951 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:28:27,951 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:28:27,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:28:27 BasicIcfg [2025-02-06 04:28:27,955 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:28:27,956 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:28:27,956 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:28:27,956 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:28:27,957 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:28:15" (3/4) ... [2025-02-06 04:28:27,958 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 04:28:28,066 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 47. [2025-02-06 04:28:28,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:28:28,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:28:28,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:28:28,130 INFO L158 Benchmark]: Toolchain (without parser) took 13549.47ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 104.7MB in the beginning and 652.7MB in the end (delta: -548.0MB). Peak memory consumption was 373.1MB. Max. memory is 16.1GB. [2025-02-06 04:28:28,130 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:28:28,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.33ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 67.2MB in the end (delta: 37.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 04:28:28,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.54ms. Allocated memory is still 142.6MB. Free memory was 67.2MB in the beginning and 64.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:28:28,130 INFO L158 Benchmark]: Boogie Preprocessor took 25.40ms. Allocated memory is still 142.6MB. Free memory was 64.9MB in the beginning and 63.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:28:28,130 INFO L158 Benchmark]: IcfgBuilder took 445.22ms. Allocated memory is still 142.6MB. Free memory was 63.3MB in the beginning and 90.1MB in the end (delta: -26.7MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2025-02-06 04:28:28,133 INFO L158 Benchmark]: TraceAbstraction took 12301.86ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 89.3MB in the beginning and 673.3MB in the end (delta: -584.0MB). Peak memory consumption was 340.3MB. Max. memory is 16.1GB. [2025-02-06 04:28:28,133 INFO L158 Benchmark]: Witness Printer took 173.20ms. Allocated memory is still 1.1GB. Free memory was 673.3MB in the beginning and 652.7MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:28:28,134 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.29ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 557.33ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 67.2MB in the end (delta: 37.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.54ms. Allocated memory is still 142.6MB. Free memory was 67.2MB in the beginning and 64.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.40ms. Allocated memory is still 142.6MB. Free memory was 64.9MB in the beginning and 63.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 445.22ms. Allocated memory is still 142.6MB. Free memory was 63.3MB in the beginning and 90.1MB in the end (delta: -26.7MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12301.86ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 89.3MB in the beginning and 673.3MB in the end (delta: -584.0MB). Peak memory consumption was 340.3MB. Max. memory is 16.1GB. * Witness Printer took 173.20ms. Allocated memory is still 1.1GB. Free memory was 673.3MB in the beginning and 652.7MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread=-1] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=0, myglobal=1, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=1, myglobal=1, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=1, myglobal=1, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=1, myglobal=2, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=2, myglobal=2, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=2, myglobal=2, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=2, myglobal=3, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=3, myglobal=3, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=3, myglobal=3, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=3, myglobal=4, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=4, myglobal=4, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=4, myglobal=4, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=4, myglobal=5, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=5, myglobal=5, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=5, myglobal=5, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=5, myglobal=6, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=6, myglobal=6, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=6, myglobal=6, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=6, myglobal=7, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=7, myglobal=7, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=7, myglobal=7, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=7, myglobal=8, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=8, myglobal=8, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=8, myglobal=8, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=8, myglobal=9, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=9, myglobal=9, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=9, myglobal=9, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=9, myglobal=10, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=10, myglobal=10, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=10, myglobal=10, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=10, myglobal=11, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=11, myglobal=11, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=11, myglobal=11, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=11, myglobal=12, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=12, myglobal=12, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=12, myglobal=12, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=12, myglobal=13, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=13, myglobal=13, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=13, myglobal=13, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=13, myglobal=14, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=14, myglobal=14, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=14, myglobal=14, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=14, myglobal=15, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=15, myglobal=15, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=15, myglobal=15, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=15, myglobal=16, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=16, myglobal=16, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=16, myglobal=16, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=16, myglobal=17, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=17, myglobal=17, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=17, myglobal=17, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=17, myglobal=18, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=18, myglobal=18, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=18, myglobal=18, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=18, myglobal=19, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=19, myglobal=19, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=19, myglobal=19, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=19, myglobal=20, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=20, myglobal=20, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=20] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=20] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=20, myglobal=20] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=21, myglobal=21] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=22, myglobal=22] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=23, myglobal=23] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=24, myglobal=24] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=25, myglobal=25] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=26, myglobal=26] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=27, myglobal=27] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=28, myglobal=28] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=29, myglobal=29] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=30, myglobal=30] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=31, myglobal=31] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=32, myglobal=32] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=33, myglobal=33] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=34, myglobal=34] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=35, myglobal=35] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=36, myglobal=36] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=37, myglobal=37] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=38, myglobal=38] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=39, myglobal=39] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=40, myglobal=40] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1352] COND FALSE 0 !(i<20) VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread=-1] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread=-1] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) VAL [\old(arg)={0:0}, \old(cond)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=40, myglobal=40] [L13] 0 reach_error() VAL [\old(arg)={0:0}, \old(cond)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=40, myglobal=40] - UnprovableResult [Line: 1342]: 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 3 procedures, 28 locations, 2 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: 12.1s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1913 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1896 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1272 IncrementalHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 6 mSDtfsCounter, 1272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 966 GetRequests, 746 SyntacticMatches, 12 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4386 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3696occurred in iteration=9, InterpolantAutomatonStates: 223, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 914 NumberOfCodeBlocks, 826 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1066 ConstructedInterpolants, 0 QuantifiedInterpolants, 2472 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1025 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 3950/5485 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-06 04:28:28,154 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