./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:21:13,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:21:13,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:21:13,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:21:13,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:21:13,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:21:13,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:21:13,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:21:13,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:21:13,782 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:21:13,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:21:13,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:21:13,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:21:13,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:21:13,783 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:21:13,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:21:13,783 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:21:13,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:21:13,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:21:13,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:21:13,783 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:21:13,783 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:21:13,783 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:21:13,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:21:13,783 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:21:13,783 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:21:13,783 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:21:13,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:21:13,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:21:13,784 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:21:13,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:21:13,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:21:13,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:21:13,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:21:13,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:21:13,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:21:13,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:21:13,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:21:13,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:21:13,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:21:13,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:21:13,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:21:13,784 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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-17 14:21:14,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:21:14,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:21:14,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:21:14,057 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:21:14,058 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:21:14,059 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-17 14:21:15,227 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebee49bf/25968139334a45d0b007436287ceb747/FLAG8c0b65aa4 [2025-03-17 14:21:15,471 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:21:15,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-03-17 14:21:15,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebee49bf/25968139334a45d0b007436287ceb747/FLAG8c0b65aa4 [2025-03-17 14:21:15,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebee49bf/25968139334a45d0b007436287ceb747 [2025-03-17 14:21:15,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:21:15,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:21:15,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:21:15,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:21:15,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:21:15,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:21:15" (1/1) ... [2025-03-17 14:21:15,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1ed743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:21:15, skipping insertion in model container [2025-03-17 14:21:15,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:21:15" (1/1) ... [2025-03-17 14:21:15,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:21:15,646 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:21:15,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:21:15,656 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:21:15,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:21:15,684 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:21:15,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:21:15 WrapperNode [2025-03-17 14:21:15,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:21:15,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:21:15,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:21:15,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:21:15,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:21:15" (1/1) ... [2025-03-17 14:21:15,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:21:15" (1/1) ... [2025-03-17 14:21:15,714 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 11, calls inlined = 15, statements flattened = 187 [2025-03-17 14:21:15,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:21:15,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:21:15,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:21:15,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:21:15,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:21:15" (1/1) ... [2025-03-17 14:21:15,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:21:15" (1/1) ... [2025-03-17 14:21:15,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:21:15" (1/1) ... [2025-03-17 14:21:15,737 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-17 14:21:15,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:21:15" (1/1) ... [2025-03-17 14:21:15,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:21:15" (1/1) ... [2025-03-17 14:21:15,747 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:21:15" (1/1) ... [2025-03-17 14:21:15,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:21:15" (1/1) ... [2025-03-17 14:21:15,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:21:15" (1/1) ... [2025-03-17 14:21:15,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:21:15" (1/1) ... [2025-03-17 14:21:15,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:21:15,753 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:21:15,754 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:21:15,754 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:21:15,754 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:21:15" (1/1) ... [2025-03-17 14:21:15,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:21:15,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:21:15,781 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-17 14:21:15,784 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-17 14:21:15,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:21:15,801 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:21:15,801 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:21:15,801 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:21:15,801 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:21:15,802 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 14:21:15,802 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 14:21:15,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:21:15,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:21:15,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:21:15,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:21:15,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:21:15,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:21:15,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:21:15,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:21:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:21:15,803 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:21:15,890 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:21:15,891 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:21:16,329 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:21:16,329 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:21:16,517 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:21:16,517 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:21:16,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:21:16 BoogieIcfgContainer [2025-03-17 14:21:16,518 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:21:16,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:21:16,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:21:16,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:21:16,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:21:15" (1/3) ... [2025-03-17 14:21:16,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788c3549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:21:16, skipping insertion in model container [2025-03-17 14:21:16,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:21:15" (2/3) ... [2025-03-17 14:21:16,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788c3549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:21:16, skipping insertion in model container [2025-03-17 14:21:16,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:21:16" (3/3) ... [2025-03-17 14:21:16,528 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2025-03-17 14:21:16,542 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:21:16,543 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-trans.wvr.c that has 4 procedures, 91 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-03-17 14:21:16,543 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:21:16,597 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 14:21:16,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 105 transitions, 231 flow [2025-03-17 14:21:16,660 INFO L124 PetriNetUnfolderBase]: 15/102 cut-off events. [2025-03-17 14:21:16,662 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 14:21:16,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 15/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 269 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-17 14:21:16,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 105 transitions, 231 flow [2025-03-17 14:21:16,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 101 transitions, 220 flow [2025-03-17 14:21:16,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:21:16,689 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=None, 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;@3ea5e84a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:21:16,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-03-17 14:21:16,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:21:16,697 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:21:16,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:21:16,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:16,698 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:21:16,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:16,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:16,701 INFO L85 PathProgramCache]: Analyzing trace with hash 663282, now seen corresponding path program 1 times [2025-03-17 14:21:16,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:16,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750689385] [2025-03-17 14:21:16,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:16,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:16,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:21:16,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:21:16,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:16,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:16,907 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-17 14:21:16,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:16,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750689385] [2025-03-17 14:21:16,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750689385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:21:16,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:21:16,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:21:16,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127870152] [2025-03-17 14:21:16,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:21:16,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:21:16,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:16,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:21:16,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:21:17,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-17 14:21:17,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 101 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-17 14:21:17,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:21:17,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-17 14:21:17,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:21:17,220 INFO L124 PetriNetUnfolderBase]: 534/1059 cut-off events. [2025-03-17 14:21:17,221 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-17 14:21:17,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1797 conditions, 1059 events. 534/1059 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6160 event pairs, 210 based on Foata normal form. 1/570 useless extension candidates. Maximal degree in co-relation 1547. Up to 662 conditions per place. [2025-03-17 14:21:17,237 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 35 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-03-17 14:21:17,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 96 transitions, 284 flow [2025-03-17 14:21:17,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:21:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:21:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2025-03-17 14:21:17,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7301587301587301 [2025-03-17 14:21:17,251 INFO L175 Difference]: Start difference. First operand has 96 places, 101 transitions, 220 flow. Second operand 3 states and 230 transitions. [2025-03-17 14:21:17,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 96 transitions, 284 flow [2025-03-17 14:21:17,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 96 transitions, 272 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 14:21:17,258 INFO L231 Difference]: Finished difference. Result has 87 places, 96 transitions, 202 flow [2025-03-17 14:21:17,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=87, PETRI_TRANSITIONS=96} [2025-03-17 14:21:17,264 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -9 predicate places. [2025-03-17 14:21:17,265 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 96 transitions, 202 flow [2025-03-17 14:21:17,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-17 14:21:17,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:17,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:21:17,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:21:17,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:17,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:17,266 INFO L85 PathProgramCache]: Analyzing trace with hash 663283, now seen corresponding path program 1 times [2025-03-17 14:21:17,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:17,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459492680] [2025-03-17 14:21:17,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:17,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:17,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:21:17,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:21:17,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:17,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:17,504 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-17 14:21:17,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:17,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459492680] [2025-03-17 14:21:17,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459492680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:21:17,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:21:17,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:21:17,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045355118] [2025-03-17 14:21:17,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:21:17,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:21:17,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:17,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:21:17,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:21:17,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-17 14:21:17,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 96 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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-17 14:21:17,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:21:17,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-17 14:21:17,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:21:17,795 INFO L124 PetriNetUnfolderBase]: 535/1062 cut-off events. [2025-03-17 14:21:17,795 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-17 14:21:17,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1764 conditions, 1062 events. 535/1062 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6174 event pairs, 210 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1727. Up to 675 conditions per place. [2025-03-17 14:21:17,802 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 39 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2025-03-17 14:21:17,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 99 transitions, 294 flow [2025-03-17 14:21:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:21:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:21:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 296 transitions. [2025-03-17 14:21:17,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2025-03-17 14:21:17,804 INFO L175 Difference]: Start difference. First operand has 87 places, 96 transitions, 202 flow. Second operand 4 states and 296 transitions. [2025-03-17 14:21:17,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 99 transitions, 294 flow [2025-03-17 14:21:17,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 99 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:21:17,806 INFO L231 Difference]: Finished difference. Result has 90 places, 99 transitions, 225 flow [2025-03-17 14:21:17,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=90, PETRI_TRANSITIONS=99} [2025-03-17 14:21:17,807 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -6 predicate places. [2025-03-17 14:21:17,807 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 99 transitions, 225 flow [2025-03-17 14:21:17,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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-17 14:21:17,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:17,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:21:17,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:21:17,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:17,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash 20561102, now seen corresponding path program 1 times [2025-03-17 14:21:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:17,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289167269] [2025-03-17 14:21:17,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:17,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:21:17,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:21:17,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:17,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:17,998 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-17 14:21:17,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:17,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289167269] [2025-03-17 14:21:17,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289167269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:21:17,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:21:17,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:21:17,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147333990] [2025-03-17 14:21:17,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:21:18,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:21:18,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:18,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:21:18,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:21:18,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-17 14:21:18,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 99 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 63.8) internal successors, (319), 5 states have internal predecessors, (319), 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-17 14:21:18,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:21:18,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-17 14:21:18,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:21:18,294 INFO L124 PetriNetUnfolderBase]: 536/1065 cut-off events. [2025-03-17 14:21:18,294 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-17 14:21:18,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 1065 events. 536/1065 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6227 event pairs, 210 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 1756. Up to 674 conditions per place. [2025-03-17 14:21:18,300 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 39 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2025-03-17 14:21:18,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 323 flow [2025-03-17 14:21:18,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:21:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:21:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 362 transitions. [2025-03-17 14:21:18,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6895238095238095 [2025-03-17 14:21:18,302 INFO L175 Difference]: Start difference. First operand has 90 places, 99 transitions, 225 flow. Second operand 5 states and 362 transitions. [2025-03-17 14:21:18,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 323 flow [2025-03-17 14:21:18,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 102 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:21:18,304 INFO L231 Difference]: Finished difference. Result has 95 places, 102 transitions, 259 flow [2025-03-17 14:21:18,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=95, PETRI_TRANSITIONS=102} [2025-03-17 14:21:18,304 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2025-03-17 14:21:18,304 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 259 flow [2025-03-17 14:21:18,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.8) internal successors, (319), 5 states have internal predecessors, (319), 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-17 14:21:18,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:18,305 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:21:18,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:21:18,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:18,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:18,305 INFO L85 PathProgramCache]: Analyzing trace with hash 637434376, now seen corresponding path program 1 times [2025-03-17 14:21:18,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:18,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586823200] [2025-03-17 14:21:18,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:18,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:18,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:21:18,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:21:18,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:18,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:21:18,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:18,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586823200] [2025-03-17 14:21:18,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586823200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:21:18,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678386538] [2025-03-17 14:21:18,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:18,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:21:18,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:21:18,488 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-17 14:21:18,489 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-17 14:21:18,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:21:18,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:21:18,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:18,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:18,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:21:18,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:21:18,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-17 14:21:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:21:18,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:21:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:21:18,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678386538] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:21:18,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:21:18,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:21:18,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242264087] [2025-03-17 14:21:18,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:21:18,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:21:18,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:18,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:21:18,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:21:19,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-17 14:21:19,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 102 transitions, 259 flow. Second operand has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 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-17 14:21:19,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:21:19,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-17 14:21:19,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:21:19,472 INFO L124 PetriNetUnfolderBase]: 537/1067 cut-off events. [2025-03-17 14:21:19,472 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-17 14:21:19,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 1067 events. 537/1067 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6211 event pairs, 210 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 1766. Up to 675 conditions per place. [2025-03-17 14:21:19,481 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 38 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2025-03-17 14:21:19,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 104 transitions, 366 flow [2025-03-17 14:21:19,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:21:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:21:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 551 transitions. [2025-03-17 14:21:19,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.655952380952381 [2025-03-17 14:21:19,483 INFO L175 Difference]: Start difference. First operand has 95 places, 102 transitions, 259 flow. Second operand 8 states and 551 transitions. [2025-03-17 14:21:19,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 104 transitions, 366 flow [2025-03-17 14:21:19,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 104 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:21:19,488 INFO L231 Difference]: Finished difference. Result has 100 places, 104 transitions, 289 flow [2025-03-17 14:21:19,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=289, PETRI_PLACES=100, PETRI_TRANSITIONS=104} [2025-03-17 14:21:19,488 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 4 predicate places. [2025-03-17 14:21:19,489 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 104 transitions, 289 flow [2025-03-17 14:21:19,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 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-17 14:21:19,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:19,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:21:19,497 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-17 14:21:19,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:21:19,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:19,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:19,690 INFO L85 PathProgramCache]: Analyzing trace with hash 637396975, now seen corresponding path program 1 times [2025-03-17 14:21:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:19,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794323905] [2025-03-17 14:21:19,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:19,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:19,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:21:19,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:21:19,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:19,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:19,826 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-17 14:21:19,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:19,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794323905] [2025-03-17 14:21:19,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794323905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:21:19,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:21:19,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:21:19,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282331322] [2025-03-17 14:21:19,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:21:19,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:21:19,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:19,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:21:19,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:21:19,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-17 14:21:19,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 104 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 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-17 14:21:19,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:21:19,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-17 14:21:19,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:21:20,102 INFO L124 PetriNetUnfolderBase]: 538/1070 cut-off events. [2025-03-17 14:21:20,102 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-17 14:21:20,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 1070 events. 538/1070 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6214 event pairs, 210 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 1774. Up to 679 conditions per place. [2025-03-17 14:21:20,110 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 42 selfloop transitions, 9 changer transitions 0/107 dead transitions. [2025-03-17 14:21:20,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 107 transitions, 397 flow [2025-03-17 14:21:20,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:21:20,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:21:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 361 transitions. [2025-03-17 14:21:20,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6876190476190476 [2025-03-17 14:21:20,111 INFO L175 Difference]: Start difference. First operand has 100 places, 104 transitions, 289 flow. Second operand 5 states and 361 transitions. [2025-03-17 14:21:20,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 107 transitions, 397 flow [2025-03-17 14:21:20,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 107 transitions, 350 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-17 14:21:20,114 INFO L231 Difference]: Finished difference. Result has 98 places, 107 transitions, 285 flow [2025-03-17 14:21:20,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=98, PETRI_TRANSITIONS=107} [2025-03-17 14:21:20,114 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 2 predicate places. [2025-03-17 14:21:20,114 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 107 transitions, 285 flow [2025-03-17 14:21:20,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 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-17 14:21:20,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:20,115 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 14:21:20,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:21:20,115 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:20,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:20,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1715597731, now seen corresponding path program 1 times [2025-03-17 14:21:20,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:20,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487195777] [2025-03-17 14:21:20,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:20,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:20,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:21:20,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:21:20,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:20,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:21:20,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:20,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487195777] [2025-03-17 14:21:20,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487195777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:21:20,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900310402] [2025-03-17 14:21:20,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:20,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:21:20,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:21:20,281 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-17 14:21:20,283 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-17 14:21:20,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:21:20,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:21:20,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:20,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:20,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:21:20,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:21:20,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 14:21:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:21:20,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:21:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:21:20,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900310402] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:21:20,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:21:20,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:21:20,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993510887] [2025-03-17 14:21:20,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:21:20,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:21:20,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:20,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:21:20,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:21:21,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-17 14:21:21,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 107 transitions, 285 flow. Second operand has 13 states, 13 states have (on average 64.3076923076923) internal successors, (836), 13 states have internal predecessors, (836), 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-17 14:21:21,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:21:21,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-17 14:21:21,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:21:21,458 INFO L124 PetriNetUnfolderBase]: 538/1069 cut-off events. [2025-03-17 14:21:21,458 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-17 14:21:21,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1812 conditions, 1069 events. 538/1069 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6250 event pairs, 210 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 1763. Up to 669 conditions per place. [2025-03-17 14:21:21,464 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 35 selfloop transitions, 15 changer transitions 0/106 dead transitions. [2025-03-17 14:21:21,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 106 transitions, 381 flow [2025-03-17 14:21:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:21:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:21:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 486 transitions. [2025-03-17 14:21:21,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6612244897959184 [2025-03-17 14:21:21,466 INFO L175 Difference]: Start difference. First operand has 98 places, 107 transitions, 285 flow. Second operand 7 states and 486 transitions. [2025-03-17 14:21:21,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 106 transitions, 381 flow [2025-03-17 14:21:21,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 106 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:21:21,468 INFO L231 Difference]: Finished difference. Result has 101 places, 106 transitions, 304 flow [2025-03-17 14:21:21,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=101, PETRI_TRANSITIONS=106} [2025-03-17 14:21:21,469 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 5 predicate places. [2025-03-17 14:21:21,469 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 106 transitions, 304 flow [2025-03-17 14:21:21,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.3076923076923) internal successors, (836), 13 states have internal predecessors, (836), 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-17 14:21:21,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:21,470 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-17 14:21:21,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:21:21,670 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,SelfDestructingSolverStorable5 [2025-03-17 14:21:21,670 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:21,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:21,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1641808940, now seen corresponding path program 1 times [2025-03-17 14:21:21,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:21,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206232817] [2025-03-17 14:21:21,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:21,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:21,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:21:21,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:21:21,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:21,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:21:21,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:21,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206232817] [2025-03-17 14:21:21,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206232817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:21:21,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559082769] [2025-03-17 14:21:21,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:21,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:21:21,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:21:21,871 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-17 14:21:21,872 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-17 14:21:21,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:21:21,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:21:21,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:21,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:21,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:21:21,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:21:21,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-17 14:21:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:21:22,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:21:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:21:22,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559082769] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:21:22,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:21:22,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:21:22,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540674303] [2025-03-17 14:21:22,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:21:22,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:21:22,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:22,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:21:22,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:21:22,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-17 14:21:22,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 106 transitions, 304 flow. Second operand has 13 states, 13 states have (on average 64.46153846153847) internal successors, (838), 13 states have internal predecessors, (838), 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-17 14:21:22,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:21:22,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-17 14:21:22,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:21:23,285 INFO L124 PetriNetUnfolderBase]: 539/1071 cut-off events. [2025-03-17 14:21:23,285 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-17 14:21:23,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 1071 events. 539/1071 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6229 event pairs, 210 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 1768. Up to 670 conditions per place. [2025-03-17 14:21:23,290 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 31 selfloop transitions, 21 changer transitions 0/108 dead transitions. [2025-03-17 14:21:23,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 108 transitions, 416 flow [2025-03-17 14:21:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:21:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:21:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 618 transitions. [2025-03-17 14:21:23,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.653968253968254 [2025-03-17 14:21:23,294 INFO L175 Difference]: Start difference. First operand has 101 places, 106 transitions, 304 flow. Second operand 9 states and 618 transitions. [2025-03-17 14:21:23,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 108 transitions, 416 flow [2025-03-17 14:21:23,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 108 transitions, 389 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-17 14:21:23,296 INFO L231 Difference]: Finished difference. Result has 103 places, 108 transitions, 327 flow [2025-03-17 14:21:23,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=327, PETRI_PLACES=103, PETRI_TRANSITIONS=108} [2025-03-17 14:21:23,297 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 7 predicate places. [2025-03-17 14:21:23,298 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 108 transitions, 327 flow [2025-03-17 14:21:23,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.46153846153847) internal successors, (838), 13 states have internal predecessors, (838), 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-17 14:21:23,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:23,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:21:23,305 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-17 14:21:23,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:21:23,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:23,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:23,503 INFO L85 PathProgramCache]: Analyzing trace with hash 647960884, now seen corresponding path program 1 times [2025-03-17 14:21:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:23,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240359780] [2025-03-17 14:21:23,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:23,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:23,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:21:23,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:21:23,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:23,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:23,556 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-17 14:21:23,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:23,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240359780] [2025-03-17 14:21:23,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240359780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:21:23,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:21:23,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:21:23,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195797604] [2025-03-17 14:21:23,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:21:23,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:21:23,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:23,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:21:23,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:21:23,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-03-17 14:21:23,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 108 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 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-17 14:21:23,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:21:23,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-03-17 14:21:23,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:21:23,753 INFO L124 PetriNetUnfolderBase]: 847/1773 cut-off events. [2025-03-17 14:21:23,754 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-17 14:21:23,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3006 conditions, 1773 events. 847/1773 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11922 event pairs, 368 based on Foata normal form. 32/1038 useless extension candidates. Maximal degree in co-relation 2055. Up to 781 conditions per place. [2025-03-17 14:21:23,764 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 86 selfloop transitions, 7 changer transitions 0/148 dead transitions. [2025-03-17 14:21:23,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 148 transitions, 657 flow [2025-03-17 14:21:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:21:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:21:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 404 transitions. [2025-03-17 14:21:23,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7695238095238095 [2025-03-17 14:21:23,766 INFO L175 Difference]: Start difference. First operand has 103 places, 108 transitions, 327 flow. Second operand 5 states and 404 transitions. [2025-03-17 14:21:23,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 148 transitions, 657 flow [2025-03-17 14:21:23,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 148 transitions, 585 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-17 14:21:23,768 INFO L231 Difference]: Finished difference. Result has 103 places, 112 transitions, 333 flow [2025-03-17 14:21:23,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=103, PETRI_TRANSITIONS=112} [2025-03-17 14:21:23,768 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 7 predicate places. [2025-03-17 14:21:23,769 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 112 transitions, 333 flow [2025-03-17 14:21:23,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 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-17 14:21:23,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:23,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:21:23,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:21:23,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:23,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash 100754238, now seen corresponding path program 1 times [2025-03-17 14:21:23,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:23,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894009531] [2025-03-17 14:21:23,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:23,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:23,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:21:23,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:21:23,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:23,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:23,839 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-17 14:21:23,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:23,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894009531] [2025-03-17 14:21:23,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894009531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:21:23,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:21:23,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:21:23,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022611833] [2025-03-17 14:21:23,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:21:23,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:21:23,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:23,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:21:23,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:21:23,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-03-17 14:21:23,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 112 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 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-17 14:21:23,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:21:23,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-03-17 14:21:23,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:21:24,149 INFO L124 PetriNetUnfolderBase]: 1761/3656 cut-off events. [2025-03-17 14:21:24,149 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-17 14:21:24,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6204 conditions, 3656 events. 1761/3656 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 27950 event pairs, 543 based on Foata normal form. 32/2164 useless extension candidates. Maximal degree in co-relation 4434. Up to 943 conditions per place. [2025-03-17 14:21:24,172 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 112 selfloop transitions, 8 changer transitions 0/175 dead transitions. [2025-03-17 14:21:24,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 175 transitions, 742 flow [2025-03-17 14:21:24,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:21:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:21:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2025-03-17 14:21:24,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038095238095239 [2025-03-17 14:21:24,174 INFO L175 Difference]: Start difference. First operand has 103 places, 112 transitions, 333 flow. Second operand 5 states and 422 transitions. [2025-03-17 14:21:24,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 175 transitions, 742 flow [2025-03-17 14:21:24,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 175 transitions, 737 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:21:24,176 INFO L231 Difference]: Finished difference. Result has 107 places, 113 transitions, 358 flow [2025-03-17 14:21:24,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=107, PETRI_TRANSITIONS=113} [2025-03-17 14:21:24,177 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 11 predicate places. [2025-03-17 14:21:24,177 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 113 transitions, 358 flow [2025-03-17 14:21:24,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 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-17 14:21:24,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:24,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:21:24,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:21:24,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:24,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:24,178 INFO L85 PathProgramCache]: Analyzing trace with hash -127694267, now seen corresponding path program 1 times [2025-03-17 14:21:24,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:24,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277567120] [2025-03-17 14:21:24,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:24,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:24,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:21:24,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:21:24,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:24,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:24,236 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-17 14:21:24,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:24,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277567120] [2025-03-17 14:21:24,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277567120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:21:24,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:21:24,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:21:24,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678378594] [2025-03-17 14:21:24,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:21:24,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:21:24,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:24,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:21:24,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:21:24,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-03-17 14:21:24,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 113 transitions, 358 flow. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 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-17 14:21:24,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:21:24,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-03-17 14:21:24,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:21:24,488 INFO L124 PetriNetUnfolderBase]: 1364/2920 cut-off events. [2025-03-17 14:21:24,488 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2025-03-17 14:21:24,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 2920 events. 1364/2920 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 21824 event pairs, 678 based on Foata normal form. 40/1912 useless extension candidates. Maximal degree in co-relation 3168. Up to 1561 conditions per place. [2025-03-17 14:21:24,501 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 85 selfloop transitions, 7 changer transitions 0/147 dead transitions. [2025-03-17 14:21:24,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 147 transitions, 646 flow [2025-03-17 14:21:24,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:21:24,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:21:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2025-03-17 14:21:24,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7485714285714286 [2025-03-17 14:21:24,503 INFO L175 Difference]: Start difference. First operand has 107 places, 113 transitions, 358 flow. Second operand 5 states and 393 transitions. [2025-03-17 14:21:24,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 147 transitions, 646 flow [2025-03-17 14:21:24,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 147 transitions, 644 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:21:24,505 INFO L231 Difference]: Finished difference. Result has 111 places, 113 transitions, 373 flow [2025-03-17 14:21:24,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=373, PETRI_PLACES=111, PETRI_TRANSITIONS=113} [2025-03-17 14:21:24,506 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 15 predicate places. [2025-03-17 14:21:24,507 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 113 transitions, 373 flow [2025-03-17 14:21:24,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 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-17 14:21:24,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:24,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:21:24,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:21:24,507 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:24,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:24,508 INFO L85 PathProgramCache]: Analyzing trace with hash -362152307, now seen corresponding path program 1 times [2025-03-17 14:21:24,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:24,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645006231] [2025-03-17 14:21:24,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:24,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:24,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:21:24,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:21:24,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:24,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:21:24,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:24,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645006231] [2025-03-17 14:21:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645006231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:21:24,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:21:24,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:21:24,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626099340] [2025-03-17 14:21:24,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:21:24,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:21:24,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:24,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:21:24,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:21:24,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 105 [2025-03-17 14:21:24,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 113 transitions, 373 flow. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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-17 14:21:24,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:21:24,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 105 [2025-03-17 14:21:24,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:21:24,873 INFO L124 PetriNetUnfolderBase]: 1756/3157 cut-off events. [2025-03-17 14:21:24,873 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-03-17 14:21:24,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5784 conditions, 3157 events. 1756/3157 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 20938 event pairs, 905 based on Foata normal form. 0/2268 useless extension candidates. Maximal degree in co-relation 3895. Up to 2311 conditions per place. [2025-03-17 14:21:24,890 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 53 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2025-03-17 14:21:24,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 109 transitions, 487 flow [2025-03-17 14:21:24,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:21:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:21:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 320 transitions. [2025-03-17 14:21:24,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2025-03-17 14:21:24,892 INFO L175 Difference]: Start difference. First operand has 111 places, 113 transitions, 373 flow. Second operand 5 states and 320 transitions. [2025-03-17 14:21:24,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 109 transitions, 487 flow [2025-03-17 14:21:24,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 474 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:21:24,896 INFO L231 Difference]: Finished difference. Result has 108 places, 109 transitions, 368 flow [2025-03-17 14:21:24,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=368, PETRI_PLACES=108, PETRI_TRANSITIONS=109} [2025-03-17 14:21:24,897 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 12 predicate places. [2025-03-17 14:21:24,897 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 109 transitions, 368 flow [2025-03-17 14:21:24,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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-17 14:21:24,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:24,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:21:24,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:21:24,898 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:24,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:24,898 INFO L85 PathProgramCache]: Analyzing trace with hash -362152306, now seen corresponding path program 1 times [2025-03-17 14:21:24,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:24,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208698147] [2025-03-17 14:21:24,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:24,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:24,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:21:24,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:21:24,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:24,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:21:25,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:25,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208698147] [2025-03-17 14:21:25,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208698147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:21:25,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469588676] [2025-03-17 14:21:25,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:25,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:21:25,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:21:25,086 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-17 14:21:25,088 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-17 14:21:25,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:21:25,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:21:25,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:25,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:25,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:21:25,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:21:25,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:21:25,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:21:25,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:21:25,213 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 14:21:25,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 14:21:25,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:21:25,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:21:25,262 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:21:25,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-03-17 14:21:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:21:25,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:21:25,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 111 [2025-03-17 14:21:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:21:25,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469588676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:21:25,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:21:25,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-17 14:21:25,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343271423] [2025-03-17 14:21:25,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:21:25,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:21:25,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:25,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:21:25,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:21:26,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 105 [2025-03-17 14:21:26,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 109 transitions, 368 flow. Second operand has 14 states, 14 states have (on average 55.142857142857146) internal successors, (772), 14 states have internal predecessors, (772), 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-17 14:21:26,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:21:26,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 105 [2025-03-17 14:21:26,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:21:27,345 INFO L124 PetriNetUnfolderBase]: 2093/3814 cut-off events. [2025-03-17 14:21:27,346 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-03-17 14:21:27,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6948 conditions, 3814 events. 2093/3814 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 26356 event pairs, 799 based on Foata normal form. 0/2725 useless extension candidates. Maximal degree in co-relation 4972. Up to 1151 conditions per place. [2025-03-17 14:21:27,382 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 110 selfloop transitions, 20 changer transitions 0/176 dead transitions. [2025-03-17 14:21:27,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 176 transitions, 803 flow [2025-03-17 14:21:27,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:21:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:21:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 548 transitions. [2025-03-17 14:21:27,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6523809523809524 [2025-03-17 14:21:27,385 INFO L175 Difference]: Start difference. First operand has 108 places, 109 transitions, 368 flow. Second operand 8 states and 548 transitions. [2025-03-17 14:21:27,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 176 transitions, 803 flow [2025-03-17 14:21:27,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 176 transitions, 789 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:21:27,389 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 433 flow [2025-03-17 14:21:27,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=433, PETRI_PLACES=115, PETRI_TRANSITIONS=113} [2025-03-17 14:21:27,391 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 19 predicate places. [2025-03-17 14:21:27,391 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 433 flow [2025-03-17 14:21:27,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 55.142857142857146) internal successors, (772), 14 states have internal predecessors, (772), 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-17 14:21:27,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:27,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:21:27,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:21:27,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:21:27,592 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:27,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:27,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1798242791, now seen corresponding path program 1 times [2025-03-17 14:21:27,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:27,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103851818] [2025-03-17 14:21:27,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:27,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:27,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:21:27,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:21:27,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:27,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:27,653 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-17 14:21:27,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:27,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103851818] [2025-03-17 14:21:27,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103851818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:21:27,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:21:27,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:21:27,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863787893] [2025-03-17 14:21:27,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:21:27,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:21:27,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:27,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:21:27,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:21:27,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-03-17 14:21:27,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 433 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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-17 14:21:27,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:21:27,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-03-17 14:21:27,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:21:27,880 INFO L124 PetriNetUnfolderBase]: 1367/2553 cut-off events. [2025-03-17 14:21:27,880 INFO L125 PetriNetUnfolderBase]: For 668/704 co-relation queries the response was YES. [2025-03-17 14:21:27,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4935 conditions, 2553 events. 1367/2553 cut-off events. For 668/704 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16809 event pairs, 735 based on Foata normal form. 20/1886 useless extension candidates. Maximal degree in co-relation 3670. Up to 1614 conditions per place. [2025-03-17 14:21:27,907 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 85 selfloop transitions, 7 changer transitions 0/145 dead transitions. [2025-03-17 14:21:27,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 145 transitions, 711 flow [2025-03-17 14:21:27,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:21:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:21:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2025-03-17 14:21:27,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7657142857142857 [2025-03-17 14:21:27,912 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 433 flow. Second operand 5 states and 402 transitions. [2025-03-17 14:21:27,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 145 transitions, 711 flow [2025-03-17 14:21:27,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 145 transitions, 692 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-17 14:21:27,932 INFO L231 Difference]: Finished difference. Result has 118 places, 113 transitions, 434 flow [2025-03-17 14:21:27,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=434, PETRI_PLACES=118, PETRI_TRANSITIONS=113} [2025-03-17 14:21:27,932 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 22 predicate places. [2025-03-17 14:21:27,932 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 113 transitions, 434 flow [2025-03-17 14:21:27,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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-17 14:21:27,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:27,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:21:27,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:21:27,933 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:27,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:27,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2092813164, now seen corresponding path program 1 times [2025-03-17 14:21:27,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:27,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024040185] [2025-03-17 14:21:27,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:27,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:27,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:21:27,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:21:27,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:27,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:27,982 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-17 14:21:27,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:27,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024040185] [2025-03-17 14:21:27,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024040185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:21:27,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:21:27,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:21:27,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58373336] [2025-03-17 14:21:27,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:21:27,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:21:27,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:27,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:21:27,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:21:28,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-03-17 14:21:28,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 113 transitions, 434 flow. Second operand has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 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-17 14:21:28,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:21:28,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-03-17 14:21:28,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:21:28,298 INFO L124 PetriNetUnfolderBase]: 1864/4124 cut-off events. [2025-03-17 14:21:28,298 INFO L125 PetriNetUnfolderBase]: For 1193/1243 co-relation queries the response was YES. [2025-03-17 14:21:28,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7724 conditions, 4124 events. 1864/4124 cut-off events. For 1193/1243 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 33165 event pairs, 1038 based on Foata normal form. 81/3078 useless extension candidates. Maximal degree in co-relation 6338. Up to 1851 conditions per place. [2025-03-17 14:21:28,338 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 78 selfloop transitions, 8 changer transitions 0/139 dead transitions. [2025-03-17 14:21:28,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 139 transitions, 676 flow [2025-03-17 14:21:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:21:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:21:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 392 transitions. [2025-03-17 14:21:28,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7466666666666667 [2025-03-17 14:21:28,339 INFO L175 Difference]: Start difference. First operand has 118 places, 113 transitions, 434 flow. Second operand 5 states and 392 transitions. [2025-03-17 14:21:28,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 139 transitions, 676 flow [2025-03-17 14:21:28,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 139 transitions, 662 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:21:28,342 INFO L231 Difference]: Finished difference. Result has 119 places, 113 transitions, 440 flow [2025-03-17 14:21:28,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=440, PETRI_PLACES=119, PETRI_TRANSITIONS=113} [2025-03-17 14:21:28,342 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 23 predicate places. [2025-03-17 14:21:28,343 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 113 transitions, 440 flow [2025-03-17 14:21:28,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 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-17 14:21:28,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:28,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:21:28,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:21:28,343 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:28,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:28,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1658181008, now seen corresponding path program 1 times [2025-03-17 14:21:28,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:28,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243809849] [2025-03-17 14:21:28,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:28,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:28,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:21:28,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:21:28,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:28,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:21:28,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:28,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243809849] [2025-03-17 14:21:28,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243809849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:21:28,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:21:28,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:21:28,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907670116] [2025-03-17 14:21:28,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:21:28,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:21:28,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:28,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:21:28,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:21:28,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 105 [2025-03-17 14:21:28,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 113 transitions, 440 flow. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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-17 14:21:28,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:21:28,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 105 [2025-03-17 14:21:28,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:21:28,726 INFO L124 PetriNetUnfolderBase]: 2598/5043 cut-off events. [2025-03-17 14:21:28,726 INFO L125 PetriNetUnfolderBase]: For 962/962 co-relation queries the response was YES. [2025-03-17 14:21:28,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9842 conditions, 5043 events. 2598/5043 cut-off events. For 962/962 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 37833 event pairs, 1476 based on Foata normal form. 0/4055 useless extension candidates. Maximal degree in co-relation 7593. Up to 3538 conditions per place. [2025-03-17 14:21:28,746 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 52 selfloop transitions, 10 changer transitions 0/109 dead transitions. [2025-03-17 14:21:28,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 109 transitions, 556 flow [2025-03-17 14:21:28,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:21:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:21:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 324 transitions. [2025-03-17 14:21:28,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6171428571428571 [2025-03-17 14:21:28,748 INFO L175 Difference]: Start difference. First operand has 119 places, 113 transitions, 440 flow. Second operand 5 states and 324 transitions. [2025-03-17 14:21:28,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 109 transitions, 556 flow [2025-03-17 14:21:28,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 109 transitions, 549 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:21:28,752 INFO L231 Difference]: Finished difference. Result has 117 places, 109 transitions, 445 flow [2025-03-17 14:21:28,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=117, PETRI_TRANSITIONS=109} [2025-03-17 14:21:28,753 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 21 predicate places. [2025-03-17 14:21:28,753 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 109 transitions, 445 flow [2025-03-17 14:21:28,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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-17 14:21:28,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:21:28,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:21:28,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:21:28,754 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:21:28,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:21:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1658181009, now seen corresponding path program 1 times [2025-03-17 14:21:28,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:21:28,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122417505] [2025-03-17 14:21:28,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:28,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:21:28,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:21:28,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:21:28,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:28,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:21:28,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:21:28,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122417505] [2025-03-17 14:21:28,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122417505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:21:28,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630854051] [2025-03-17 14:21:28,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:21:28,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:21:28,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:21:28,878 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:21:28,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:21:28,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:21:28,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:21:28,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:21:28,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:21:28,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:21:28,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:21:28,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:21:28,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:21:28,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:21:28,993 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:21:28,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-03-17 14:21:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:21:29,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:21:29,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2025-03-17 14:21:29,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:21:29,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 39 [2025-03-17 14:21:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:21:29,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630854051] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:21:29,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:21:29,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-17 14:21:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320918478] [2025-03-17 14:21:29,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:21:29,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:21:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:21:29,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:21:29,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:21:33,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:21:37,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:21:41,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:21:45,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:21:49,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:21:53,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:21:57,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:22:01,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:22:05,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:22:09,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:22:13,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:22:17,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:22:21,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:22:25,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:22:29,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:22:33,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:22:37,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:22:41,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:22:45,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:22:49,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:22:49,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-03-17 14:22:49,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 445 flow. Second operand has 12 states, 12 states have (on average 45.25) internal successors, (543), 12 states have internal predecessors, (543), 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-17 14:22:49,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:49,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-03-17 14:22:49,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:50,465 INFO L124 PetriNetUnfolderBase]: 4480/7571 cut-off events. [2025-03-17 14:22:50,465 INFO L125 PetriNetUnfolderBase]: For 1243/1243 co-relation queries the response was YES. [2025-03-17 14:22:50,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15342 conditions, 7571 events. 4480/7571 cut-off events. For 1243/1243 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 54066 event pairs, 1187 based on Foata normal form. 0/5860 useless extension candidates. Maximal degree in co-relation 12060. Up to 2068 conditions per place. [2025-03-17 14:22:50,487 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 156 selfloop transitions, 29 changer transitions 0/224 dead transitions. [2025-03-17 14:22:50,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 224 transitions, 1147 flow [2025-03-17 14:22:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:22:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:22:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 599 transitions. [2025-03-17 14:22:50,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5704761904761905 [2025-03-17 14:22:50,490 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 445 flow. Second operand 10 states and 599 transitions. [2025-03-17 14:22:50,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 224 transitions, 1147 flow [2025-03-17 14:22:50,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 224 transitions, 1127 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:22:50,497 INFO L231 Difference]: Finished difference. Result has 127 places, 120 transitions, 603 flow [2025-03-17 14:22:50,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=603, PETRI_PLACES=127, PETRI_TRANSITIONS=120} [2025-03-17 14:22:50,498 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 31 predicate places. [2025-03-17 14:22:50,498 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 120 transitions, 603 flow [2025-03-17 14:22:50,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 45.25) internal successors, (543), 12 states have internal predecessors, (543), 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-17 14:22:50,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:50,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:50,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:22:50,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 14:22:50,700 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:22:50,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:50,700 INFO L85 PathProgramCache]: Analyzing trace with hash -587772302, now seen corresponding path program 1 times [2025-03-17 14:22:50,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:50,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681249607] [2025-03-17 14:22:50,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:50,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:50,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:22:50,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:22:50,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:50,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:22:50,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:50,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681249607] [2025-03-17 14:22:50,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681249607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:22:50,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:22:50,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:22:50,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493934147] [2025-03-17 14:22:50,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:22:50,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:22:50,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:50,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:22:50,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:22:50,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-03-17 14:22:50,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 120 transitions, 603 flow. Second operand has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 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-17 14:22:50,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:50,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-03-17 14:22:50,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:51,130 INFO L124 PetriNetUnfolderBase]: 2313/4856 cut-off events. [2025-03-17 14:22:51,130 INFO L125 PetriNetUnfolderBase]: For 3236/3368 co-relation queries the response was YES. [2025-03-17 14:22:51,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9542 conditions, 4856 events. 2313/4856 cut-off events. For 3236/3368 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 38551 event pairs, 895 based on Foata normal form. 30/3660 useless extension candidates. Maximal degree in co-relation 7947. Up to 1655 conditions per place. [2025-03-17 14:22:51,149 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 109 selfloop transitions, 13 changer transitions 0/172 dead transitions. [2025-03-17 14:22:51,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 172 transitions, 1024 flow [2025-03-17 14:22:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:22:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:22:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 413 transitions. [2025-03-17 14:22:51,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7866666666666666 [2025-03-17 14:22:51,151 INFO L175 Difference]: Start difference. First operand has 127 places, 120 transitions, 603 flow. Second operand 5 states and 413 transitions. [2025-03-17 14:22:51,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 172 transitions, 1024 flow [2025-03-17 14:22:51,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 172 transitions, 995 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-17 14:22:51,155 INFO L231 Difference]: Finished difference. Result has 130 places, 121 transitions, 629 flow [2025-03-17 14:22:51,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=629, PETRI_PLACES=130, PETRI_TRANSITIONS=121} [2025-03-17 14:22:51,156 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 34 predicate places. [2025-03-17 14:22:51,156 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 121 transitions, 629 flow [2025-03-17 14:22:51,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 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-17 14:22:51,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:51,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:51,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:22:51,156 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:22:51,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:51,157 INFO L85 PathProgramCache]: Analyzing trace with hash -390828016, now seen corresponding path program 1 times [2025-03-17 14:22:51,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:51,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302973463] [2025-03-17 14:22:51,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:51,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:51,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:22:51,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:22:51,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:51,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:22:51,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302973463] [2025-03-17 14:22:51,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302973463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:22:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887918785] [2025-03-17 14:22:51,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:51,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:22:51,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:22:51,314 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:22:51,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:22:51,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:22:51,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:22:51,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:51,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:51,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:22:51,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:22:51,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:22:51,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:22:51,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:22:51,454 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:22:51,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-03-17 14:22:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:22:51,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:22:51,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2025-03-17 14:22:51,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:22:51,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 39 [2025-03-17 14:22:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:22:51,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887918785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:22:51,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:22:51,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-17 14:22:51,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548116318] [2025-03-17 14:22:51,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:22:51,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:22:51,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:51,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:22:51,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:22:52,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 105 [2025-03-17 14:22:52,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 121 transitions, 629 flow. Second operand has 12 states, 12 states have (on average 61.833333333333336) internal successors, (742), 12 states have internal predecessors, (742), 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-17 14:22:52,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:52,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 105 [2025-03-17 14:22:52,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:53,103 INFO L124 PetriNetUnfolderBase]: 4130/8125 cut-off events. [2025-03-17 14:22:53,104 INFO L125 PetriNetUnfolderBase]: For 4309/4591 co-relation queries the response was YES. [2025-03-17 14:22:53,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16800 conditions, 8125 events. 4130/8125 cut-off events. For 4309/4591 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 66620 event pairs, 1199 based on Foata normal form. 0/6651 useless extension candidates. Maximal degree in co-relation 14986. Up to 2267 conditions per place. [2025-03-17 14:22:53,125 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 133 selfloop transitions, 29 changer transitions 0/209 dead transitions. [2025-03-17 14:22:53,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 209 transitions, 1214 flow [2025-03-17 14:22:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:22:53,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:22:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 726 transitions. [2025-03-17 14:22:53,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6914285714285714 [2025-03-17 14:22:53,127 INFO L175 Difference]: Start difference. First operand has 130 places, 121 transitions, 629 flow. Second operand 10 states and 726 transitions. [2025-03-17 14:22:53,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 209 transitions, 1214 flow [2025-03-17 14:22:53,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 209 transitions, 1198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:22:53,131 INFO L231 Difference]: Finished difference. Result has 141 places, 125 transitions, 716 flow [2025-03-17 14:22:53,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=716, PETRI_PLACES=141, PETRI_TRANSITIONS=125} [2025-03-17 14:22:53,131 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 45 predicate places. [2025-03-17 14:22:53,131 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 125 transitions, 716 flow [2025-03-17 14:22:53,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 61.833333333333336) internal successors, (742), 12 states have internal predecessors, (742), 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-17 14:22:53,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:53,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:53,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:22:53,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:22:53,336 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-17 14:22:53,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:22:53,336 INFO L85 PathProgramCache]: Analyzing trace with hash 769234011, now seen corresponding path program 1 times [2025-03-17 14:22:53,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:22:53,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664510675] [2025-03-17 14:22:53,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:53,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:22:53,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:22:53,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:22:53,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:53,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:22:53,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:22:53,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664510675] [2025-03-17 14:22:53,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664510675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:22:53,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756567242] [2025-03-17 14:22:53,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:22:53,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:22:53,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:22:53,455 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:22:53,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:22:53,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:22:53,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:22:53,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:22:53,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:22:53,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:22:53,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:22:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:22:53,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:22:53,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-17 14:22:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:22:53,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756567242] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:22:53,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:22:53,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-17 14:22:53,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501217713] [2025-03-17 14:22:53,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:22:53,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:22:53,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:22:53,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:22:53,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:22:54,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-17 14:22:54,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 125 transitions, 716 flow. Second operand has 12 states, 12 states have (on average 65.33333333333333) internal successors, (784), 12 states have internal predecessors, (784), 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-17 14:22:54,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:22:54,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-17 14:22:54,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:22:54,583 INFO L124 PetriNetUnfolderBase]: 4135/8147 cut-off events. [2025-03-17 14:22:54,584 INFO L125 PetriNetUnfolderBase]: For 5027/5309 co-relation queries the response was YES. [2025-03-17 14:22:54,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17606 conditions, 8147 events. 4135/8147 cut-off events. For 5027/5309 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 66693 event pairs, 1199 based on Foata normal form. 0/7149 useless extension candidates. Maximal degree in co-relation 15749. Up to 2183 conditions per place. [2025-03-17 14:22:54,614 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 128 selfloop transitions, 29 changer transitions 0/208 dead transitions. [2025-03-17 14:22:54,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 208 transitions, 1290 flow [2025-03-17 14:22:54,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:22:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:22:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 631 transitions. [2025-03-17 14:22:54,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7511904761904762 [2025-03-17 14:22:54,615 INFO L175 Difference]: Start difference. First operand has 141 places, 125 transitions, 716 flow. Second operand 8 states and 631 transitions. [2025-03-17 14:22:54,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 208 transitions, 1290 flow [2025-03-17 14:22:54,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 208 transitions, 1265 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:22:54,625 INFO L231 Difference]: Finished difference. Result has 149 places, 128 transitions, 789 flow [2025-03-17 14:22:54,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=789, PETRI_PLACES=149, PETRI_TRANSITIONS=128} [2025-03-17 14:22:54,625 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 53 predicate places. [2025-03-17 14:22:54,625 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 128 transitions, 789 flow [2025-03-17 14:22:54,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 65.33333333333333) internal successors, (784), 12 states have internal predecessors, (784), 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-17 14:22:54,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:22:54,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:22:54,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0