./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c --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/weaver/array-eq-trans.wvr.c -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 e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:16:32,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:16:32,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:16:32,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:16:32,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:16:32,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:16:32,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:16:32,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:16:32,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:16:32,500 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:16:32,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:16:32,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:16:32,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:16:32,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:16:32,501 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:16:32,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:16:32,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:16:32,502 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:16:32,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:16:32,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:16:32,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:16:32,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:16:32,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:16:32,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:16:32,503 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:16:32,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:16:32,503 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:16:32,503 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:16:32,503 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:16:32,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:16:32,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:16:32,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:16:32,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:16:32,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:16:32,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:16:32,504 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:16:32,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:16:32,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:16:32,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:16:32,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:16:32,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:16:32,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:16:32,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:16:32,504 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 -> e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe [2025-03-04 02:16:32,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:16:32,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:16:32,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:16:32,754 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:16:32,754 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:16:32,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-03-04 02:16:33,930 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f6d1ddf/c7aa066d4a5a4fd0ae64b359f0e95f35/FLAG4b2d2ebb4 [2025-03-04 02:16:34,156 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:16:34,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-03-04 02:16:34,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f6d1ddf/c7aa066d4a5a4fd0ae64b359f0e95f35/FLAG4b2d2ebb4 [2025-03-04 02:16:34,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f6d1ddf/c7aa066d4a5a4fd0ae64b359f0e95f35 [2025-03-04 02:16:34,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:16:34,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:16:34,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:16:34,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:16:34,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:16:34,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670f7015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34, skipping insertion in model container [2025-03-04 02:16:34,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:16:34,322 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/weaver/array-eq-trans.wvr.c[2776,2789] [2025-03-04 02:16:34,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:16:34,337 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:16:34,354 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/weaver/array-eq-trans.wvr.c[2776,2789] [2025-03-04 02:16:34,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:16:34,367 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:16:34,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34 WrapperNode [2025-03-04 02:16:34,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:16:34,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:16:34,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:16:34,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:16:34,373 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:16:34" (1/1) ... [2025-03-04 02:16:34,378 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:16:34" (1/1) ... [2025-03-04 02:16:34,398 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 185 [2025-03-04 02:16:34,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:16:34,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:16:34,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:16:34,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:16:34,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,417 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 02:16:34,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,422 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:16:34,428 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:16:34,428 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:16:34,428 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:16:34,429 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:16:34,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:34,451 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:16:34,453 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:16:34,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:16:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:16:34,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:16:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:16:34,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:16:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:16:34,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:16:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:16:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:16:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:16:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:16:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:16:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:16:34,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:16:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:16:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:16:34,470 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:16:34,544 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:16:34,545 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:16:34,851 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:16:34,852 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:16:35,084 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:16:35,084 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:16:35,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:16:35 BoogieIcfgContainer [2025-03-04 02:16:35,085 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:16:35,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:16:35,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:16:35,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:16:35,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:16:34" (1/3) ... [2025-03-04 02:16:35,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56618e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:16:35, skipping insertion in model container [2025-03-04 02:16:35,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (2/3) ... [2025-03-04 02:16:35,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56618e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:16:35, skipping insertion in model container [2025-03-04 02:16:35,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:16:35" (3/3) ... [2025-03-04 02:16:35,093 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2025-03-04 02:16:35,106 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:16:35,107 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-trans.wvr.c that has 4 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-04 02:16:35,108 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:16:35,155 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:16:35,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 101 flow [2025-03-04 02:16:35,211 INFO L124 PetriNetUnfolderBase]: 9/37 cut-off events. [2025-03-04 02:16:35,214 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:16:35,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 9/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-03-04 02:16:35,218 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 40 transitions, 101 flow [2025-03-04 02:16:35,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 36 transitions, 90 flow [2025-03-04 02:16:35,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:16:35,240 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;@5db0deb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:16:35,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:16:35,255 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:16:35,256 INFO L124 PetriNetUnfolderBase]: 9/35 cut-off events. [2025-03-04 02:16:35,256 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:16:35,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:35,256 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] [2025-03-04 02:16:35,257 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 1 more)] === [2025-03-04 02:16:35,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:35,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1511072373, now seen corresponding path program 1 times [2025-03-04 02:16:35,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:35,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095812401] [2025-03-04 02:16:35,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:35,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:35,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:16:35,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:16:35,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:35,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:35,938 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:16:35,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:35,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095812401] [2025-03-04 02:16:35,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095812401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:35,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:35,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:16:35,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135343429] [2025-03-04 02:16:35,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:35,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:16:35,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:35,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:16:35,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:16:35,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2025-03-04 02:16:35,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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:16:35,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:35,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2025-03-04 02:16:35,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:36,329 INFO L124 PetriNetUnfolderBase]: 1319/1875 cut-off events. [2025-03-04 02:16:36,330 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-04 02:16:36,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3761 conditions, 1875 events. 1319/1875 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8746 event pairs, 745 based on Foata normal form. 32/1595 useless extension candidates. Maximal degree in co-relation 2273. Up to 1164 conditions per place. [2025-03-04 02:16:36,351 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 28 selfloop transitions, 2 changer transitions 27/64 dead transitions. [2025-03-04 02:16:36,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 64 transitions, 278 flow [2025-03-04 02:16:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:16:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:16:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-03-04 02:16:36,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.545 [2025-03-04 02:16:36,366 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 90 flow. Second operand 5 states and 109 transitions. [2025-03-04 02:16:36,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 64 transitions, 278 flow [2025-03-04 02:16:36,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 64 transitions, 254 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:16:36,375 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 102 flow [2025-03-04 02:16:36,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-03-04 02:16:36,382 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2025-03-04 02:16:36,382 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 102 flow [2025-03-04 02:16:36,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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:16:36,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:36,382 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] [2025-03-04 02:16:36,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:16:36,384 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 1 more)] === [2025-03-04 02:16:36,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:36,384 INFO L85 PathProgramCache]: Analyzing trace with hash 787845435, now seen corresponding path program 1 times [2025-03-04 02:16:36,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:36,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888861781] [2025-03-04 02:16:36,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:36,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:36,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:16:36,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:16:36,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:36,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:16:36,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:36,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888861781] [2025-03-04 02:16:36,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888861781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:36,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123669493] [2025-03-04 02:16:36,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:36,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:36,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:36,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:16:36,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:16:36,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:16:36,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:16:36,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:36,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:36,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:16:36,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:16:37,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:37,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:16:37,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 55 [2025-03-04 02:16:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:16:37,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123669493] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:37,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:16:37,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 10 [2025-03-04 02:16:37,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637325960] [2025-03-04 02:16:37,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:37,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:16:37,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:37,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:16:37,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:16:37,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-03-04 02:16:37,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:16:37,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:37,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-03-04 02:16:37,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:37,541 INFO L124 PetriNetUnfolderBase]: 1708/2369 cut-off events. [2025-03-04 02:16:37,541 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2025-03-04 02:16:37,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4923 conditions, 2369 events. 1708/2369 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 10926 event pairs, 476 based on Foata normal form. 1/1914 useless extension candidates. Maximal degree in co-relation 4910. Up to 940 conditions per place. [2025-03-04 02:16:37,561 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 62 selfloop transitions, 5 changer transitions 1/74 dead transitions. [2025-03-04 02:16:37,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 74 transitions, 328 flow [2025-03-04 02:16:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:16:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:16:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-03-04 02:16:37,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.57 [2025-03-04 02:16:37,564 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 102 flow. Second operand 5 states and 114 transitions. [2025-03-04 02:16:37,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 74 transitions, 328 flow [2025-03-04 02:16:37,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 74 transitions, 306 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-04 02:16:37,571 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 114 flow [2025-03-04 02:16:37,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2025-03-04 02:16:37,572 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2025-03-04 02:16:37,572 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 114 flow [2025-03-04 02:16:37,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:16:37,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:37,573 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] [2025-03-04 02:16:37,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:16:37,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:37,777 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 1 more)] === [2025-03-04 02:16:37,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:37,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1487142773, now seen corresponding path program 1 times [2025-03-04 02:16:37,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:37,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780616206] [2025-03-04 02:16:37,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:37,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:37,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:16:37,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:16:37,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:37,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:37,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:37,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780616206] [2025-03-04 02:16:37,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780616206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:37,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:37,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:16:37,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528543898] [2025-03-04 02:16:37,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:37,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:16:37,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:37,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:16:37,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:16:37,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2025-03-04 02:16:37,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:16:37,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:37,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2025-03-04 02:16:37,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:38,195 INFO L124 PetriNetUnfolderBase]: 2247/3218 cut-off events. [2025-03-04 02:16:38,196 INFO L125 PetriNetUnfolderBase]: For 355/363 co-relation queries the response was YES. [2025-03-04 02:16:38,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6781 conditions, 3218 events. 2247/3218 cut-off events. For 355/363 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 16792 event pairs, 771 based on Foata normal form. 53/2892 useless extension candidates. Maximal degree in co-relation 6761. Up to 1406 conditions per place. [2025-03-04 02:16:38,209 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 48 selfloop transitions, 4 changer transitions 21/81 dead transitions. [2025-03-04 02:16:38,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 81 transitions, 361 flow [2025-03-04 02:16:38,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:16:38,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:16:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-03-04 02:16:38,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615 [2025-03-04 02:16:38,213 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 114 flow. Second operand 5 states and 123 transitions. [2025-03-04 02:16:38,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 81 transitions, 361 flow [2025-03-04 02:16:38,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 81 transitions, 359 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:16:38,217 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 142 flow [2025-03-04 02:16:38,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-03-04 02:16:38,219 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2025-03-04 02:16:38,219 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 142 flow [2025-03-04 02:16:38,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:16:38,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:38,219 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] [2025-03-04 02:16:38,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:16:38,219 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 1 more)] === [2025-03-04 02:16:38,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:38,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1207844712, now seen corresponding path program 1 times [2025-03-04 02:16:38,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:38,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347640761] [2025-03-04 02:16:38,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:38,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:38,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:16:38,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:16:38,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:38,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:38,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:38,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347640761] [2025-03-04 02:16:38,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347640761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:38,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780259873] [2025-03-04 02:16:38,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:38,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:38,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:38,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:16:38,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:16:38,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:16:38,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:16:38,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:38,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:38,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:16:38,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:38,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:38,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:16:38,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 55 [2025-03-04 02:16:38,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:38,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780259873] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:38,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:16:38,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2025-03-04 02:16:38,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753829553] [2025-03-04 02:16:38,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:38,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:16:38,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:38,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:16:38,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:16:38,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-03-04 02:16:38,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:16:38,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:38,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-03-04 02:16:38,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:39,341 INFO L124 PetriNetUnfolderBase]: 4357/6188 cut-off events. [2025-03-04 02:16:39,341 INFO L125 PetriNetUnfolderBase]: For 2827/2961 co-relation queries the response was YES. [2025-03-04 02:16:39,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13971 conditions, 6188 events. 4357/6188 cut-off events. For 2827/2961 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 34230 event pairs, 1029 based on Foata normal form. 3/5262 useless extension candidates. Maximal degree in co-relation 13945. Up to 1821 conditions per place. [2025-03-04 02:16:39,367 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 81 selfloop transitions, 7 changer transitions 3/98 dead transitions. [2025-03-04 02:16:39,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 98 transitions, 517 flow [2025-03-04 02:16:39,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:16:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:16:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2025-03-04 02:16:39,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2025-03-04 02:16:39,369 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 142 flow. Second operand 7 states and 146 transitions. [2025-03-04 02:16:39,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 98 transitions, 517 flow [2025-03-04 02:16:39,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 98 transitions, 502 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 02:16:39,375 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 170 flow [2025-03-04 02:16:39,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2025-03-04 02:16:39,376 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2025-03-04 02:16:39,377 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 170 flow [2025-03-04 02:16:39,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:16:39,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:39,378 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] [2025-03-04 02:16:39,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:16:39,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 02:16:39,578 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 1 more)] === [2025-03-04 02:16:39,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash -123513984, now seen corresponding path program 1 times [2025-03-04 02:16:39,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:39,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323638815] [2025-03-04 02:16:39,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:39,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:39,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:16:39,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:16:39,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:39,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:39,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:39,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323638815] [2025-03-04 02:16:39,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323638815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:39,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:39,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:16:39,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082412542] [2025-03-04 02:16:39,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:39,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:16:39,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:39,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:16:39,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:16:39,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2025-03-04 02:16:39,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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:16:39,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:39,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2025-03-04 02:16:39,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:40,097 INFO L124 PetriNetUnfolderBase]: 4199/6142 cut-off events. [2025-03-04 02:16:40,097 INFO L125 PetriNetUnfolderBase]: For 3213/3335 co-relation queries the response was YES. [2025-03-04 02:16:40,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14211 conditions, 6142 events. 4199/6142 cut-off events. For 3213/3335 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 35950 event pairs, 3102 based on Foata normal form. 126/5816 useless extension candidates. Maximal degree in co-relation 14181. Up to 4931 conditions per place. [2025-03-04 02:16:40,134 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 33 selfloop transitions, 3 changer transitions 21/66 dead transitions. [2025-03-04 02:16:40,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 352 flow [2025-03-04 02:16:40,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:16:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:16:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-03-04 02:16:40,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:16:40,136 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 170 flow. Second operand 5 states and 100 transitions. [2025-03-04 02:16:40,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 352 flow [2025-03-04 02:16:40,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:16:40,141 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 182 flow [2025-03-04 02:16:40,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2025-03-04 02:16:40,142 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2025-03-04 02:16:40,142 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 182 flow [2025-03-04 02:16:40,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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:16:40,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:40,142 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] [2025-03-04 02:16:40,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:16:40,143 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 1 more)] === [2025-03-04 02:16:40,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:40,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1352260494, now seen corresponding path program 1 times [2025-03-04 02:16:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:40,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324129834] [2025-03-04 02:16:40,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:40,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:40,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:16:40,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:16:40,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:40,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:40,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:40,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324129834] [2025-03-04 02:16:40,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324129834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:40,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646076560] [2025-03-04 02:16:40,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:40,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:40,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:40,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:16:40,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:16:40,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:16:40,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:16:40,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:40,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:40,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:16:40,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:40,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:40,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646076560] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:40,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:16:40,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 13 [2025-03-04 02:16:40,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936109845] [2025-03-04 02:16:40,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:40,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:16:40,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:40,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:16:40,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:16:40,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-03-04 02:16:40,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:40,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:40,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-03-04 02:16:40,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:41,302 INFO L124 PetriNetUnfolderBase]: 6384/9350 cut-off events. [2025-03-04 02:16:41,303 INFO L125 PetriNetUnfolderBase]: For 6498/6709 co-relation queries the response was YES. [2025-03-04 02:16:41,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22668 conditions, 9350 events. 6384/9350 cut-off events. For 6498/6709 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 55826 event pairs, 2331 based on Foata normal form. 0/8512 useless extension candidates. Maximal degree in co-relation 22636. Up to 3821 conditions per place. [2025-03-04 02:16:41,341 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 69 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-03-04 02:16:41,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 490 flow [2025-03-04 02:16:41,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:16:41,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:16:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2025-03-04 02:16:41,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45357142857142857 [2025-03-04 02:16:41,343 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 182 flow. Second operand 7 states and 127 transitions. [2025-03-04 02:16:41,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 490 flow [2025-03-04 02:16:41,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 478 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 02:16:41,346 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 202 flow [2025-03-04 02:16:41,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2025-03-04 02:16:41,347 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2025-03-04 02:16:41,347 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 202 flow [2025-03-04 02:16:41,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:41,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:41,348 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] [2025-03-04 02:16:41,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:16:41,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:41,549 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:16:41,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:41,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1586881900, now seen corresponding path program 1 times [2025-03-04 02:16:41,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:41,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340893531] [2025-03-04 02:16:41,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:41,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:41,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:16:41,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:16:41,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:41,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:16:42,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:42,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340893531] [2025-03-04 02:16:42,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340893531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:42,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:42,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:16:42,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969636125] [2025-03-04 02:16:42,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:42,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:16:42,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:42,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:16:42,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:16:42,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-04 02:16:42,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 202 flow. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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:16:42,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:42,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-04 02:16:42,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:43,344 INFO L124 PetriNetUnfolderBase]: 9303/13428 cut-off events. [2025-03-04 02:16:43,345 INFO L125 PetriNetUnfolderBase]: For 9915/9915 co-relation queries the response was YES. [2025-03-04 02:16:43,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35806 conditions, 13428 events. 9303/13428 cut-off events. For 9915/9915 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 78817 event pairs, 2563 based on Foata normal form. 23/13433 useless extension candidates. Maximal degree in co-relation 35772. Up to 11743 conditions per place. [2025-03-04 02:16:43,389 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 76 selfloop transitions, 13 changer transitions 11/104 dead transitions. [2025-03-04 02:16:43,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 104 transitions, 592 flow [2025-03-04 02:16:43,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:16:43,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:16:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2025-03-04 02:16:43,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2025-03-04 02:16:43,390 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 202 flow. Second operand 6 states and 134 transitions. [2025-03-04 02:16:43,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 104 transitions, 592 flow [2025-03-04 02:16:43,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 104 transitions, 586 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:16:43,407 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 305 flow [2025-03-04 02:16:43,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2025-03-04 02:16:43,407 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 28 predicate places. [2025-03-04 02:16:43,407 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 305 flow [2025-03-04 02:16:43,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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:16:43,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:43,408 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] [2025-03-04 02:16:43,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:16:43,408 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:16:43,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:43,408 INFO L85 PathProgramCache]: Analyzing trace with hash -44136348, now seen corresponding path program 1 times [2025-03-04 02:16:43,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:43,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96960411] [2025-03-04 02:16:43,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:43,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:43,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:16:43,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:16:43,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:43,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:16:44,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:44,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96960411] [2025-03-04 02:16:44,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96960411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:44,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382624810] [2025-03-04 02:16:44,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:44,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:44,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:44,166 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:16:44,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:16:44,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:16:44,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:16:44,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:44,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:44,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:16:44,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:16:44,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:45,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:16:45,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 122 treesize of output 485