./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.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-ext/39_rand_lock_p0_vs.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 75a7e23d8671ab9c707059b5300300854f7697b51bd2252b1df4e0c45e5bbfed --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:24:27,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:24:27,269 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:24:27,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:24:27,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:24:27,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:24:27,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:24:27,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:24:27,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:24:27,303 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:24:27,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:24:27,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:24:27,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:24:27,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:24:27,304 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:24:27,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:24:27,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:24:27,305 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:24:27,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:24:27,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:24:27,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:24:27,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:24:27,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:24:27,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:24:27,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:24:27,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:24:27,306 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:24:27,306 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:24:27,306 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:24:27,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:24:27,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:24:27,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:24:27,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:24:27,307 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:24:27,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:24:27,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:24:27,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:24:27,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:24:27,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:24:27,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:24:27,307 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:24:27,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:24:27,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:24:27,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:24:27,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:24:27,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:24:27,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:24:27,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:24:27,308 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 -> 75a7e23d8671ab9c707059b5300300854f7697b51bd2252b1df4e0c45e5bbfed [2025-01-09 16:24:27,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:24:27,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:24:27,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:24:27,577 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:24:27,577 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:24:27,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2025-01-09 16:24:28,722 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7148e7001/19bff53483ae42b89fb171642c1aa490/FLAG0c18c2ebc [2025-01-09 16:24:29,004 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:24:29,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2025-01-09 16:24:29,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7148e7001/19bff53483ae42b89fb171642c1aa490/FLAG0c18c2ebc [2025-01-09 16:24:29,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7148e7001/19bff53483ae42b89fb171642c1aa490 [2025-01-09 16:24:29,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:24:29,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:24:29,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:24:29,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:24:29,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:24:29,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:24:29" (1/1) ... [2025-01-09 16:24:29,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f33b49f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:29, skipping insertion in model container [2025-01-09 16:24:29,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:24:29" (1/1) ... [2025-01-09 16:24:29,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:24:29,504 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-ext/39_rand_lock_p0_vs.i[30737,30750] [2025-01-09 16:24:29,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:24:29,531 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:24:29,566 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-ext/39_rand_lock_p0_vs.i[30737,30750] [2025-01-09 16:24:29,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:24:29,597 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:24:29,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:29 WrapperNode [2025-01-09 16:24:29,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:24:29,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:24:29,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:24:29,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:24:29,605 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:24:29" (1/1) ... [2025-01-09 16:24:29,614 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:24:29" (1/1) ... [2025-01-09 16:24:29,628 INFO L138 Inliner]: procedures = 166, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2025-01-09 16:24:29,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:24:29,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:24:29,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:24:29,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:24:29,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:29" (1/1) ... [2025-01-09 16:24:29,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:29" (1/1) ... [2025-01-09 16:24:29,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:29" (1/1) ... [2025-01-09 16:24:29,644 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-01-09 16:24:29,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:29" (1/1) ... [2025-01-09 16:24:29,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:29" (1/1) ... [2025-01-09 16:24:29,651 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:29" (1/1) ... [2025-01-09 16:24:29,654 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:29" (1/1) ... [2025-01-09 16:24:29,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:29" (1/1) ... [2025-01-09 16:24:29,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:29" (1/1) ... [2025-01-09 16:24:29,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:29" (1/1) ... [2025-01-09 16:24:29,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:24:29,660 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:24:29,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:24:29,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:24:29,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:29" (1/1) ... [2025-01-09 16:24:29,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:24:29,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:24:29,685 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:24:29,693 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:24:29,706 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 16:24:29,707 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 16:24:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:24:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:24:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:24:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:24:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:24:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:24:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:24:29,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:24:29,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:24:29,708 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:24:29,781 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:24:29,783 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:24:29,875 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:24:29,875 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:24:29,943 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:24:29,944 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 16:24:29,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:24:29 BoogieIcfgContainer [2025-01-09 16:24:29,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:24:29,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:24:29,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:24:29,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:24:29,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:24:29" (1/3) ... [2025-01-09 16:24:29,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494ce82c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:24:29, skipping insertion in model container [2025-01-09 16:24:29,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:29" (2/3) ... [2025-01-09 16:24:29,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494ce82c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:24:29, skipping insertion in model container [2025-01-09 16:24:29,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:24:29" (3/3) ... [2025-01-09 16:24:29,952 INFO L128 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs.i [2025-01-09 16:24:29,961 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:24:29,962 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 39_rand_lock_p0_vs.i that has 2 procedures, 17 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 16:24:29,963 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:24:29,999 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:24:30,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 42 flow [2025-01-09 16:24:30,037 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-01-09 16:24:30,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:24:30,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 2/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 18 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2025-01-09 16:24:30,044 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 19 transitions, 42 flow [2025-01-09 16:24:30,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 19 transitions, 42 flow [2025-01-09 16:24:30,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:24:30,065 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;@2912233c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:24:30,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:24:30,069 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:24:30,072 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2025-01-09 16:24:30,072 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:24:30,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:30,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 16:24:30,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:24:30,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:30,078 INFO L85 PathProgramCache]: Analyzing trace with hash 193502022, now seen corresponding path program 1 times [2025-01-09 16:24:30,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:30,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099958121] [2025-01-09 16:24:30,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:30,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:30,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 16:24:30,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 16:24:30,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:30,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:30,236 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:24:30,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:30,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099958121] [2025-01-09 16:24:30,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099958121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:30,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:30,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:24:30,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162271914] [2025-01-09 16:24:30,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:30,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:24:30,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:30,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:24:30,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:24:30,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2025-01-09 16:24:30,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:24:30,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:30,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2025-01-09 16:24:30,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:24:30,307 INFO L124 PetriNetUnfolderBase]: 21/57 cut-off events. [2025-01-09 16:24:30,307 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:24:30,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 57 events. 21/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 12 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 100. Up to 35 conditions per place. [2025-01-09 16:24:30,308 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 13 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2025-01-09 16:24:30,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 18 transitions, 70 flow [2025-01-09 16:24:30,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:24:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:24:30,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2025-01-09 16:24:30,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2025-01-09 16:24:30,319 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 42 flow. Second operand 3 states and 28 transitions. [2025-01-09 16:24:30,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 18 transitions, 70 flow [2025-01-09 16:24:30,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 18 transitions, 70 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:24:30,323 INFO L231 Difference]: Finished difference. Result has 20 places, 16 transitions, 40 flow [2025-01-09 16:24:30,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=20, PETRI_TRANSITIONS=16} [2025-01-09 16:24:30,330 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 0 predicate places. [2025-01-09 16:24:30,330 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 16 transitions, 40 flow [2025-01-09 16:24:30,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:24:30,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:30,330 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-09 16:24:30,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:24:30,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:24:30,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:30,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1703590398, now seen corresponding path program 1 times [2025-01-09 16:24:30,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:30,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059940009] [2025-01-09 16:24:30,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:30,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:30,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:24:30,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:24:30,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:30,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:30,355 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:24:30,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:24:30,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:24:30,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:30,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:30,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:24:30,369 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:24:30,369 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-01-09 16:24:30,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-01-09 16:24:30,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-01-09 16:24:30,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:24:30,375 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 16:24:30,376 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:24:30,376 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 16:24:30,406 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:24:30,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 76 flow [2025-01-09 16:24:30,417 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-01-09 16:24:30,417 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:24:30,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 4/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 65 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2025-01-09 16:24:30,417 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 76 flow [2025-01-09 16:24:30,418 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 33 transitions, 76 flow [2025-01-09 16:24:30,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:24:30,419 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;@2912233c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:24:30,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:24:30,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:24:30,421 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2025-01-09 16:24:30,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:24:30,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:30,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 16:24:30,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:24:30,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:30,422 INFO L85 PathProgramCache]: Analyzing trace with hash 225006996, now seen corresponding path program 1 times [2025-01-09 16:24:30,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:30,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989123125] [2025-01-09 16:24:30,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:30,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:30,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 16:24:30,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 16:24:30,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:30,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:30,460 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:24:30,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:30,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989123125] [2025-01-09 16:24:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989123125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:30,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:30,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:24:30,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857543337] [2025-01-09 16:24:30,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:30,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:24:30,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:30,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:24:30,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:24:30,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:24:30,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:24:30,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:30,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:24:30,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:24:30,597 INFO L124 PetriNetUnfolderBase]: 525/911 cut-off events. [2025-01-09 16:24:30,597 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-01-09 16:24:30,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1789 conditions, 911 events. 525/911 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3646 event pairs, 252 based on Foata normal form. 0/857 useless extension candidates. Maximal degree in co-relation 1262. Up to 451 conditions per place. [2025-01-09 16:24:30,602 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 39 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-01-09 16:24:30,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 193 flow [2025-01-09 16:24:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:24:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:24:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-01-09 16:24:30,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6565656565656566 [2025-01-09 16:24:30,603 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 76 flow. Second operand 3 states and 65 transitions. [2025-01-09 16:24:30,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 193 flow [2025-01-09 16:24:30,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:24:30,605 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 91 flow [2025-01-09 16:24:30,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2025-01-09 16:24:30,605 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2025-01-09 16:24:30,606 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 91 flow [2025-01-09 16:24:30,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:24:30,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:30,606 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-09 16:24:30,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:24:30,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:24:30,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:30,606 INFO L85 PathProgramCache]: Analyzing trace with hash -952912015, now seen corresponding path program 1 times [2025-01-09 16:24:30,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:30,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238985537] [2025-01-09 16:24:30,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:30,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:30,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:24:30,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:24:30,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:30,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:30,616 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:24:30,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:24:30,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:24:30,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:30,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:30,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:24:30,625 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:24:30,625 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-09 16:24:30,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-01-09 16:24:30,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-01-09 16:24:30,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-01-09 16:24:30,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:24:30,625 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 16:24:30,626 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:24:30,626 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 16:24:30,644 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:24:30,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 112 flow [2025-01-09 16:24:30,650 INFO L124 PetriNetUnfolderBase]: 6/55 cut-off events. [2025-01-09 16:24:30,650 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 16:24:30,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 6/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 125 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2025-01-09 16:24:30,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 47 transitions, 112 flow [2025-01-09 16:24:30,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 47 transitions, 112 flow [2025-01-09 16:24:30,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:24:30,651 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;@2912233c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:24:30,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:24:30,652 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:24:30,652 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-09 16:24:30,652 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:24:30,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:30,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 16:24:30,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:24:30,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:30,653 INFO L85 PathProgramCache]: Analyzing trace with hash 269871824, now seen corresponding path program 1 times [2025-01-09 16:24:30,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:30,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694437087] [2025-01-09 16:24:30,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:30,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:30,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 16:24:30,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 16:24:30,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:30,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:30,678 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:24:30,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:30,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694437087] [2025-01-09 16:24:30,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694437087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:30,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:30,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:24:30,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873925235] [2025-01-09 16:24:30,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:30,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:24:30,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:30,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:24:30,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:24:30,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2025-01-09 16:24:30,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:24:30,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:30,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2025-01-09 16:24:30,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:24:31,610 INFO L124 PetriNetUnfolderBase]: 9048/13148 cut-off events. [2025-01-09 16:24:31,610 INFO L125 PetriNetUnfolderBase]: For 716/716 co-relation queries the response was YES. [2025-01-09 16:24:31,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26250 conditions, 13148 events. 9048/13148 cut-off events. For 716/716 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 70162 event pairs, 3549 based on Foata normal form. 0/12344 useless extension candidates. Maximal degree in co-relation 6698. Up to 8869 conditions per place. [2025-01-09 16:24:31,664 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 57 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2025-01-09 16:24:31,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 288 flow [2025-01-09 16:24:31,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:24:31,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:24:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-01-09 16:24:31,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2025-01-09 16:24:31,665 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 112 flow. Second operand 3 states and 93 transitions. [2025-01-09 16:24:31,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 288 flow [2025-01-09 16:24:31,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 284 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-01-09 16:24:31,667 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 132 flow [2025-01-09 16:24:31,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2025-01-09 16:24:31,668 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2025-01-09 16:24:31,668 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 132 flow [2025-01-09 16:24:31,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:24:31,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:31,668 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-01-09 16:24:31,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:24:31,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:24:31,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:31,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1609105341, now seen corresponding path program 1 times [2025-01-09 16:24:31,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:31,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848003983] [2025-01-09 16:24:31,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:31,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:31,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:24:31,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:24:31,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:31,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:31,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:24:31,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:24:31,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:24:31,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:31,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:31,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:24:31,687 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:24:31,687 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-09 16:24:31,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-01-09 16:24:31,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-01-09 16:24:31,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-01-09 16:24:31,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-01-09 16:24:31,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:24:31,687 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 16:24:31,687 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:24:31,687 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 16:24:31,714 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:24:31,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 61 transitions, 150 flow [2025-01-09 16:24:31,719 INFO L124 PetriNetUnfolderBase]: 8/72 cut-off events. [2025-01-09 16:24:31,719 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 16:24:31,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 8/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 180 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2025-01-09 16:24:31,720 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 61 transitions, 150 flow [2025-01-09 16:24:31,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 61 transitions, 150 flow [2025-01-09 16:24:31,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:24:31,721 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;@2912233c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:24:31,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 16:24:31,722 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:24:31,722 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-09 16:24:31,722 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:24:31,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:31,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 16:24:31,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:24:31,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash 328097338, now seen corresponding path program 1 times [2025-01-09 16:24:31,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:31,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376901653] [2025-01-09 16:24:31,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:31,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:31,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 16:24:31,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 16:24:31,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:31,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:31,744 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:24:31,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:31,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376901653] [2025-01-09 16:24:31,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376901653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:31,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:31,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:24:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756368259] [2025-01-09 16:24:31,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:31,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:24:31,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:31,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:24:31,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:24:31,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 61 [2025-01-09 16:24:31,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:24:31,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:31,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 61 [2025-01-09 16:24:31,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:24:39,582 INFO L124 PetriNetUnfolderBase]: 138114/182648 cut-off events. [2025-01-09 16:24:39,583 INFO L125 PetriNetUnfolderBase]: For 13073/13073 co-relation queries the response was YES. [2025-01-09 16:24:39,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367995 conditions, 182648 events. 138114/182648 cut-off events. For 13073/13073 co-relation queries the response was YES. Maximal size of possible extension queue 3636. Compared 1116280 event pairs, 45867 based on Foata normal form. 0/170309 useless extension candidates. Maximal degree in co-relation 33284. Up to 145462 conditions per place. [2025-01-09 16:24:40,386 INFO L140 encePairwiseOnDemand]: 47/61 looper letters, 75 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2025-01-09 16:24:40,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 89 transitions, 387 flow [2025-01-09 16:24:40,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:24:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:24:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2025-01-09 16:24:40,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6612021857923497 [2025-01-09 16:24:40,388 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 150 flow. Second operand 3 states and 121 transitions. [2025-01-09 16:24:40,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 89 transitions, 387 flow [2025-01-09 16:24:40,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 375 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-01-09 16:24:40,396 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 173 flow [2025-01-09 16:24:40,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2025-01-09 16:24:40,398 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2025-01-09 16:24:40,399 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 173 flow [2025-01-09 16:24:40,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:24:40,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:40,399 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 16:24:40,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:24:40,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:24:40,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash 277227222, now seen corresponding path program 1 times [2025-01-09 16:24:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:40,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713617638] [2025-01-09 16:24:40,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:40,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:40,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:24:40,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:24:40,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:40,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:40,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:24:40,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:24:40,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:24:40,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:40,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:40,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:24:40,430 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:24:40,430 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-09 16:24:40,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-01-09 16:24:40,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-01-09 16:24:40,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-01-09 16:24:40,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-01-09 16:24:40,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-01-09 16:24:40,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:24:40,431 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 16:24:40,431 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:24:40,431 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-09 16:24:40,471 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:24:40,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 190 flow [2025-01-09 16:24:40,483 INFO L124 PetriNetUnfolderBase]: 10/89 cut-off events. [2025-01-09 16:24:40,483 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-09 16:24:40,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 89 events. 10/89 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 229 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 90. Up to 6 conditions per place. [2025-01-09 16:24:40,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 75 transitions, 190 flow [2025-01-09 16:24:40,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 75 transitions, 190 flow [2025-01-09 16:24:40,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:24:40,485 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;@2912233c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:24:40,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 16:24:40,486 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:24:40,486 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-09 16:24:40,486 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:24:40,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:40,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 16:24:40,486 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:24:40,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:40,486 INFO L85 PathProgramCache]: Analyzing trace with hash 399682290, now seen corresponding path program 1 times [2025-01-09 16:24:40,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:40,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644474406] [2025-01-09 16:24:40,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:40,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:40,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 16:24:40,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 16:24:40,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:40,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:40,516 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:24:40,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:40,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644474406] [2025-01-09 16:24:40,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644474406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:40,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:40,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:24:40,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453035212] [2025-01-09 16:24:40,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:40,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:24:40,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:40,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:24:40,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:24:40,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 75 [2025-01-09 16:24:40,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:24:40,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:40,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 75 [2025-01-09 16:24:40,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand