./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/wsc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-theta/wsc.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 cea92baab62ba0c35a952a0cf718b682864c9b4a52d803c2eb370964dcb75f16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:30:51,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:30:51,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:30:51,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:30:51,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:30:51,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:30:51,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:30:51,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:30:51,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:30:51,653 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:30:51,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:30:51,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:30:51,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:30:51,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:30:51,654 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:30:51,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:30:51,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:30:51,654 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:30:51,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:30:51,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:30:51,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:30:51,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:30:51,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:30:51,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:30:51,655 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:30:51,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:30:51,655 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:30:51,655 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:30:51,655 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:30:51,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:30:51,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:30:51,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:30:51,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:30:51,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:30:51,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:30:51,656 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:30:51,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:30:51,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:30:51,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:30:51,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:30:51,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:30:51,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:30:51,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:30:51,657 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 -> cea92baab62ba0c35a952a0cf718b682864c9b4a52d803c2eb370964dcb75f16 [2025-03-04 02:30:51,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:30:51,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:30:51,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:30:51,884 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:30:51,885 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:30:51,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/wsc.i [2025-03-04 02:30:53,044 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0275a551/a8eab499e25a469aa0e7aeb04a988614/FLAGc3c53bccb [2025-03-04 02:30:53,392 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:30:53,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/wsc.i [2025-03-04 02:30:53,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0275a551/a8eab499e25a469aa0e7aeb04a988614/FLAGc3c53bccb [2025-03-04 02:30:53,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0275a551/a8eab499e25a469aa0e7aeb04a988614 [2025-03-04 02:30:53,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:30:53,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:30:53,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:30:53,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:30:53,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:30:53,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:30:53" (1/1) ... [2025-03-04 02:30:53,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a7a83fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:53, skipping insertion in model container [2025-03-04 02:30:53,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:30:53" (1/1) ... [2025-03-04 02:30:53,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:30:53,899 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-theta/wsc.i[33949,33962] [2025-03-04 02:30:53,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:30:53,908 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:30:53,944 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-theta/wsc.i[33949,33962] [2025-03-04 02:30:53,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:30:53,965 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:30:53,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:53 WrapperNode [2025-03-04 02:30:53,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:30:53,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:30:53,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:30:53,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:30:53,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:53" (1/1) ... [2025-03-04 02:30:53,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:53" (1/1) ... [2025-03-04 02:30:53,989 INFO L138 Inliner]: procedures = 171, calls = 26, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 122 [2025-03-04 02:30:53,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:30:53,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:30:53,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:30:53,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:30:53,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:53" (1/1) ... [2025-03-04 02:30:53,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:53" (1/1) ... [2025-03-04 02:30:53,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:53" (1/1) ... [2025-03-04 02:30:54,004 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 0 writes are split as follows [0, 0]. [2025-03-04 02:30:54,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:53" (1/1) ... [2025-03-04 02:30:54,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:53" (1/1) ... [2025-03-04 02:30:54,007 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:53" (1/1) ... [2025-03-04 02:30:54,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:53" (1/1) ... [2025-03-04 02:30:54,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:53" (1/1) ... [2025-03-04 02:30:54,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:53" (1/1) ... [2025-03-04 02:30:54,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:30:54,011 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:30:54,014 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:30:54,014 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:30:54,014 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:53" (1/1) ... [2025-03-04 02:30:54,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:30:54,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:30:54,035 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-04 02:30:54,037 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-04 02:30:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:30:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure f0 [2025-03-04 02:30:54,051 INFO L138 BoogieDeclarations]: Found implementation of procedure f0 [2025-03-04 02:30:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-04 02:30:54,051 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-04 02:30:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-04 02:30:54,052 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-04 02:30:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure f3 [2025-03-04 02:30:54,052 INFO L138 BoogieDeclarations]: Found implementation of procedure f3 [2025-03-04 02:30:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure f4 [2025-03-04 02:30:54,052 INFO L138 BoogieDeclarations]: Found implementation of procedure f4 [2025-03-04 02:30:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure f5 [2025-03-04 02:30:54,052 INFO L138 BoogieDeclarations]: Found implementation of procedure f5 [2025-03-04 02:30:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:30:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:30:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:30:54,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:30:54,053 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:30:54,145 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:30:54,146 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:30:54,302 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:30:54,302 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:30:54,399 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:30:54,399 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:30:54,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:30:54 BoogieIcfgContainer [2025-03-04 02:30:54,400 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:30:54,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:30:54,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:30:54,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:30:54,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:30:53" (1/3) ... [2025-03-04 02:30:54,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b2b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:30:54, skipping insertion in model container [2025-03-04 02:30:54,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:30:53" (2/3) ... [2025-03-04 02:30:54,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b2b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:30:54, skipping insertion in model container [2025-03-04 02:30:54,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:30:54" (3/3) ... [2025-03-04 02:30:54,406 INFO L128 eAbstractionObserver]: Analyzing ICFG wsc.i [2025-03-04 02:30:54,415 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:30:54,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG wsc.i that has 7 procedures, 50 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 02:30:54,417 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:30:54,476 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-03-04 02:30:54,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 49 transitions, 140 flow [2025-03-04 02:30:54,534 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2025-03-04 02:30:54,549 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 02:30:54,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 43 events. 0/43 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-04 02:30:54,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 49 transitions, 140 flow [2025-03-04 02:30:54,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 42 transitions, 120 flow [2025-03-04 02:30:54,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:30:54,571 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;@512e9438, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:30:54,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 02:30:54,589 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:30:54,592 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2025-03-04 02:30:54,592 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 02:30:54,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:54,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:54,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:54,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:54,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1197286262, now seen corresponding path program 1 times [2025-03-04 02:30:54,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:54,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853779487] [2025-03-04 02:30:54,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:54,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:54,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:30:54,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:30:54,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:54,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:54,906 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-04 02:30:54,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:54,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853779487] [2025-03-04 02:30:54,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853779487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:54,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:54,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:30:54,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717746719] [2025-03-04 02:30:54,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:54,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:30:54,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:54,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:30:54,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:30:54,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 49 [2025-03-04 02:30:54,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 02:30:54,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:54,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 49 [2025-03-04 02:30:54,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:58,106 INFO L124 PetriNetUnfolderBase]: 45933/58343 cut-off events. [2025-03-04 02:30:58,107 INFO L125 PetriNetUnfolderBase]: For 4811/4811 co-relation queries the response was YES. [2025-03-04 02:30:58,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120887 conditions, 58343 events. 45933/58343 cut-off events. For 4811/4811 co-relation queries the response was YES. Maximal size of possible extension queue 1771. Compared 285725 event pairs, 31565 based on Foata normal form. 188/58530 useless extension candidates. Maximal degree in co-relation 117357. Up to 58167 conditions per place. [2025-03-04 02:30:58,517 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 51 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2025-03-04 02:30:58,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 57 transitions, 270 flow [2025-03-04 02:30:58,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:30:58,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:30:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-03-04 02:30:58,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5782312925170068 [2025-03-04 02:30:58,535 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 120 flow. Second operand 3 states and 85 transitions. [2025-03-04 02:30:58,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 57 transitions, 270 flow [2025-03-04 02:30:58,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-04 02:30:58,659 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 121 flow [2025-03-04 02:30:58,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2025-03-04 02:30:58,664 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2025-03-04 02:30:58,664 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 121 flow [2025-03-04 02:30:58,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 02:30:58,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:58,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:58,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:30:58,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:30:58,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:58,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1049933076, now seen corresponding path program 2 times [2025-03-04 02:30:58,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:58,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878898791] [2025-03-04 02:30:58,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:30:58,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:58,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:30:58,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:30:58,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:30:58,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:58,805 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-04 02:30:58,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:58,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878898791] [2025-03-04 02:30:58,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878898791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:58,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:58,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:30:58,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057861066] [2025-03-04 02:30:58,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:58,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:30:58,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:58,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:30:58,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:30:58,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 49 [2025-03-04 02:30:58,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 02:30:58,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:58,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 49 [2025-03-04 02:30:58,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:31:00,449 INFO L124 PetriNetUnfolderBase]: 35904/47100 cut-off events. [2025-03-04 02:31:00,449 INFO L125 PetriNetUnfolderBase]: For 10040/10040 co-relation queries the response was YES. [2025-03-04 02:31:00,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103690 conditions, 47100 events. 35904/47100 cut-off events. For 10040/10040 co-relation queries the response was YES. Maximal size of possible extension queue 1429. Compared 251192 event pairs, 10899 based on Foata normal form. 3802/50901 useless extension candidates. Maximal degree in co-relation 26724. Up to 32217 conditions per place. [2025-03-04 02:31:00,628 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 68 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-03-04 02:31:00,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 347 flow [2025-03-04 02:31:00,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:31:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:31:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2025-03-04 02:31:00,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6870748299319728 [2025-03-04 02:31:00,630 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 121 flow. Second operand 3 states and 101 transitions. [2025-03-04 02:31:00,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 347 flow [2025-03-04 02:31:00,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 76 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:31:00,632 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 160 flow [2025-03-04 02:31:00,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2025-03-04 02:31:00,633 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2025-03-04 02:31:00,633 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 160 flow [2025-03-04 02:31:00,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 02:31:00,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:31:00,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:31:00,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:31:00,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:31:00,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:31:00,635 INFO L85 PathProgramCache]: Analyzing trace with hash -596325698, now seen corresponding path program 3 times [2025-03-04 02:31:00,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:31:00,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341591426] [2025-03-04 02:31:00,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:31:00,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:31:00,645 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:31:00,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:31:00,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:31:00,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:00,827 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-04 02:31:00,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:31:00,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341591426] [2025-03-04 02:31:00,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341591426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:31:00,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:31:00,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:31:00,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035957131] [2025-03-04 02:31:00,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:31:00,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:31:00,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:31:00,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:31:00,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:31:00,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 49 [2025-03-04 02:31:00,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 02:31:00,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:31:00,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 49 [2025-03-04 02:31:00,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:31:03,087 INFO L124 PetriNetUnfolderBase]: 42168/55909 cut-off events. [2025-03-04 02:31:03,088 INFO L125 PetriNetUnfolderBase]: For 31048/31048 co-relation queries the response was YES. [2025-03-04 02:31:03,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134391 conditions, 55909 events. 42168/55909 cut-off events. For 31048/31048 co-relation queries the response was YES. Maximal size of possible extension queue 1638. Compared 308607 event pairs, 21775 based on Foata normal form. 1086/56994 useless extension candidates. Maximal degree in co-relation 28306. Up to 33365 conditions per place. [2025-03-04 02:31:03,249 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 68 selfloop transitions, 2 changer transitions 1/74 dead transitions. [2025-03-04 02:31:03,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 391 flow [2025-03-04 02:31:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:31:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:31:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-04 02:31:03,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2025-03-04 02:31:03,251 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 160 flow. Second operand 3 states and 93 transitions. [2025-03-04 02:31:03,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 391 flow [2025-03-04 02:31:03,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 363 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-04 02:31:03,293 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 154 flow [2025-03-04 02:31:03,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=53, 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=154, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2025-03-04 02:31:03,294 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2025-03-04 02:31:03,294 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 154 flow [2025-03-04 02:31:03,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 02:31:03,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:31:03,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:31:03,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:31:03,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:31:03,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:31:03,296 INFO L85 PathProgramCache]: Analyzing trace with hash -732081990, now seen corresponding path program 4 times [2025-03-04 02:31:03,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:31:03,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64604803] [2025-03-04 02:31:03,296 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:31:03,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:31:03,309 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-04 02:31:03,315 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 42 statements. [2025-03-04 02:31:03,316 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:31:03,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:03,358 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-04 02:31:03,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:31:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64604803] [2025-03-04 02:31:03,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64604803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:31:03,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:31:03,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:31:03,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325802832] [2025-03-04 02:31:03,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:31:03,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:31:03,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:31:03,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:31:03,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:31:03,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 49 [2025-03-04 02:31:03,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 02:31:03,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:31:03,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 49 [2025-03-04 02:31:03,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:31:05,438 INFO L124 PetriNetUnfolderBase]: 48000/64379 cut-off events. [2025-03-04 02:31:05,439 INFO L125 PetriNetUnfolderBase]: For 28182/28182 co-relation queries the response was YES. [2025-03-04 02:31:05,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152333 conditions, 64379 events. 48000/64379 cut-off events. For 28182/28182 co-relation queries the response was YES. Maximal size of possible extension queue 1915. Compared 379350 event pairs, 21654 based on Foata normal form. 1850/66228 useless extension candidates. Maximal degree in co-relation 68294. Up to 34165 conditions per place. [2025-03-04 02:31:05,603 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 73 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-03-04 02:31:05,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 400 flow [2025-03-04 02:31:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:31:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:31:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-03-04 02:31:05,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6394557823129252 [2025-03-04 02:31:05,604 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 154 flow. Second operand 3 states and 94 transitions. [2025-03-04 02:31:05,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 400 flow [2025-03-04 02:31:06,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:31:06,146 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 164 flow [2025-03-04 02:31:06,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2025-03-04 02:31:06,149 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2025-03-04 02:31:06,150 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 164 flow [2025-03-04 02:31:06,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 02:31:06,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:31:06,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:31:06,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:31:06,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:31:06,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:31:06,153 INFO L85 PathProgramCache]: Analyzing trace with hash 864640290, now seen corresponding path program 5 times [2025-03-04 02:31:06,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:31:06,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579833933] [2025-03-04 02:31:06,153 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:31:06,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:31:06,176 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:31:06,186 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:31:06,191 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:31:06,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:06,275 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-04 02:31:06,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:31:06,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579833933] [2025-03-04 02:31:06,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579833933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:31:06,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:31:06,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:31:06,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082660059] [2025-03-04 02:31:06,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:31:06,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:31:06,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:31:06,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:31:06,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:31:06,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 49 [2025-03-04 02:31:06,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 02:31:06,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:31:06,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 49 [2025-03-04 02:31:06,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:31:08,941 INFO L124 PetriNetUnfolderBase]: 52177/70758 cut-off events. [2025-03-04 02:31:08,941 INFO L125 PetriNetUnfolderBase]: For 37300/37300 co-relation queries the response was YES. [2025-03-04 02:31:09,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176461 conditions, 70758 events. 52177/70758 cut-off events. For 37300/37300 co-relation queries the response was YES. Maximal size of possible extension queue 2181. Compared 426088 event pairs, 30812 based on Foata normal form. 1994/72751 useless extension candidates. Maximal degree in co-relation 66406. Up to 47081 conditions per place. [2025-03-04 02:31:09,091 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 62 selfloop transitions, 2 changer transitions 9/76 dead transitions. [2025-03-04 02:31:09,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 406 flow [2025-03-04 02:31:09,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:31:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:31:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-04 02:31:09,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-04 02:31:09,093 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 164 flow. Second operand 3 states and 91 transitions. [2025-03-04 02:31:09,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 406 flow [2025-03-04 02:31:09,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 76 transitions, 402 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:31:09,223 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 156 flow [2025-03-04 02:31:09,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2025-03-04 02:31:09,224 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2025-03-04 02:31:09,224 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 156 flow [2025-03-04 02:31:09,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 02:31:09,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:31:09,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:31:09,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:31:09,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:31:09,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:31:09,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2134790618, now seen corresponding path program 6 times [2025-03-04 02:31:09,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:31:09,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356464417] [2025-03-04 02:31:09,226 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:31:09,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:31:09,234 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:31:09,237 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:31:09,238 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:31:09,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:31:09,268 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-04 02:31:09,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:31:09,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356464417] [2025-03-04 02:31:09,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356464417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:31:09,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:31:09,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:31:09,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572637328] [2025-03-04 02:31:09,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:31:09,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:31:09,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:31:09,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:31:09,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:31:09,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 49 [2025-03-04 02:31:09,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 02:31:09,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:31:09,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 49 [2025-03-04 02:31:09,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:31:10,721 INFO L124 PetriNetUnfolderBase]: 27255/37556 cut-off events. [2025-03-04 02:31:10,721 INFO L125 PetriNetUnfolderBase]: For 24224/24224 co-relation queries the response was YES. [2025-03-04 02:31:10,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98176 conditions, 37556 events. 27255/37556 cut-off events. For 24224/24224 co-relation queries the response was YES. Maximal size of possible extension queue 1415. Compared 220030 event pairs, 13951 based on Foata normal form. 1136/38691 useless extension candidates. Maximal degree in co-relation 43133. Up to 20315 conditions per place. [2025-03-04 02:31:10,808 INFO L140 encePairwiseOnDemand]: 47/49 looper letters, 0 selfloop transitions, 0 changer transitions 62/62 dead transitions. [2025-03-04 02:31:10,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 337 flow [2025-03-04 02:31:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:31:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:31:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-03-04 02:31:10,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5578231292517006 [2025-03-04 02:31:10,809 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 156 flow. Second operand 3 states and 82 transitions. [2025-03-04 02:31:10,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 337 flow [2025-03-04 02:31:10,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 330 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 02:31:10,884 INFO L231 Difference]: Finished difference. Result has 56 places, 0 transitions, 0 flow [2025-03-04 02:31:10,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=56, PETRI_TRANSITIONS=0} [2025-03-04 02:31:10,885 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2025-03-04 02:31:10,885 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 0 transitions, 0 flow [2025-03-04 02:31:10,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04 02:31:10,887 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-03-04 02:31:10,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2025-03-04 02:31:10,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-04 02:31:10,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 02:31:10,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-04 02:31:10,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-04 02:31:10,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2025-03-04 02:31:10,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:31:10,888 INFO L422 BasicCegarLoop]: Path program histogram: [6] [2025-03-04 02:31:10,891 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:31:10,891 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:31:10,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:31:10 BasicIcfg [2025-03-04 02:31:10,895 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:31:10,895 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:31:10,895 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:31:10,895 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:31:10,896 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:30:54" (3/4) ... [2025-03-04 02:31:10,897 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:31:10,899 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f0 [2025-03-04 02:31:10,899 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f1 [2025-03-04 02:31:10,900 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f2 [2025-03-04 02:31:10,900 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f3 [2025-03-04 02:31:10,900 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f4 [2025-03-04 02:31:10,900 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f5 [2025-03-04 02:31:10,902 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2025-03-04 02:31:10,902 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-04 02:31:10,902 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 02:31:10,902 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 02:31:10,953 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:31:10,953 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:31:10,953 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:31:10,954 INFO L158 Benchmark]: Toolchain (without parser) took 17325.10ms. Allocated memory was 142.6MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 110.5MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 979.1MB. Max. memory is 16.1GB. [2025-03-04 02:31:10,954 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:31:10,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.52ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 90.3MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:31:10,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.30ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:31:10,954 INFO L158 Benchmark]: Boogie Preprocessor took 21.05ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:31:10,954 INFO L158 Benchmark]: IcfgBuilder took 388.29ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 54.6MB in the end (delta: 31.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 02:31:10,955 INFO L158 Benchmark]: TraceAbstraction took 16493.66ms. Allocated memory was 142.6MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 53.7MB in the beginning and 3.2GB in the end (delta: -3.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2025-03-04 02:31:10,955 INFO L158 Benchmark]: Witness Printer took 57.95ms. Allocated memory is still 4.2GB. Free memory was 3.2GB in the beginning and 3.2GB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:31:10,957 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.52ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 90.3MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.30ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.05ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 388.29ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 54.6MB in the end (delta: 31.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16493.66ms. Allocated memory was 142.6MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 53.7MB in the beginning and 3.2GB in the end (delta: -3.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 57.95ms. Allocated memory is still 4.2GB. Free memory was 3.2GB in the beginning and 3.2GB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 802]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 84 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 564 IncrementalHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 0 mSDtfsCounter, 564 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=4, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 252 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 02:31:10,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE