./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:13:48,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:13:48,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:13:48,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:13:48,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:13:48,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:13:48,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:13:48,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:13:48,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:13:48,964 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:13:48,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:13:48,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:13:48,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:13:48,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:13:48,965 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:13:48,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:13:48,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:13:48,966 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:13:48,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:13:48,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:13:48,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:13:48,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:13:48,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:13:48,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:13:48,967 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:13:48,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:13:48,967 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:13:48,967 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:13:48,967 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:13:48,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:13:48,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:13:48,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:13:48,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:13:48,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:13:48,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:13:48,968 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:13:48,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:13:48,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:13:48,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:13:48,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:13:48,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:13:48,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:13:48,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:13:48,968 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/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 -> 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb [2025-03-08 17:13:49,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:13:49,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:13:49,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:13:49,225 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:13:49,226 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:13:49,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-03-08 17:13:50,411 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18ab25dc3/64b0e4b50e594302b49975e29477d873/FLAG61506c81d [2025-03-08 17:13:50,690 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:13:50,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-03-08 17:13:50,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18ab25dc3/64b0e4b50e594302b49975e29477d873/FLAG61506c81d [2025-03-08 17:13:50,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18ab25dc3/64b0e4b50e594302b49975e29477d873 [2025-03-08 17:13:50,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:13:50,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:13:50,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:13:50,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:13:50,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:13:50,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:13:50" (1/1) ... [2025-03-08 17:13:50,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0e4973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:13:50, skipping insertion in model container [2025-03-08 17:13:50,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:13:50" (1/1) ... [2025-03-08 17:13:51,010 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:13:51,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i[30843,30856] [2025-03-08 17:13:51,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:13:51,217 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:13:51,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i[30843,30856] [2025-03-08 17:13:51,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:13:51,269 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:13:51,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:13:51 WrapperNode [2025-03-08 17:13:51,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:13:51,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:13:51,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:13:51,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:13:51,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:13:51" (1/1) ... [2025-03-08 17:13:51,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:13:51" (1/1) ... [2025-03-08 17:13:51,296 INFO L138 Inliner]: procedures = 164, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2025-03-08 17:13:51,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:13:51,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:13:51,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:13:51,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:13:51,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:13:51" (1/1) ... [2025-03-08 17:13:51,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:13:51" (1/1) ... [2025-03-08 17:13:51,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:13:51" (1/1) ... [2025-03-08 17:13:51,311 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-03-08 17:13:51,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:13:51" (1/1) ... [2025-03-08 17:13:51,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:13:51" (1/1) ... [2025-03-08 17:13:51,316 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:13:51" (1/1) ... [2025-03-08 17:13:51,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:13:51" (1/1) ... [2025-03-08 17:13:51,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:13:51" (1/1) ... [2025-03-08 17:13:51,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:13:51" (1/1) ... [2025-03-08 17:13:51,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:13:51,327 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:13:51,327 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:13:51,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:13:51,328 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:13:51" (1/1) ... [2025-03-08 17:13:51,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:13:51,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:13:51,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:13:51,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:13:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:13:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:13:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 17:13:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-08 17:13:51,369 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-08 17:13:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 17:13:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:13:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:13:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:13:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 17:13:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 17:13:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:13:51,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:13:51,371 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:13:51,458 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:13:51,460 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:13:51,616 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:13:51,616 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:13:51,740 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:13:51,741 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:13:51,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:13:51 BoogieIcfgContainer [2025-03-08 17:13:51,741 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:13:51,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:13:51,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:13:51,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:13:51,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:13:50" (1/3) ... [2025-03-08 17:13:51,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46907f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:13:51, skipping insertion in model container [2025-03-08 17:13:51,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:13:51" (2/3) ... [2025-03-08 17:13:51,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46907f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:13:51, skipping insertion in model container [2025-03-08 17:13:51,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:13:51" (3/3) ... [2025-03-08 17:13:51,752 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-zero.i [2025-03-08 17:13:51,763 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:13:51,764 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-zero.i that has 2 procedures, 17 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 17:13:51,764 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:13:51,797 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:13:51,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 20 transitions, 44 flow [2025-03-08 17:13:51,844 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-03-08 17:13:51,846 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:13:51,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-03-08 17:13:51,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 20 transitions, 44 flow [2025-03-08 17:13:51,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 20 transitions, 44 flow [2025-03-08 17:13:51,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:13:51,863 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;@3b6990d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:13:51,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-08 17:13:51,867 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:13:51,867 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-03-08 17:13:51,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:13:51,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:13:51,868 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-08 17:13:51,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:13:51,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:13:51,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1369331846, now seen corresponding path program 1 times [2025-03-08 17:13:51,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:13:51,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157658958] [2025-03-08 17:13:51,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:13:51,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:13:51,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 17:13:51,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 17:13:51,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:13:51,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:13:51,957 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:13:51,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 17:13:51,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 17:13:51,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:13:51,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:13:51,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:13:51,994 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:13:51,995 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-08 17:13:51,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-08 17:13:51,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-08 17:13:51,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:13:51,998 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-08 17:13:52,001 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:13:52,003 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 17:13:52,028 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:13:52,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 35 transitions, 80 flow [2025-03-08 17:13:52,044 INFO L124 PetriNetUnfolderBase]: 6/40 cut-off events. [2025-03-08 17:13:52,045 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:13:52,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 40 events. 6/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 89 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 31. Up to 3 conditions per place. [2025-03-08 17:13:52,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 35 transitions, 80 flow [2025-03-08 17:13:52,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 35 transitions, 80 flow [2025-03-08 17:13:52,047 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:13:52,047 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;@3b6990d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:13:52,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:13:52,052 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:13:52,052 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2025-03-08 17:13:52,053 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:13:52,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:13:52,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:13:52,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 17:13:52,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:13:52,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1546554887, now seen corresponding path program 1 times [2025-03-08 17:13:52,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:13:52,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791742252] [2025-03-08 17:13:52,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:13:52,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:13:52,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 17:13:52,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 17:13:52,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:13:52,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:13:52,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:13:52,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:13:52,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791742252] [2025-03-08 17:13:52,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791742252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:13:52,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:13:52,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:13:52,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136965051] [2025-03-08 17:13:52,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:13:52,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:13:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:13:52,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:13:52,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:13:52,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2025-03-08 17:13:52,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-03-08 17:13:52,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:13:52,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2025-03-08 17:13:52,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:13:52,533 INFO L124 PetriNetUnfolderBase]: 455/986 cut-off events. [2025-03-08 17:13:52,533 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-08 17:13:52,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 986 events. 455/986 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5731 event pairs, 187 based on Foata normal form. 81/1000 useless extension candidates. Maximal degree in co-relation 880. Up to 376 conditions per place. [2025-03-08 17:13:52,545 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 32 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-03-08 17:13:52,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 175 flow [2025-03-08 17:13:52,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:13:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:13:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-08 17:13:52,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-03-08 17:13:52,557 INFO L175 Difference]: Start difference. First operand has 34 places, 35 transitions, 80 flow. Second operand 3 states and 77 transitions. [2025-03-08 17:13:52,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 175 flow [2025-03-08 17:13:52,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 175 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:13:52,564 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 88 flow [2025-03-08 17:13:52,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-03-08 17:13:52,568 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-03-08 17:13:52,568 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 88 flow [2025-03-08 17:13:52,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-03-08 17:13:52,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:13:52,569 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-08 17:13:52,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:13:52,569 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-03-08 17:13:52,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:13:52,570 INFO L85 PathProgramCache]: Analyzing trace with hash -522826560, now seen corresponding path program 1 times [2025-03-08 17:13:52,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:13:52,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000783449] [2025-03-08 17:13:52,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:13:52,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:13:52,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 17:13:52,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 17:13:52,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:13:52,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:13:52,592 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:13:52,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 17:13:52,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 17:13:52,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:13:52,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:13:52,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:13:52,616 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:13:52,616 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-08 17:13:52,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-08 17:13:52,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-08 17:13:52,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-08 17:13:52,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:13:52,617 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 17:13:52,618 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:13:52,618 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 17:13:52,655 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:13:52,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 50 transitions, 118 flow [2025-03-08 17:13:52,664 INFO L124 PetriNetUnfolderBase]: 9/58 cut-off events. [2025-03-08 17:13:52,664 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 17:13:52,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 58 events. 9/58 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 143 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2025-03-08 17:13:52,664 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 50 transitions, 118 flow [2025-03-08 17:13:52,665 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 50 transitions, 118 flow [2025-03-08 17:13:52,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:13:52,666 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;@3b6990d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:13:52,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-08 17:13:52,669 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:13:52,670 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2025-03-08 17:13:52,670 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:13:52,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:13:52,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:13:52,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:13:52,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:13:52,672 INFO L85 PathProgramCache]: Analyzing trace with hash 169200775, now seen corresponding path program 1 times [2025-03-08 17:13:52,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:13:52,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504087639] [2025-03-08 17:13:52,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:13:52,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:13:52,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 17:13:52,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 17:13:52,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:13:52,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:13:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:13:52,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:13:52,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504087639] [2025-03-08 17:13:52,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504087639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:13:52,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:13:52,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:13:52,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418532276] [2025-03-08 17:13:52,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:13:52,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:13:52,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:13:52,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:13:52,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:13:52,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-03-08 17:13:52,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03-08 17:13:52,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:13:52,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-03-08 17:13:52,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:13:53,449 INFO L124 PetriNetUnfolderBase]: 5081/8851 cut-off events. [2025-03-08 17:13:53,450 INFO L125 PetriNetUnfolderBase]: For 556/556 co-relation queries the response was YES. [2025-03-08 17:13:53,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16061 conditions, 8851 events. 5081/8851 cut-off events. For 556/556 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 64593 event pairs, 2182 based on Foata normal form. 1060/9415 useless extension candidates. Maximal degree in co-relation 4306. Up to 3652 conditions per place. [2025-03-08 17:13:53,498 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 48 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-03-08 17:13:53,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 266 flow [2025-03-08 17:13:53,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:13:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:13:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-03-08 17:13:53,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7533333333333333 [2025-03-08 17:13:53,499 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 118 flow. Second operand 3 states and 113 transitions. [2025-03-08 17:13:53,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 266 flow [2025-03-08 17:13:53,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 262 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-08 17:13:53,504 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 122 flow [2025-03-08 17:13:53,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-03-08 17:13:53,505 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2025-03-08 17:13:53,505 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 122 flow [2025-03-08 17:13:53,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03-08 17:13:53,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:13:53,505 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:13:53,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:13:53,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:13:53,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:13:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1947383955, now seen corresponding path program 1 times [2025-03-08 17:13:53,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:13:53,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468649754] [2025-03-08 17:13:53,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:13:53,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:13:53,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 17:13:53,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 17:13:53,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:13:53,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:13:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:13:53,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:13:53,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468649754] [2025-03-08 17:13:53,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468649754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:13:53,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:13:53,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:13:53,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814170605] [2025-03-08 17:13:53,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:13:53,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:13:53,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:13:53,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:13:53,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:13:53,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-03-08 17:13:53,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03-08 17:13:53,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:13:53,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-03-08 17:13:53,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:13:54,526 INFO L124 PetriNetUnfolderBase]: 8199/14165 cut-off events. [2025-03-08 17:13:54,527 INFO L125 PetriNetUnfolderBase]: For 2609/2609 co-relation queries the response was YES. [2025-03-08 17:13:54,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27178 conditions, 14165 events. 8199/14165 cut-off events. For 2609/2609 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 109504 event pairs, 3517 based on Foata normal form. 0/13375 useless extension candidates. Maximal degree in co-relation 13385. Up to 5893 conditions per place. [2025-03-08 17:13:54,600 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 51 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-03-08 17:13:54,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 291 flow [2025-03-08 17:13:54,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:13:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:13:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-03-08 17:13:54,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6933333333333334 [2025-03-08 17:13:54,601 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 122 flow. Second operand 3 states and 104 transitions. [2025-03-08 17:13:54,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 291 flow [2025-03-08 17:13:54,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:13:54,608 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 132 flow [2025-03-08 17:13:54,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2025-03-08 17:13:54,610 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2025-03-08 17:13:54,610 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 132 flow [2025-03-08 17:13:54,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03-08 17:13:54,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:13:54,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:13:54,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:13:54,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:13:54,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:13:54,612 INFO L85 PathProgramCache]: Analyzing trace with hash 60484803, now seen corresponding path program 1 times [2025-03-08 17:13:54,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:13:54,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560436002] [2025-03-08 17:13:54,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:13:54,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:13:54,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 17:13:54,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 17:13:54,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:13:54,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:13:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:13:54,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:13:54,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560436002] [2025-03-08 17:13:54,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560436002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:13:54,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:13:54,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:13:54,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214013934] [2025-03-08 17:13:54,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:13:54,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:13:54,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:13:54,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:13:54,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:13:54,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-03-08 17:13:54,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03-08 17:13:54,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:13:54,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-03-08 17:13:54,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:13:55,359 INFO L124 PetriNetUnfolderBase]: 7283/12531 cut-off events. [2025-03-08 17:13:55,360 INFO L125 PetriNetUnfolderBase]: For 2823/2823 co-relation queries the response was YES. [2025-03-08 17:13:55,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24905 conditions, 12531 events. 7283/12531 cut-off events. For 2823/2823 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 92870 event pairs, 4758 based on Foata normal form. 267/11934 useless extension candidates. Maximal degree in co-relation 17780. Up to 7812 conditions per place. [2025-03-08 17:13:55,427 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 50 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-03-08 17:13:55,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 296 flow [2025-03-08 17:13:55,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:13:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:13:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-03-08 17:13:55,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6866666666666666 [2025-03-08 17:13:55,430 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 132 flow. Second operand 3 states and 103 transitions. [2025-03-08 17:13:55,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 296 flow [2025-03-08 17:13:55,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:13:55,449 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 136 flow [2025-03-08 17:13:55,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-03-08 17:13:55,451 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2025-03-08 17:13:55,451 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 136 flow [2025-03-08 17:13:55,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03-08 17:13:55,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:13:55,451 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-08 17:13:55,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:13:55,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:13:55,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:13:55,452 INFO L85 PathProgramCache]: Analyzing trace with hash 52652293, now seen corresponding path program 1 times [2025-03-08 17:13:55,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:13:55,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753787188] [2025-03-08 17:13:55,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:13:55,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:13:55,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 17:13:55,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 17:13:55,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:13:55,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:13:55,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:13:55,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 17:13:55,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 17:13:55,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:13:55,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:13:55,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:13:55,486 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:13:55,486 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-08 17:13:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-08 17:13:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-08 17:13:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-08 17:13:55,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-08 17:13:55,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:13:55,486 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 17:13:55,487 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:13:55,487 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-08 17:13:55,521 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:13:55,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 65 transitions, 158 flow [2025-03-08 17:13:55,531 INFO L124 PetriNetUnfolderBase]: 12/76 cut-off events. [2025-03-08 17:13:55,532 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-08 17:13:55,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 76 events. 12/76 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 211 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 70. Up to 5 conditions per place. [2025-03-08 17:13:55,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 65 transitions, 158 flow [2025-03-08 17:13:55,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 65 transitions, 158 flow [2025-03-08 17:13:55,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:13:55,534 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;@3b6990d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:13:55,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-08 17:13:55,536 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:13:55,538 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2025-03-08 17:13:55,539 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:13:55,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:13:55,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:13:55,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 17:13:55,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:13:55,539 INFO L85 PathProgramCache]: Analyzing trace with hash -336317194, now seen corresponding path program 1 times [2025-03-08 17:13:55,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:13:55,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875895818] [2025-03-08 17:13:55,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:13:55,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:13:55,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 17:13:55,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 17:13:55,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:13:55,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:13:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:13:55,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:13:55,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875895818] [2025-03-08 17:13:55,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875895818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:13:55,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:13:55,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:13:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69692683] [2025-03-08 17:13:55,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:13:55,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:13:55,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:13:55,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:13:55,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:13:55,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2025-03-08 17:13:55,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 65 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-03-08 17:13:55,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:13:55,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2025-03-08 17:13:55,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:13:59,527 INFO L124 PetriNetUnfolderBase]: 48782/75206 cut-off events. [2025-03-08 17:13:59,528 INFO L125 PetriNetUnfolderBase]: For 6782/6782 co-relation queries the response was YES. [2025-03-08 17:13:59,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139502 conditions, 75206 events. 48782/75206 cut-off events. For 6782/6782 co-relation queries the response was YES. Maximal size of possible extension queue 2869. Compared 620106 event pairs, 21439 based on Foata normal form. 11154/82862 useless extension candidates. Maximal degree in co-relation 16030. Up to 32758 conditions per place. [2025-03-08 17:13:59,939 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 64 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-03-08 17:13:59,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 90 transitions, 361 flow [2025-03-08 17:13:59,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:13:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:13:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-03-08 17:13:59,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.764102564102564 [2025-03-08 17:13:59,943 INFO L175 Difference]: Start difference. First operand has 62 places, 65 transitions, 158 flow. Second operand 3 states and 149 transitions. [2025-03-08 17:13:59,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 90 transitions, 361 flow [2025-03-08 17:13:59,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 349 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-08 17:13:59,949 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 156 flow [2025-03-08 17:13:59,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2025-03-08 17:13:59,952 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2025-03-08 17:13:59,953 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 156 flow [2025-03-08 17:13:59,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-03-08 17:13:59,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:13:59,954 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:13:59,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:13:59,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 17:13:59,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:13:59,954 INFO L85 PathProgramCache]: Analyzing trace with hash 676229325, now seen corresponding path program 1 times [2025-03-08 17:13:59,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:13:59,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905267986] [2025-03-08 17:13:59,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:13:59,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:13:59,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 17:13:59,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 17:13:59,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:13:59,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:14:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:14:00,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:14:00,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905267986] [2025-03-08 17:14:00,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905267986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:14:00,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:14:00,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:14:00,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620842161] [2025-03-08 17:14:00,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:14:00,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:14:00,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:14:00,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:14:00,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:14:00,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2025-03-08 17:14:00,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-03-08 17:14:00,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:14:00,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2025-03-08 17:14:00,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:14:06,174 INFO L124 PetriNetUnfolderBase]: 78489/120060 cut-off events. [2025-03-08 17:14:06,175 INFO L125 PetriNetUnfolderBase]: For 19505/19505 co-relation queries the response was YES. [2025-03-08 17:14:06,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232404 conditions, 120060 events. 78489/120060 cut-off events. For 19505/19505 co-relation queries the response was YES. Maximal size of possible extension queue 4441. Compared 1025916 event pairs, 34282 based on Foata normal form. 0/114539 useless extension candidates. Maximal degree in co-relation 116652. Up to 52513 conditions per place. [2025-03-08 17:14:06,998 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 67 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2025-03-08 17:14:06,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 378 flow [2025-03-08 17:14:06,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:14:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:14:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-03-08 17:14:06,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2025-03-08 17:14:06,999 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 156 flow. Second operand 3 states and 138 transitions. [2025-03-08 17:14:06,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 378 flow [2025-03-08 17:14:07,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:14:07,016 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 166 flow [2025-03-08 17:14:07,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-03-08 17:14:07,017 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2025-03-08 17:14:07,017 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 166 flow [2025-03-08 17:14:07,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-03-08 17:14:07,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:14:07,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:14:07,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:14:07,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 17:14:07,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:14:07,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2042191502, now seen corresponding path program 1 times [2025-03-08 17:14:07,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:14:07,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145653931] [2025-03-08 17:14:07,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:14:07,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:14:07,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 17:14:07,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 17:14:07,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:14:07,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:14:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:14:07,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:14:07,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145653931] [2025-03-08 17:14:07,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145653931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:14:07,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:14:07,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:14:07,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857936818] [2025-03-08 17:14:07,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:14:07,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:14:07,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:14:07,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:14:07,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:14:07,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2025-03-08 17:14:07,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-03-08 17:14:07,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:14:07,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2025-03-08 17:14:07,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:14:12,888 INFO L124 PetriNetUnfolderBase]: 70133/104555 cut-off events. [2025-03-08 17:14:12,888 INFO L125 PetriNetUnfolderBase]: For 22139/22139 co-relation queries the response was YES. [2025-03-08 17:14:13,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210611 conditions, 104555 events. 70133/104555 cut-off events. For 22139/22139 co-relation queries the response was YES. Maximal size of possible extension queue 3543. Compared 831619 event pairs, 46317 based on Foata normal form. 1884/101469 useless extension candidates. Maximal degree in co-relation 149828. Up to 69972 conditions per place. [2025-03-08 17:14:13,607 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 66 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-03-08 17:14:13,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 383 flow [2025-03-08 17:14:13,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:14:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:14:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-03-08 17:14:13,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7025641025641025 [2025-03-08 17:14:13,609 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 166 flow. Second operand 3 states and 137 transitions. [2025-03-08 17:14:13,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 383 flow [2025-03-08 17:14:13,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:14:13,713 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 170 flow [2025-03-08 17:14:13,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2025-03-08 17:14:13,714 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2025-03-08 17:14:13,714 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 170 flow [2025-03-08 17:14:13,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-03-08 17:14:13,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:14:13,714 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:14:13,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:14:13,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 17:14:13,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:14:13,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1939583511, now seen corresponding path program 1 times [2025-03-08 17:14:13,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:14:13,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934508129] [2025-03-08 17:14:13,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:14:13,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:14:13,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 17:14:13,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 17:14:13,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:14:13,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:14:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:14:13,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:14:13,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934508129] [2025-03-08 17:14:13,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934508129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:14:13,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:14:13,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:14:13,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99009243] [2025-03-08 17:14:13,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:14:13,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:14:13,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:14:13,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:14:13,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:14:13,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2025-03-08 17:14:13,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-03-08 17:14:13,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:14:13,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2025-03-08 17:14:13,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand