./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/szymanski.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-atomic/szymanski.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 a3cd4be37ada319d324d40d8d6c18fff519996a186a93f33b3070275487295e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:15:46,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:15:46,916 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:15:46,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:15:46,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:15:46,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:15:46,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:15:46,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:15:46,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:15:46,942 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:15:46,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:15:46,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:15:46,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:15:46,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:15:46,943 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:15:46,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:15:46,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:15:46,943 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:15:46,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:15:46,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:15:46,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:15:46,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:15:46,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:15:46,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:15:46,945 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:15:46,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:15:46,945 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:15:46,945 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:15:46,945 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:15:46,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:15:46,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:15:46,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:15:46,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:15:46,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:15:46,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:15:46,946 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:15:46,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:15:46,946 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:15:46,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:15:46,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:15:46,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:15:46,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:15:46,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:15:46,946 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 -> a3cd4be37ada319d324d40d8d6c18fff519996a186a93f33b3070275487295e3 [2025-02-06 04:15:47,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:15:47,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:15:47,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:15:47,239 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:15:47,240 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:15:47,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/szymanski.i [2025-02-06 04:15:48,494 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4de71091/b0556fc7915d4d8cbc2a76bcfe21a1c2/FLAGcb5555934 [2025-02-06 04:15:48,863 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:15:48,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/szymanski.i [2025-02-06 04:15:48,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4de71091/b0556fc7915d4d8cbc2a76bcfe21a1c2/FLAGcb5555934 [2025-02-06 04:15:49,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4de71091/b0556fc7915d4d8cbc2a76bcfe21a1c2 [2025-02-06 04:15:49,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:15:49,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:15:49,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:15:49,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:15:49,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:15:49,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:15:49" (1/1) ... [2025-02-06 04:15:49,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49e5d955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:49, skipping insertion in model container [2025-02-06 04:15:49,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:15:49" (1/1) ... [2025-02-06 04:15:49,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:15:49,436 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-atomic/szymanski.i[32419,32432] [2025-02-06 04:15:49,446 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-atomic/szymanski.i[32696,32709] [2025-02-06 04:15:49,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:15:49,460 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:15:49,492 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-atomic/szymanski.i[32419,32432] [2025-02-06 04:15:49,494 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-atomic/szymanski.i[32696,32709] [2025-02-06 04:15:49,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:15:49,528 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:15:49,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:49 WrapperNode [2025-02-06 04:15:49,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:15:49,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:15:49,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:15:49,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:15:49,538 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:15:49" (1/1) ... [2025-02-06 04:15:49,551 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:15:49" (1/1) ... [2025-02-06 04:15:49,567 INFO L138 Inliner]: procedures = 166, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2025-02-06 04:15:49,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:15:49,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:15:49,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:15:49,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:15:49,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:49" (1/1) ... [2025-02-06 04:15:49,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:49" (1/1) ... [2025-02-06 04:15:49,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:49" (1/1) ... [2025-02-06 04:15:49,596 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:15:49,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:49" (1/1) ... [2025-02-06 04:15:49,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:49" (1/1) ... [2025-02-06 04:15:49,599 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:49" (1/1) ... [2025-02-06 04:15:49,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:49" (1/1) ... [2025-02-06 04:15:49,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:49" (1/1) ... [2025-02-06 04:15:49,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:49" (1/1) ... [2025-02-06 04:15:49,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:15:49,610 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:15:49,610 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:15:49,610 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:15:49,613 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:49" (1/1) ... [2025-02-06 04:15:49,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:15:49,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:49,642 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:15:49,644 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:15:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-02-06 04:15:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-02-06 04:15:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 04:15:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 04:15:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:15:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:15:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:15:49,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:15:49,662 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:15:49,761 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:15:49,763 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:15:49,884 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:15:49,884 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:15:49,957 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:15:49,957 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:15:49,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:15:49 BoogieIcfgContainer [2025-02-06 04:15:49,957 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:15:49,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:15:49,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:15:49,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:15:49,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:15:49" (1/3) ... [2025-02-06 04:15:49,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c33bdb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:15:49, skipping insertion in model container [2025-02-06 04:15:49,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:49" (2/3) ... [2025-02-06 04:15:49,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c33bdb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:15:49, skipping insertion in model container [2025-02-06 04:15:49,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:15:49" (3/3) ... [2025-02-06 04:15:49,965 INFO L128 eAbstractionObserver]: Analyzing ICFG szymanski.i [2025-02-06 04:15:49,977 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:15:49,978 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG szymanski.i that has 3 procedures, 41 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-02-06 04:15:49,979 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:15:50,025 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:15:50,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 52 transitions, 118 flow [2025-02-06 04:15:50,090 INFO L124 PetriNetUnfolderBase]: 12/50 cut-off events. [2025-02-06 04:15:50,092 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:15:50,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 50 events. 12/50 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 47. Up to 3 conditions per place. [2025-02-06 04:15:50,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 52 transitions, 118 flow [2025-02-06 04:15:50,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 48 transitions, 105 flow [2025-02-06 04:15:50,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:15:50,128 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;@422e85f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:15:50,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 04:15:50,137 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:15:50,138 INFO L124 PetriNetUnfolderBase]: 10/35 cut-off events. [2025-02-06 04:15:50,138 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:15:50,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:50,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:50,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:15:50,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:50,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1016583843, now seen corresponding path program 1 times [2025-02-06 04:15:50,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:50,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509857577] [2025-02-06 04:15:50,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:50,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:50,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 04:15:50,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:15:50,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:50,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:50,370 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:15:50,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:50,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509857577] [2025-02-06 04:15:50,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509857577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:50,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:50,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:15:50,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89585040] [2025-02-06 04:15:50,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:50,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:15:50,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:50,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:15:50,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:15:50,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 52 [2025-02-06 04:15:50,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 48 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:15:50,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:50,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 52 [2025-02-06 04:15:50,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:50,597 INFO L124 PetriNetUnfolderBase]: 294/623 cut-off events. [2025-02-06 04:15:50,597 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-06 04:15:50,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 623 events. 294/623 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3210 event pairs, 131 based on Foata normal form. 61/609 useless extension candidates. Maximal degree in co-relation 1024. Up to 269 conditions per place. [2025-02-06 04:15:50,611 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 29 selfloop transitions, 3 changer transitions 1/57 dead transitions. [2025-02-06 04:15:50,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 192 flow [2025-02-06 04:15:50,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:15:50,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:15:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-02-06 04:15:50,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2025-02-06 04:15:50,633 INFO L175 Difference]: Start difference. First operand has 43 places, 48 transitions, 105 flow. Second operand 3 states and 116 transitions. [2025-02-06 04:15:50,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 192 flow [2025-02-06 04:15:50,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 185 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:15:50,646 INFO L231 Difference]: Finished difference. Result has 44 places, 47 transitions, 116 flow [2025-02-06 04:15:50,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=47} [2025-02-06 04:15:50,655 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-02-06 04:15:50,657 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 47 transitions, 116 flow [2025-02-06 04:15:50,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:15:50,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:50,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:50,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:15:50,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:15:50,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1324708225, now seen corresponding path program 1 times [2025-02-06 04:15:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:50,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059874311] [2025-02-06 04:15:50,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:50,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 04:15:50,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 04:15:50,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:50,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:50,752 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:15:50,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:50,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059874311] [2025-02-06 04:15:50,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059874311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:50,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:50,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:15:50,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826342431] [2025-02-06 04:15:50,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:50,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:15:50,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:50,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:15:50,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:15:50,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 52 [2025-02-06 04:15:50,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 47 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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:15:50,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:50,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 52 [2025-02-06 04:15:50,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:50,923 INFO L124 PetriNetUnfolderBase]: 304/619 cut-off events. [2025-02-06 04:15:50,923 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-02-06 04:15:50,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 619 events. 304/619 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3061 event pairs, 157 based on Foata normal form. 25/567 useless extension candidates. Maximal degree in co-relation 696. Up to 333 conditions per place. [2025-02-06 04:15:50,928 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 28 selfloop transitions, 2 changer transitions 3/57 dead transitions. [2025-02-06 04:15:50,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 203 flow [2025-02-06 04:15:50,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:15:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:15:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-02-06 04:15:50,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7243589743589743 [2025-02-06 04:15:50,931 INFO L175 Difference]: Start difference. First operand has 44 places, 47 transitions, 116 flow. Second operand 3 states and 113 transitions. [2025-02-06 04:15:50,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 203 flow [2025-02-06 04:15:50,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:15:50,936 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 120 flow [2025-02-06 04:15:50,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2025-02-06 04:15:50,937 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2025-02-06 04:15:50,937 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 47 transitions, 120 flow [2025-02-06 04:15:50,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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:15:50,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:50,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:50,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:15:50,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:15:50,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:50,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1855527921, now seen corresponding path program 1 times [2025-02-06 04:15:50,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:50,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39845159] [2025-02-06 04:15:50,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:50,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:50,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:15:50,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:15:50,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:50,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:51,026 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:15:51,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:51,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39845159] [2025-02-06 04:15:51,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39845159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:51,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:51,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:15:51,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85643429] [2025-02-06 04:15:51,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:51,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:15:51,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:51,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:15:51,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:15:51,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 52 [2025-02-06 04:15:51,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:15:51,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:51,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 52 [2025-02-06 04:15:51,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:51,177 INFO L124 PetriNetUnfolderBase]: 385/724 cut-off events. [2025-02-06 04:15:51,177 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2025-02-06 04:15:51,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 724 events. 385/724 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3287 event pairs, 186 based on Foata normal form. 31/719 useless extension candidates. Maximal degree in co-relation 898. Up to 384 conditions per place. [2025-02-06 04:15:51,182 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 32 selfloop transitions, 6 changer transitions 3/61 dead transitions. [2025-02-06 04:15:51,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 231 flow [2025-02-06 04:15:51,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:15:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:15:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-02-06 04:15:51,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2025-02-06 04:15:51,183 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 120 flow. Second operand 3 states and 116 transitions. [2025-02-06 04:15:51,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 231 flow [2025-02-06 04:15:51,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:15:51,186 INFO L231 Difference]: Finished difference. Result has 46 places, 50 transitions, 164 flow [2025-02-06 04:15:51,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=46, PETRI_TRANSITIONS=50} [2025-02-06 04:15:51,187 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2025-02-06 04:15:51,187 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 50 transitions, 164 flow [2025-02-06 04:15:51,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:15:51,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:51,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:51,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:15:51,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:15:51,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:51,190 INFO L85 PathProgramCache]: Analyzing trace with hash 805376437, now seen corresponding path program 1 times [2025-02-06 04:15:51,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:51,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449144218] [2025-02-06 04:15:51,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:51,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:51,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:15:51,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:15:51,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:51,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:51,257 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:15:51,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:51,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449144218] [2025-02-06 04:15:51,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449144218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:51,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:51,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:15:51,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389774020] [2025-02-06 04:15:51,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:51,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:15:51,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:51,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:15:51,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:15:51,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 52 [2025-02-06 04:15:51,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 50 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:15:51,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:51,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 52 [2025-02-06 04:15:51,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:51,387 INFO L124 PetriNetUnfolderBase]: 431/824 cut-off events. [2025-02-06 04:15:51,387 INFO L125 PetriNetUnfolderBase]: For 396/400 co-relation queries the response was YES. [2025-02-06 04:15:51,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 824 events. 431/824 cut-off events. For 396/400 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3808 event pairs, 154 based on Foata normal form. 17/783 useless extension candidates. Maximal degree in co-relation 1023. Up to 308 conditions per place. [2025-02-06 04:15:51,392 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 35 selfloop transitions, 9 changer transitions 2/66 dead transitions. [2025-02-06 04:15:51,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 303 flow [2025-02-06 04:15:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:15:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:15:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-02-06 04:15:51,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7371794871794872 [2025-02-06 04:15:51,397 INFO L175 Difference]: Start difference. First operand has 46 places, 50 transitions, 164 flow. Second operand 3 states and 115 transitions. [2025-02-06 04:15:51,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 303 flow [2025-02-06 04:15:51,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:15:51,405 INFO L231 Difference]: Finished difference. Result has 48 places, 55 transitions, 222 flow [2025-02-06 04:15:51,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=48, PETRI_TRANSITIONS=55} [2025-02-06 04:15:51,406 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2025-02-06 04:15:51,407 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 55 transitions, 222 flow [2025-02-06 04:15:51,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:15:51,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:51,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:51,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:15:51,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:15:51,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:51,409 INFO L85 PathProgramCache]: Analyzing trace with hash 437997139, now seen corresponding path program 2 times [2025-02-06 04:15:51,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:51,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390614258] [2025-02-06 04:15:51,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:15:51,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:51,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:15:51,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:15:51,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:15:51,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:51,449 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:15:51,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:51,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390614258] [2025-02-06 04:15:51,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390614258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:51,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:51,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:15:51,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768876340] [2025-02-06 04:15:51,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:51,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:15:51,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:51,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:15:51,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:15:51,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 52 [2025-02-06 04:15:51,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 55 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:15:51,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:51,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 52 [2025-02-06 04:15:51,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:51,598 INFO L124 PetriNetUnfolderBase]: 448/829 cut-off events. [2025-02-06 04:15:51,598 INFO L125 PetriNetUnfolderBase]: For 966/969 co-relation queries the response was YES. [2025-02-06 04:15:51,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 829 events. 448/829 cut-off events. For 966/969 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3761 event pairs, 213 based on Foata normal form. 19/773 useless extension candidates. Maximal degree in co-relation 1353. Up to 560 conditions per place. [2025-02-06 04:15:51,603 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 41 selfloop transitions, 5 changer transitions 3/67 dead transitions. [2025-02-06 04:15:51,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 357 flow [2025-02-06 04:15:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:15:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:15:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-02-06 04:15:51,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2025-02-06 04:15:51,607 INFO L175 Difference]: Start difference. First operand has 48 places, 55 transitions, 222 flow. Second operand 3 states and 112 transitions. [2025-02-06 04:15:51,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 357 flow [2025-02-06 04:15:51,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:15:51,615 INFO L231 Difference]: Finished difference. Result has 50 places, 54 transitions, 238 flow [2025-02-06 04:15:51,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=50, PETRI_TRANSITIONS=54} [2025-02-06 04:15:51,617 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2025-02-06 04:15:51,617 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 54 transitions, 238 flow [2025-02-06 04:15:51,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:15:51,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:51,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:51,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:15:51,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:15:51,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:51,619 INFO L85 PathProgramCache]: Analyzing trace with hash 836454449, now seen corresponding path program 3 times [2025-02-06 04:15:51,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:51,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424514784] [2025-02-06 04:15:51,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:15:51,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:51,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:15:51,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:15:51,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:15:51,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:51,672 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:15:51,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:51,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424514784] [2025-02-06 04:15:51,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424514784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:51,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:51,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:15:51,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439401486] [2025-02-06 04:15:51,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:51,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:15:51,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:51,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:15:51,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:15:51,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 52 [2025-02-06 04:15:51,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 54 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:15:51,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:51,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 52 [2025-02-06 04:15:51,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:51,814 INFO L124 PetriNetUnfolderBase]: 492/925 cut-off events. [2025-02-06 04:15:51,814 INFO L125 PetriNetUnfolderBase]: For 978/1006 co-relation queries the response was YES. [2025-02-06 04:15:51,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2409 conditions, 925 events. 492/925 cut-off events. For 978/1006 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4416 event pairs, 204 based on Foata normal form. 40/937 useless extension candidates. Maximal degree in co-relation 1604. Up to 476 conditions per place. [2025-02-06 04:15:51,818 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 0 selfloop transitions, 0 changer transitions 71/71 dead transitions. [2025-02-06 04:15:51,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 417 flow [2025-02-06 04:15:51,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:15:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:15:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-02-06 04:15:51,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2025-02-06 04:15:51,819 INFO L175 Difference]: Start difference. First operand has 50 places, 54 transitions, 238 flow. Second operand 3 states and 116 transitions. [2025-02-06 04:15:51,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 417 flow [2025-02-06 04:15:51,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 397 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 04:15:51,825 INFO L231 Difference]: Finished difference. Result has 48 places, 0 transitions, 0 flow [2025-02-06 04:15:51,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=48, PETRI_TRANSITIONS=0} [2025-02-06 04:15:51,826 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2025-02-06 04:15:51,826 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 0 transitions, 0 flow [2025-02-06 04:15:51,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:15:51,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-02-06 04:15:51,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-06 04:15:51,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-02-06 04:15:51,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 04:15:51,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-02-06 04:15:51,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-06 04:15:51,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:15:51,830 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-02-06 04:15:51,834 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:15:51,835 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:15:51,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:15:51 BasicIcfg [2025-02-06 04:15:51,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:15:51,841 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:15:51,842 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:15:51,842 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:15:51,842 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:15:49" (3/4) ... [2025-02-06 04:15:51,844 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 04:15:51,846 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thr2 [2025-02-06 04:15:51,847 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thr1 [2025-02-06 04:15:51,850 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-02-06 04:15:51,850 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-06 04:15:51,850 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 04:15:51,850 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 04:15:51,913 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:15:51,914 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:15:51,914 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:15:51,916 INFO L158 Benchmark]: Toolchain (without parser) took 2819.01ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 73.6MB in the end (delta: 47.8MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2025-02-06 04:15:51,916 INFO L158 Benchmark]: CDTParser took 1.38ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:15:51,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.00ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 101.5MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:15:51,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.28ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 100.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:15:51,918 INFO L158 Benchmark]: Boogie Preprocessor took 40.51ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 98.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:15:51,918 INFO L158 Benchmark]: IcfgBuilder took 347.33ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 81.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:15:51,918 INFO L158 Benchmark]: TraceAbstraction took 1881.01ms. Allocated memory is still 167.8MB. Free memory was 81.4MB in the beginning and 78.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:15:51,919 INFO L158 Benchmark]: Witness Printer took 72.31ms. Allocated memory is still 167.8MB. Free memory was 78.9MB in the beginning and 73.6MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:15:51,922 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.00ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 101.5MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.28ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 100.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.51ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 98.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 347.33ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 81.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1881.01ms. Allocated memory is still 167.8MB. Free memory was 81.4MB in the beginning and 78.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 72.31ms. Allocated memory is still 167.8MB. Free memory was 78.9MB in the beginning and 73.6MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 760]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 744]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 75 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: 1.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 42 mSDtfsCounter, 364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 04:15:51,939 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 Result: TRUE