./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind2-nondet.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind2-nondet.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 797a9e1bf9dc9387a2e0877719131f75c1f5b0797aa4bcc7c94038568bc56c2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:51:58,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:51:58,529 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:51:58,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:51:58,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:51:58,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:51:58,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:51:58,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:51:58,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:51:58,562 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:51:58,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:51:58,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:51:58,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:51:58,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:51:58,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:51:58,563 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:51:58,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:51:58,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:51:58,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:51:58,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:51:58,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:51:58,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:51:58,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:51:58,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:51:58,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:51:58,568 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:51:58,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:51:58,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:51:58,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:51:58,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:51:58,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:51:58,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:51:58,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:51:58,569 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 -> 797a9e1bf9dc9387a2e0877719131f75c1f5b0797aa4bcc7c94038568bc56c2d [2025-01-09 16:51:58,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:51:58,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:51:58,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:51:58,878 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:51:58,878 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:51:58,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-nondet.i [2025-01-09 16:52:00,259 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36422ffa4/8c01baad612e451c9e9858466df2cf02/FLAG2e1487886 [2025-01-09 16:52:00,537 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:52:00,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-nondet.i [2025-01-09 16:52:00,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36422ffa4/8c01baad612e451c9e9858466df2cf02/FLAG2e1487886 [2025-01-09 16:52:00,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36422ffa4/8c01baad612e451c9e9858466df2cf02 [2025-01-09 16:52:00,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:52:00,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:52:00,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:52:00,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:52:00,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:52:00,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:52:00" (1/1) ... [2025-01-09 16:52:00,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a292954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00, skipping insertion in model container [2025-01-09 16:52:00,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:52:00" (1/1) ... [2025-01-09 16:52:00,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:52:00,853 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-theta/unwind2-nondet.i[33026,33039] [2025-01-09 16:52:00,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:52:00,878 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:52:00,922 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-theta/unwind2-nondet.i[33026,33039] [2025-01-09 16:52:00,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:52:00,950 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:52:00,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00 WrapperNode [2025-01-09 16:52:00,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:52:00,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:52:00,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:52:00,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:52:00,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00" (1/1) ... [2025-01-09 16:52:00,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00" (1/1) ... [2025-01-09 16:52:00,985 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2025-01-09 16:52:00,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:52:00,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:52:00,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:52:00,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:52:00,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00" (1/1) ... [2025-01-09 16:52:00,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00" (1/1) ... [2025-01-09 16:52:00,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00" (1/1) ... [2025-01-09 16:52:01,006 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-01-09 16:52:01,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00" (1/1) ... [2025-01-09 16:52:01,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00" (1/1) ... [2025-01-09 16:52:01,011 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00" (1/1) ... [2025-01-09 16:52:01,015 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00" (1/1) ... [2025-01-09 16:52:01,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00" (1/1) ... [2025-01-09 16:52:01,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00" (1/1) ... [2025-01-09 16:52:01,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00" (1/1) ... [2025-01-09 16:52:01,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:52:01,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:52:01,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:52:01,026 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:52:01,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00" (1/1) ... [2025-01-09 16:52:01,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:52:01,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:52:01,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:52:01,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:52:01,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:52:01,085 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-09 16:52:01,085 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-09 16:52:01,086 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-09 16:52:01,086 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-09 16:52:01,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:52:01,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:52:01,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:52:01,087 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:52:01,200 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:52:01,201 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:52:01,325 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:52:01,325 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:52:01,385 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:52:01,385 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:52:01,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:52:01 BoogieIcfgContainer [2025-01-09 16:52:01,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:52:01,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:52:01,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:52:01,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:52:01,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:52:00" (1/3) ... [2025-01-09 16:52:01,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cc1713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:52:01, skipping insertion in model container [2025-01-09 16:52:01,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:52:00" (2/3) ... [2025-01-09 16:52:01,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cc1713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:52:01, skipping insertion in model container [2025-01-09 16:52:01,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:52:01" (3/3) ... [2025-01-09 16:52:01,394 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-nondet.i [2025-01-09 16:52:01,405 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:52:01,407 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-nondet.i that has 3 procedures, 27 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 16:52:01,407 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:52:01,454 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:52:01,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 74 flow [2025-01-09 16:52:01,501 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-01-09 16:52:01,502 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:52:01,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 4/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-01-09 16:52:01,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 30 transitions, 74 flow [2025-01-09 16:52:01,506 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 61 flow [2025-01-09 16:52:01,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:52:01,526 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;@16fa6dcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:52:01,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 16:52:01,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:52:01,538 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-01-09 16:52:01,538 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:52:01,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:52:01,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:01,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:52:01,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:01,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1071692611, now seen corresponding path program 1 times [2025-01-09 16:52:01,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:01,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367807599] [2025-01-09 16:52:01,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:01,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:01,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:52:01,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:52:01,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:01,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:01,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:01,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:01,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367807599] [2025-01-09 16:52:01,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367807599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:52:01,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:52:01,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:52:01,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299874532] [2025-01-09 16:52:01,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:52:01,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:52:01,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:01,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:52:01,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:52:02,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2025-01-09 16:52:02,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 61 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:02,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:52:02,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2025-01-09 16:52:02,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:52:02,419 INFO L124 PetriNetUnfolderBase]: 381/717 cut-off events. [2025-01-09 16:52:02,419 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-09 16:52:02,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 717 events. 381/717 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3564 event pairs, 32 based on Foata normal form. 70/658 useless extension candidates. Maximal degree in co-relation 1304. Up to 185 conditions per place. [2025-01-09 16:52:02,428 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 75 selfloop transitions, 18 changer transitions 4/101 dead transitions. [2025-01-09 16:52:02,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 101 transitions, 429 flow [2025-01-09 16:52:02,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:52:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:52:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 176 transitions. [2025-01-09 16:52:02,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-01-09 16:52:02,443 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 61 flow. Second operand 11 states and 176 transitions. [2025-01-09 16:52:02,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 101 transitions, 429 flow [2025-01-09 16:52:02,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 101 transitions, 413 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:52:02,450 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 167 flow [2025-01-09 16:52:02,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=167, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-01-09 16:52:02,454 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2025-01-09 16:52:02,455 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 167 flow [2025-01-09 16:52:02,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:02,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:52:02,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:02,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:52:02,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:52:02,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:02,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1137298028, now seen corresponding path program 1 times [2025-01-09 16:52:02,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:02,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308098379] [2025-01-09 16:52:02,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:02,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:02,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:52:02,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:52:02,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:02,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:02,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:02,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308098379] [2025-01-09 16:52:02,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308098379] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:52:02,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210561572] [2025-01-09 16:52:02,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:02,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:52:02,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:52:02,614 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:52:02,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:52:02,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:52:02,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:52:02,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:02,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:02,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:52:02,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:52:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:02,721 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:52:02,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210561572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:52:02,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:52:02,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-01-09 16:52:02,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827258666] [2025-01-09 16:52:02,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:52:02,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:52:02,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:02,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:52:02,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:52:02,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-01-09 16:52:02,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:02,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:52:02,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-01-09 16:52:02,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:52:02,932 INFO L124 PetriNetUnfolderBase]: 345/702 cut-off events. [2025-01-09 16:52:02,933 INFO L125 PetriNetUnfolderBase]: For 318/318 co-relation queries the response was YES. [2025-01-09 16:52:02,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1811 conditions, 702 events. 345/702 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3705 event pairs, 68 based on Foata normal form. 22/623 useless extension candidates. Maximal degree in co-relation 1636. Up to 167 conditions per place. [2025-01-09 16:52:02,939 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 72 selfloop transitions, 14 changer transitions 4/97 dead transitions. [2025-01-09 16:52:02,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 97 transitions, 502 flow [2025-01-09 16:52:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:52:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:52:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2025-01-09 16:52:02,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.562962962962963 [2025-01-09 16:52:02,943 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 167 flow. Second operand 9 states and 152 transitions. [2025-01-09 16:52:02,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 97 transitions, 502 flow [2025-01-09 16:52:02,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 97 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:52:02,954 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 239 flow [2025-01-09 16:52:02,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=239, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-01-09 16:52:02,954 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2025-01-09 16:52:02,955 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 239 flow [2025-01-09 16:52:02,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:02,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:52:02,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:02,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:52:03,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:52:03,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:52:03,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -57430213, now seen corresponding path program 1 times [2025-01-09 16:52:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:03,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048145594] [2025-01-09 16:52:03,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:03,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:03,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 16:52:03,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 16:52:03,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:03,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:03,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:03,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048145594] [2025-01-09 16:52:03,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048145594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:52:03,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:52:03,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:52:03,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996826658] [2025-01-09 16:52:03,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:52:03,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:52:03,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:03,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:52:03,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:52:03,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-01-09 16:52:03,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:03,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:52:03,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-01-09 16:52:03,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:52:03,482 INFO L124 PetriNetUnfolderBase]: 396/836 cut-off events. [2025-01-09 16:52:03,482 INFO L125 PetriNetUnfolderBase]: For 946/948 co-relation queries the response was YES. [2025-01-09 16:52:03,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2275 conditions, 836 events. 396/836 cut-off events. For 946/948 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4696 event pairs, 87 based on Foata normal form. 2/753 useless extension candidates. Maximal degree in co-relation 2090. Up to 290 conditions per place. [2025-01-09 16:52:03,486 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 64 selfloop transitions, 15 changer transitions 1/88 dead transitions. [2025-01-09 16:52:03,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 640 flow [2025-01-09 16:52:03,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:52:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:52:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2025-01-09 16:52:03,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-01-09 16:52:03,488 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 239 flow. Second operand 7 states and 112 transitions. [2025-01-09 16:52:03,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 640 flow [2025-01-09 16:52:03,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 88 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:52:03,493 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 314 flow [2025-01-09 16:52:03,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=314, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2025-01-09 16:52:03,494 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2025-01-09 16:52:03,494 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 314 flow [2025-01-09 16:52:03,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:03,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:52:03,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:03,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:52:03,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:52:03,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:03,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1780367194, now seen corresponding path program 1 times [2025-01-09 16:52:03,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:03,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077041539] [2025-01-09 16:52:03,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:03,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:03,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:52:03,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:52:03,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:03,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:03,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:03,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077041539] [2025-01-09 16:52:03,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077041539] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:52:03,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296094067] [2025-01-09 16:52:03,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:03,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:52:03,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:52:03,600 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:52:03,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:52:03,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:52:03,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:52:03,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:03,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:03,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:52:03,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:52:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:03,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:52:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:03,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296094067] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:52:03,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:52:03,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-09 16:52:03,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550827965] [2025-01-09 16:52:03,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:52:03,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:52:03,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:03,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:52:03,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:52:03,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2025-01-09 16:52:03,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 314 flow. Second operand has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:03,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:52:03,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2025-01-09 16:52:03,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:52:04,313 INFO L124 PetriNetUnfolderBase]: 774/1416 cut-off events. [2025-01-09 16:52:04,313 INFO L125 PetriNetUnfolderBase]: For 2064/2080 co-relation queries the response was YES. [2025-01-09 16:52:04,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4643 conditions, 1416 events. 774/1416 cut-off events. For 2064/2080 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7861 event pairs, 99 based on Foata normal form. 2/1281 useless extension candidates. Maximal degree in co-relation 4326. Up to 357 conditions per place. [2025-01-09 16:52:04,321 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 99 selfloop transitions, 22 changer transitions 37/164 dead transitions. [2025-01-09 16:52:04,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 164 transitions, 1300 flow [2025-01-09 16:52:04,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 16:52:04,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 16:52:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 188 transitions. [2025-01-09 16:52:04,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48205128205128206 [2025-01-09 16:52:04,323 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 314 flow. Second operand 13 states and 188 transitions. [2025-01-09 16:52:04,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 164 transitions, 1300 flow [2025-01-09 16:52:04,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 164 transitions, 1279 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-09 16:52:04,336 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 422 flow [2025-01-09 16:52:04,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=422, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2025-01-09 16:52:04,337 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2025-01-09 16:52:04,337 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 422 flow [2025-01-09 16:52:04,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:04,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:52:04,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:04,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:52:04,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:52:04,538 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:52:04,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:04,539 INFO L85 PathProgramCache]: Analyzing trace with hash 102093614, now seen corresponding path program 1 times [2025-01-09 16:52:04,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:04,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85217561] [2025-01-09 16:52:04,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:04,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:04,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:52:04,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:52:04,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:04,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:04,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:04,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85217561] [2025-01-09 16:52:04,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85217561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:52:04,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:52:04,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:52:04,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875934197] [2025-01-09 16:52:04,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:52:04,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:52:04,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:04,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:52:04,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:52:04,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-01-09 16:52:04,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 55 transitions, 422 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:04,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:52:04,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-01-09 16:52:04,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:52:04,782 INFO L124 PetriNetUnfolderBase]: 552/1173 cut-off events. [2025-01-09 16:52:04,782 INFO L125 PetriNetUnfolderBase]: For 2539/2541 co-relation queries the response was YES. [2025-01-09 16:52:04,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4530 conditions, 1173 events. 552/1173 cut-off events. For 2539/2541 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7133 event pairs, 101 based on Foata normal form. 18/1142 useless extension candidates. Maximal degree in co-relation 4357. Up to 558 conditions per place. [2025-01-09 16:52:04,791 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 58 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2025-01-09 16:52:04,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 82 transitions, 750 flow [2025-01-09 16:52:04,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:52:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:52:04,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-01-09 16:52:04,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2025-01-09 16:52:04,792 INFO L175 Difference]: Start difference. First operand has 73 places, 55 transitions, 422 flow. Second operand 6 states and 92 transitions. [2025-01-09 16:52:04,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 82 transitions, 750 flow [2025-01-09 16:52:04,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 82 transitions, 693 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-01-09 16:52:04,809 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 419 flow [2025-01-09 16:52:04,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=419, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2025-01-09 16:52:04,809 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2025-01-09 16:52:04,809 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 419 flow [2025-01-09 16:52:04,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:52:04,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:52:04,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:04,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:52:04,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:52:04,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:04,810 INFO L85 PathProgramCache]: Analyzing trace with hash -480606068, now seen corresponding path program 1 times [2025-01-09 16:52:04,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:04,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146613893] [2025-01-09 16:52:04,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:52:04,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:04,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:52:04,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:52:04,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:04,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:52:04,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:52:04,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:52:04,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:52:04,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:04,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:52:04,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:52:04,841 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:52:04,841 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-01-09 16:52:04,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-01-09 16:52:04,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-01-09 16:52:04,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-01-09 16:52:04,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-01-09 16:52:04,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-01-09 16:52:04,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:52:04,846 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 16:52:04,871 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:52:04,871 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:52:04,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:52:04 BasicIcfg [2025-01-09 16:52:04,875 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:52:04,875 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:52:04,875 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:52:04,876 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:52:04,876 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:52:01" (3/4) ... [2025-01-09 16:52:04,876 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:52:04,914 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 7. [2025-01-09 16:52:04,951 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:52:04,951 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:52:04,952 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:52:04,954 INFO L158 Benchmark]: Toolchain (without parser) took 4393.30ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 105.3MB in the beginning and 159.6MB in the end (delta: -54.3MB). Peak memory consumption was 144.7MB. Max. memory is 16.1GB. [2025-01-09 16:52:04,954 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:52:04,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.14ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 84.4MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:52:04,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.63ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 83.5MB in the end (delta: 975.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:52:04,955 INFO L158 Benchmark]: Boogie Preprocessor took 39.09ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:52:04,955 INFO L158 Benchmark]: RCFGBuilder took 360.48ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 60.9MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:52:04,956 INFO L158 Benchmark]: TraceAbstraction took 3487.55ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 60.3MB in the beginning and 166.0MB in the end (delta: -105.7MB). Peak memory consumption was 102.7MB. Max. memory is 16.1GB. [2025-01-09 16:52:04,956 INFO L158 Benchmark]: Witness Printer took 76.76ms. Allocated memory is still 343.9MB. Free memory was 166.0MB in the beginning and 159.6MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:52:04,957 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.23ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.14ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 84.4MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.63ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 83.5MB in the end (delta: 975.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.09ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 360.48ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 60.9MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3487.55ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 60.3MB in the beginning and 166.0MB in the end (delta: -105.7MB). Peak memory consumption was 102.7MB. Max. memory is 16.1GB. * Witness Printer took 76.76ms. Allocated memory is still 343.9MB. Free memory was 166.0MB in the beginning and 159.6MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = __VERIFIER_nondet_int() [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=0, limit=0, t1=-1] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=0, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=0, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=1, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=1, limit=1] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=0, limit=0] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=0, arg={0:0}, bound=0, i=0, lim=1, limit=0] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression VAL [\old(expression)=0, _N=0, expression=0, limit=0] [L753] 2 reach_error() VAL [\old(expression)=0, _N=0, expression=0, limit=0] - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 locations, 6 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: 3.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 484 mSDsluCounter, 144 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 967 IncrementalHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 24 mSDtfsCounter, 967 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=422occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 320 SizeOfPredicates, 11 NumberOfNonLiveVariables, 134 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 1/5 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-01-09 16:52:04,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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