./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-series2.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 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:13:12,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:13:13,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:13:13,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:13:13,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:13:13,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:13:13,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:13:13,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:13:13,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:13:13,025 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:13:13,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:13:13,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:13:13,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:13:13,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:13:13,025 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:13:13,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:13:13,026 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:13:13,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:13:13,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:13:13,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:13:13,026 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:13:13,026 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:13:13,026 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:13:13,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:13:13,027 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:13:13,027 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:13:13,027 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:13:13,027 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:13:13,027 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:13:13,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:13:13,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:13:13,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:13:13,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:13:13,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:13:13,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:13:13,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:13:13,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:13:13,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:13:13,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:13:13,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:13:13,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:13:13,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:13:13,028 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 -> 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 [2025-03-04 10:13:13,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:13:13,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:13:13,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:13:13,341 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:13:13,341 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:13:13,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2025-03-04 10:13:14,597 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d62f3a6/66984f31683d48c2b89fba695669e985/FLAGd45e599ba [2025-03-04 10:13:14,836 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:13:14,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2025-03-04 10:13:14,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d62f3a6/66984f31683d48c2b89fba695669e985/FLAGd45e599ba [2025-03-04 10:13:14,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d62f3a6/66984f31683d48c2b89fba695669e985 [2025-03-04 10:13:14,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:13:14,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:13:14,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:13:14,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:13:14,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:13:14,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:13:14" (1/1) ... [2025-03-04 10:13:14,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c3c26ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:14, skipping insertion in model container [2025-03-04 10:13:14,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:13:14" (1/1) ... [2025-03-04 10:13:14,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:13:15,010 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-04 10:13:15,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:13:15,020 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:13:15,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:13:15,058 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:13:15,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:15 WrapperNode [2025-03-04 10:13:15,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:13:15,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:13:15,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:13:15,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:13:15,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:15" (1/1) ... [2025-03-04 10:13:15,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:15" (1/1) ... [2025-03-04 10:13:15,092 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 23, calls inlined = 29, statements flattened = 317 [2025-03-04 10:13:15,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:13:15,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:13:15,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:13:15,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:13:15,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:15" (1/1) ... [2025-03-04 10:13:15,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:15" (1/1) ... [2025-03-04 10:13:15,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:15" (1/1) ... [2025-03-04 10:13:15,118 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 10:13:15,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:15" (1/1) ... [2025-03-04 10:13:15,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:15" (1/1) ... [2025-03-04 10:13:15,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:15" (1/1) ... [2025-03-04 10:13:15,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:15" (1/1) ... [2025-03-04 10:13:15,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:15" (1/1) ... [2025-03-04 10:13:15,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:15" (1/1) ... [2025-03-04 10:13:15,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:13:15,145 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:13:15,145 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:13:15,145 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:13:15,146 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:15" (1/1) ... [2025-03-04 10:13:15,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:13:15,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:15,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:13:15,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:13:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:13:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:13:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:13:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:13:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:13:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:13:15,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:13:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:13:15,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:13:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:13:15,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:13:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 10:13:15,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 10:13:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:13:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:13:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:13:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:13:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:13:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:13:15,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:13:15,191 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:13:15,283 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:13:15,285 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:13:15,682 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:13:15,682 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:13:15,952 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:13:15,953 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:13:15,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:13:15 BoogieIcfgContainer [2025-03-04 10:13:15,953 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:13:15,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:13:15,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:13:15,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:13:15,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:13:14" (1/3) ... [2025-03-04 10:13:15,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f13737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:13:15, skipping insertion in model container [2025-03-04 10:13:15,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:13:15" (2/3) ... [2025-03-04 10:13:15,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f13737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:13:15, skipping insertion in model container [2025-03-04 10:13:15,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:13:15" (3/3) ... [2025-03-04 10:13:15,960 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2025-03-04 10:13:15,971 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:13:15,972 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series2.wvr.c that has 5 procedures, 69 locations, 1 initial locations, 7 loop locations, and 22 error locations. [2025-03-04 10:13:15,972 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:13:16,032 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 10:13:16,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 75 transitions, 178 flow [2025-03-04 10:13:16,078 INFO L124 PetriNetUnfolderBase]: 7/71 cut-off events. [2025-03-04 10:13:16,080 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:13:16,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 71 events. 7/71 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 194 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2025-03-04 10:13:16,086 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 75 transitions, 178 flow [2025-03-04 10:13:16,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 70 transitions, 164 flow [2025-03-04 10:13:16,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:13:16,101 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;@1cc2adad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:13:16,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-04 10:13:16,131 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:13:16,131 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:13:16,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:13:16,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:16,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:13:16,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:16,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:16,136 INFO L85 PathProgramCache]: Analyzing trace with hash 930982, now seen corresponding path program 1 times [2025-03-04 10:13:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:16,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686580001] [2025-03-04 10:13:16,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:16,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:13:16,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:13:16,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:16,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:16,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:16,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:16,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686580001] [2025-03-04 10:13:16,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686580001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:16,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:16,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:13:16,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342968657] [2025-03-04 10:13:16,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:16,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:13:16,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:16,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:13:16,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:13:16,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-04 10:13:16,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:16,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:16,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-04 10:13:16,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:18,640 INFO L124 PetriNetUnfolderBase]: 19650/26281 cut-off events. [2025-03-04 10:13:18,641 INFO L125 PetriNetUnfolderBase]: For 620/620 co-relation queries the response was YES. [2025-03-04 10:13:18,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53041 conditions, 26281 events. 19650/26281 cut-off events. For 620/620 co-relation queries the response was YES. Maximal size of possible extension queue 1505. Compared 162245 event pairs, 16460 based on Foata normal form. 1/16556 useless extension candidates. Maximal degree in co-relation 50128. Up to 25501 conditions per place. [2025-03-04 10:13:18,847 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 49 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2025-03-04 10:13:18,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 252 flow [2025-03-04 10:13:18,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:13:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:13:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-03-04 10:13:18,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-03-04 10:13:18,857 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 164 flow. Second operand 3 states and 108 transitions. [2025-03-04 10:13:18,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 252 flow [2025-03-04 10:13:18,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 236 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 10:13:18,994 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 138 flow [2025-03-04 10:13:18,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2025-03-04 10:13:18,999 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -13 predicate places. [2025-03-04 10:13:19,000 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 138 flow [2025-03-04 10:13:19,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:19,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:19,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:13:19,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:13:19,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:19,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:19,001 INFO L85 PathProgramCache]: Analyzing trace with hash 930983, now seen corresponding path program 1 times [2025-03-04 10:13:19,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:19,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725533232] [2025-03-04 10:13:19,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:19,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:19,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:13:19,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:13:19,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:19,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:19,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:19,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725533232] [2025-03-04 10:13:19,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725533232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:19,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:19,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:19,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417106566] [2025-03-04 10:13:19,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:19,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:19,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:19,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:19,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:19,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-04 10:13:19,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:19,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:19,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-04 10:13:19,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:20,634 INFO L124 PetriNetUnfolderBase]: 19651/26284 cut-off events. [2025-03-04 10:13:20,634 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-03-04 10:13:20,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52261 conditions, 26284 events. 19651/26284 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 1505. Compared 162336 event pairs, 16460 based on Foata normal form. 0/16555 useless extension candidates. Maximal degree in co-relation 52224. Up to 25514 conditions per place. [2025-03-04 10:13:20,757 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 53 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-03-04 10:13:20,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 258 flow [2025-03-04 10:13:20,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-03-04 10:13:20,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42 [2025-03-04 10:13:20,760 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 138 flow. Second operand 4 states and 126 transitions. [2025-03-04 10:13:20,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 258 flow [2025-03-04 10:13:20,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:20,762 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 161 flow [2025-03-04 10:13:20,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2025-03-04 10:13:20,764 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -10 predicate places. [2025-03-04 10:13:20,764 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 161 flow [2025-03-04 10:13:20,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:20,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:20,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:13:20,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:13:20,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:20,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:20,768 INFO L85 PathProgramCache]: Analyzing trace with hash 28862763, now seen corresponding path program 1 times [2025-03-04 10:13:20,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:20,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385048787] [2025-03-04 10:13:20,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:20,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:20,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:13:20,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:13:20,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:20,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:20,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:20,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385048787] [2025-03-04 10:13:20,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385048787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:20,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:20,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:20,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103055149] [2025-03-04 10:13:20,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:20,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:20,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:20,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:20,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:13:21,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-04 10:13:21,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:21,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:21,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-04 10:13:21,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:22,756 INFO L124 PetriNetUnfolderBase]: 19652/26287 cut-off events. [2025-03-04 10:13:22,756 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-03-04 10:13:22,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52278 conditions, 26287 events. 19652/26287 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 1505. Compared 162337 event pairs, 16460 based on Foata normal form. 0/16557 useless extension candidates. Maximal degree in co-relation 52253. Up to 25513 conditions per place. [2025-03-04 10:13:22,859 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 53 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2025-03-04 10:13:22,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 287 flow [2025-03-04 10:13:22,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:13:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:13:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2025-03-04 10:13:22,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3893333333333333 [2025-03-04 10:13:22,860 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 161 flow. Second operand 5 states and 146 transitions. [2025-03-04 10:13:22,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 287 flow [2025-03-04 10:13:22,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:22,862 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 195 flow [2025-03-04 10:13:22,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2025-03-04 10:13:22,862 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -5 predicate places. [2025-03-04 10:13:22,862 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 195 flow [2025-03-04 10:13:22,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:22,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:22,863 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:13:22,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:13:22,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:22,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:22,863 INFO L85 PathProgramCache]: Analyzing trace with hash 894703267, now seen corresponding path program 1 times [2025-03-04 10:13:22,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:22,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29001745] [2025-03-04 10:13:22,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:22,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:22,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:13:22,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:13:22,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:22,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:23,088 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-04 10:13:23,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:23,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29001745] [2025-03-04 10:13:23,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29001745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:23,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100399030] [2025-03-04 10:13:23,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:23,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:23,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:23,092 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:23,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:13:23,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:13:23,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:13:23,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:23,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:23,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:13:23,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:23,221 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-04 10:13:23,375 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-04 10:13:23,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:23,450 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-04 10:13:23,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100399030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:23,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:23,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:13:23,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791825168] [2025-03-04 10:13:23,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:23,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:13:23,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:23,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:13:23,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:13:23,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-04 10:13:23,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 195 flow. Second operand has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:23,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:23,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-04 10:13:23,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:24,844 INFO L124 PetriNetUnfolderBase]: 19653/26289 cut-off events. [2025-03-04 10:13:24,844 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-04 10:13:24,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52301 conditions, 26289 events. 19653/26289 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 1505. Compared 162360 event pairs, 16460 based on Foata normal form. 0/16562 useless extension candidates. Maximal degree in co-relation 52263. Up to 25514 conditions per place. [2025-03-04 10:13:24,945 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 52 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2025-03-04 10:13:24,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 71 transitions, 330 flow [2025-03-04 10:13:24,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:13:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:13:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2025-03-04 10:13:24,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3283333333333333 [2025-03-04 10:13:24,947 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 195 flow. Second operand 8 states and 197 transitions. [2025-03-04 10:13:24,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 71 transitions, 330 flow [2025-03-04 10:13:24,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 71 transitions, 329 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:24,948 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 225 flow [2025-03-04 10:13:24,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=225, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2025-03-04 10:13:24,949 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 0 predicate places. [2025-03-04 10:13:24,949 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 225 flow [2025-03-04 10:13:24,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:24,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:24,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:13:24,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:13:25,151 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-04 10:13:25,151 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:25,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:25,151 INFO L85 PathProgramCache]: Analyzing trace with hash 894746212, now seen corresponding path program 1 times [2025-03-04 10:13:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:25,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124268062] [2025-03-04 10:13:25,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:25,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:25,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:13:25,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:13:25,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:25,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:25,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:25,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124268062] [2025-03-04 10:13:25,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124268062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:25,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:25,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:25,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068833387] [2025-03-04 10:13:25,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:25,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:25,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:25,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:25,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:13:25,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-04 10:13:25,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:25,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:25,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-04 10:13:25,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:26,404 INFO L124 PetriNetUnfolderBase]: 19654/26292 cut-off events. [2025-03-04 10:13:26,404 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-04 10:13:26,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52317 conditions, 26292 events. 19654/26292 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 1505. Compared 162324 event pairs, 16460 based on Foata normal form. 0/16564 useless extension candidates. Maximal degree in co-relation 52271. Up to 25518 conditions per place. [2025-03-04 10:13:26,535 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 56 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2025-03-04 10:13:26,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 361 flow [2025-03-04 10:13:26,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:13:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:13:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2025-03-04 10:13:26,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2025-03-04 10:13:26,536 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 225 flow. Second operand 5 states and 145 transitions. [2025-03-04 10:13:26,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 361 flow [2025-03-04 10:13:26,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 74 transitions, 314 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-04 10:13:26,538 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 221 flow [2025-03-04 10:13:26,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2025-03-04 10:13:26,539 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, -2 predicate places. [2025-03-04 10:13:26,539 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 221 flow [2025-03-04 10:13:26,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:26,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:26,539 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 10:13:26,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:13:26,539 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:26,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:26,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1967341347, now seen corresponding path program 1 times [2025-03-04 10:13:26,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:26,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870772920] [2025-03-04 10:13:26,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:26,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:26,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:13:26,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:13:26,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:26,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:26,709 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-04 10:13:26,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:26,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870772920] [2025-03-04 10:13:26,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870772920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:26,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269303779] [2025-03-04 10:13:26,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:26,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:26,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:26,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:26,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:13:26,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:13:26,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:13:26,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:26,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:26,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:13:26,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:26,782 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-04 10:13:26,974 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-04 10:13:26,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:27,104 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-04 10:13:27,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269303779] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:27,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:27,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:13:27,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485091295] [2025-03-04 10:13:27,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:27,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:13:27,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:27,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:13:27,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:13:27,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-04 10:13:27,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 221 flow. Second operand has 13 states, 13 states have (on average 18.307692307692307) internal successors, (238), 13 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:27,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:27,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-04 10:13:27,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:29,017 INFO L124 PetriNetUnfolderBase]: 19655/26294 cut-off events. [2025-03-04 10:13:29,017 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-03-04 10:13:29,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52319 conditions, 26294 events. 19655/26294 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 1505. Compared 162508 event pairs, 16460 based on Foata normal form. 0/16569 useless extension candidates. Maximal degree in co-relation 52267. Up to 25509 conditions per place. [2025-03-04 10:13:29,158 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 49 selfloop transitions, 18 changer transitions 0/76 dead transitions. [2025-03-04 10:13:29,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 76 transitions, 366 flow [2025-03-04 10:13:29,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:13:29,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:13:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2025-03-04 10:13:29,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3244444444444444 [2025-03-04 10:13:29,160 INFO L175 Difference]: Start difference. First operand has 74 places, 74 transitions, 221 flow. Second operand 9 states and 219 transitions. [2025-03-04 10:13:29,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 76 transitions, 366 flow [2025-03-04 10:13:29,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 76 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:29,162 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 260 flow [2025-03-04 10:13:29,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=260, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2025-03-04 10:13:29,162 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 3 predicate places. [2025-03-04 10:13:29,162 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 260 flow [2025-03-04 10:13:29,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.307692307692307) internal successors, (238), 13 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:29,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:29,163 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 10:13:29,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:13:29,367 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-04 10:13:29,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:29,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:29,367 INFO L85 PathProgramCache]: Analyzing trace with hash 857678836, now seen corresponding path program 1 times [2025-03-04 10:13:29,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:29,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502768307] [2025-03-04 10:13:29,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:29,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:29,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:13:29,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:13:29,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:29,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:29,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:29,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502768307] [2025-03-04 10:13:29,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502768307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:29,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951214250] [2025-03-04 10:13:29,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:29,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:29,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:29,522 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:29,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:13:29,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:13:29,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:13:29,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:29,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:29,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:13:29,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:29,610 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-04 10:13:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:29,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:29,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951214250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:29,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:29,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:13:29,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434806068] [2025-03-04 10:13:29,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:29,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:13:29,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:29,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:13:29,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:13:29,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-04 10:13:29,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 260 flow. Second operand has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:29,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:29,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-04 10:13:29,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:31,135 INFO L124 PetriNetUnfolderBase]: 19655/26293 cut-off events. [2025-03-04 10:13:31,135 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-03-04 10:13:31,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52330 conditions, 26293 events. 19655/26293 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 1505. Compared 162280 event pairs, 16460 based on Foata normal form. 0/16569 useless extension candidates. Maximal degree in co-relation 52275. Up to 25510 conditions per place. [2025-03-04 10:13:31,298 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 47 selfloop transitions, 19 changer transitions 0/75 dead transitions. [2025-03-04 10:13:31,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 75 transitions, 388 flow [2025-03-04 10:13:31,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:13:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:13:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2025-03-04 10:13:31,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33714285714285713 [2025-03-04 10:13:31,299 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 260 flow. Second operand 7 states and 177 transitions. [2025-03-04 10:13:31,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 75 transitions, 388 flow [2025-03-04 10:13:31,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 355 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-04 10:13:31,301 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 261 flow [2025-03-04 10:13:31,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-03-04 10:13:31,301 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 3 predicate places. [2025-03-04 10:13:31,301 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 261 flow [2025-03-04 10:13:31,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:31,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:31,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:31,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:31,506 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-04 10:13:31,506 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:31,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:31,506 INFO L85 PathProgramCache]: Analyzing trace with hash -325907781, now seen corresponding path program 1 times [2025-03-04 10:13:31,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:31,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876127833] [2025-03-04 10:13:31,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:31,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:13:31,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:13:31,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:31,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:31,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:31,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876127833] [2025-03-04 10:13:31,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876127833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:31,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:31,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:31,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109211201] [2025-03-04 10:13:31,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:31,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:31,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:31,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:31,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:31,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-03-04 10:13:31,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:31,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:31,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-03-04 10:13:31,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:32,849 INFO L124 PetriNetUnfolderBase]: 22948/30974 cut-off events. [2025-03-04 10:13:32,850 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-03-04 10:13:32,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61676 conditions, 30974 events. 22948/30974 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 1711. Compared 195733 event pairs, 19427 based on Foata normal form. 719/20987 useless extension candidates. Maximal degree in co-relation 52285. Up to 25522 conditions per place. [2025-03-04 10:13:33,011 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 104 selfloop transitions, 8 changer transitions 0/121 dead transitions. [2025-03-04 10:13:33,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 121 transitions, 641 flow [2025-03-04 10:13:33,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:13:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:13:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2025-03-04 10:13:33,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2025-03-04 10:13:33,012 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 261 flow. Second operand 5 states and 205 transitions. [2025-03-04 10:13:33,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 121 transitions, 641 flow [2025-03-04 10:13:33,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 121 transitions, 577 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 10:13:33,014 INFO L231 Difference]: Finished difference. Result has 79 places, 80 transitions, 296 flow [2025-03-04 10:13:33,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=79, PETRI_TRANSITIONS=80} [2025-03-04 10:13:33,015 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 3 predicate places. [2025-03-04 10:13:33,015 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 80 transitions, 296 flow [2025-03-04 10:13:33,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:33,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:33,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:33,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:13:33,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:33,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:33,016 INFO L85 PathProgramCache]: Analyzing trace with hash -959545417, now seen corresponding path program 1 times [2025-03-04 10:13:33,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:33,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416605363] [2025-03-04 10:13:33,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:33,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:33,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:13:33,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:13:33,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:33,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:33,125 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-04 10:13:33,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:33,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416605363] [2025-03-04 10:13:33,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416605363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:33,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:33,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:33,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408325998] [2025-03-04 10:13:33,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:33,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:33,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:33,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:33,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:33,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-04 10:13:33,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 80 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:33,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:33,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-04 10:13:33,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:34,135 INFO L124 PetriNetUnfolderBase]: 17766/24056 cut-off events. [2025-03-04 10:13:34,135 INFO L125 PetriNetUnfolderBase]: For 1550/1550 co-relation queries the response was YES. [2025-03-04 10:13:34,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51909 conditions, 24056 events. 17766/24056 cut-off events. For 1550/1550 co-relation queries the response was YES. Maximal size of possible extension queue 1283. Compared 148827 event pairs, 14876 based on Foata normal form. 0/16687 useless extension candidates. Maximal degree in co-relation 42544. Up to 23314 conditions per place. [2025-03-04 10:13:34,225 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 62 selfloop transitions, 7 changer transitions 0/78 dead transitions. [2025-03-04 10:13:34,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 426 flow [2025-03-04 10:13:34,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:13:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:13:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-03-04 10:13:34,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3626666666666667 [2025-03-04 10:13:34,226 INFO L175 Difference]: Start difference. First operand has 79 places, 80 transitions, 296 flow. Second operand 5 states and 136 transitions. [2025-03-04 10:13:34,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 426 flow [2025-03-04 10:13:34,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 78 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:34,235 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 297 flow [2025-03-04 10:13:34,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2025-03-04 10:13:34,235 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 3 predicate places. [2025-03-04 10:13:34,235 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 297 flow [2025-03-04 10:13:34,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:34,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:34,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:34,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:13:34,236 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:34,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash -959545415, now seen corresponding path program 1 times [2025-03-04 10:13:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:34,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109390978] [2025-03-04 10:13:34,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:34,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:13:34,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:13:34,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:34,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:34,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:34,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109390978] [2025-03-04 10:13:34,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109390978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:34,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:34,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:34,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632418542] [2025-03-04 10:13:34,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:34,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:34,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:34,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:34,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-04 10:13:34,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 297 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:34,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:34,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-04 10:13:34,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:35,041 INFO L124 PetriNetUnfolderBase]: 13852/18794 cut-off events. [2025-03-04 10:13:35,041 INFO L125 PetriNetUnfolderBase]: For 1263/1263 co-relation queries the response was YES. [2025-03-04 10:13:35,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40254 conditions, 18794 events. 13852/18794 cut-off events. For 1263/1263 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 112197 event pairs, 11474 based on Foata normal form. 0/13696 useless extension candidates. Maximal degree in co-relation 31972. Up to 18210 conditions per place. [2025-03-04 10:13:35,140 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 63 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-03-04 10:13:35,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 425 flow [2025-03-04 10:13:35,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-04 10:13:35,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39 [2025-03-04 10:13:35,141 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 297 flow. Second operand 4 states and 117 transitions. [2025-03-04 10:13:35,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 425 flow [2025-03-04 10:13:35,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 76 transitions, 414 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:13:35,146 INFO L231 Difference]: Finished difference. Result has 77 places, 76 transitions, 288 flow [2025-03-04 10:13:35,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=77, PETRI_TRANSITIONS=76} [2025-03-04 10:13:35,147 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 1 predicate places. [2025-03-04 10:13:35,147 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 76 transitions, 288 flow [2025-03-04 10:13:35,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:35,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:35,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:35,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:13:35,147 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:35,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:35,147 INFO L85 PathProgramCache]: Analyzing trace with hash -24663497, now seen corresponding path program 1 times [2025-03-04 10:13:35,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:35,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114893741] [2025-03-04 10:13:35,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:35,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:35,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:13:35,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:13:35,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:35,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:35,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:35,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114893741] [2025-03-04 10:13:35,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114893741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:35,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:35,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:35,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028066263] [2025-03-04 10:13:35,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:35,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:35,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:35,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:35,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:35,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-03-04 10:13:35,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 76 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:35,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:35,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-03-04 10:13:35,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:36,210 INFO L124 PetriNetUnfolderBase]: 16625/22927 cut-off events. [2025-03-04 10:13:36,210 INFO L125 PetriNetUnfolderBase]: For 1511/1511 co-relation queries the response was YES. [2025-03-04 10:13:36,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49158 conditions, 22927 events. 16625/22927 cut-off events. For 1511/1511 co-relation queries the response was YES. Maximal size of possible extension queue 1042. Compared 142011 event pairs, 13961 based on Foata normal form. 496/18253 useless extension candidates. Maximal degree in co-relation 31974. Up to 18240 conditions per place. [2025-03-04 10:13:36,323 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 97 selfloop transitions, 6 changer transitions 0/112 dead transitions. [2025-03-04 10:13:36,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 112 transitions, 618 flow [2025-03-04 10:13:36,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2025-03-04 10:13:36,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-03-04 10:13:36,324 INFO L175 Difference]: Start difference. First operand has 77 places, 76 transitions, 288 flow. Second operand 4 states and 168 transitions. [2025-03-04 10:13:36,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 112 transitions, 618 flow [2025-03-04 10:13:36,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 112 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:36,326 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 310 flow [2025-03-04 10:13:36,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2025-03-04 10:13:36,327 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 3 predicate places. [2025-03-04 10:13:36,327 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 310 flow [2025-03-04 10:13:36,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:36,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:36,327 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:36,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:13:36,327 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:36,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:36,327 INFO L85 PathProgramCache]: Analyzing trace with hash -959545416, now seen corresponding path program 1 times [2025-03-04 10:13:36,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:36,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493352586] [2025-03-04 10:13:36,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:36,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:36,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:13:36,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:13:36,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:36,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:36,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:36,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493352586] [2025-03-04 10:13:36,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493352586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:36,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169348921] [2025-03-04 10:13:36,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:36,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:36,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:36,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:36,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:13:36,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:13:36,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:13:36,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:36,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:36,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:13:36,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:36,606 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-04 10:13:36,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:36,655 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 18 treesize of output 13 [2025-03-04 10:13:36,679 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 10:13:36,679 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-04 10:13:36,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:36,703 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 18 treesize of output 13 [2025-03-04 10:13:36,709 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:13:36,710 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-04 10:13:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:36,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:13:36,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169348921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:36,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:13:36,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2025-03-04 10:13:36,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089926308] [2025-03-04 10:13:36,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:36,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:13:36,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:36,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:13:36,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:13:36,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-04 10:13:36,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:36,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:36,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-04 10:13:36,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:37,658 INFO L124 PetriNetUnfolderBase]: 12389/17187 cut-off events. [2025-03-04 10:13:37,658 INFO L125 PetriNetUnfolderBase]: For 2201/2201 co-relation queries the response was YES. [2025-03-04 10:13:37,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39229 conditions, 17187 events. 12389/17187 cut-off events. For 2201/2201 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 103941 event pairs, 10265 based on Foata normal form. 0/14008 useless extension candidates. Maximal degree in co-relation 23393. Up to 16596 conditions per place. [2025-03-04 10:13:37,706 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 61 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-03-04 10:13:37,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 432 flow [2025-03-04 10:13:37,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-03-04 10:13:37,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2025-03-04 10:13:37,707 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 310 flow. Second operand 4 states and 115 transitions. [2025-03-04 10:13:37,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 432 flow [2025-03-04 10:13:37,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 427 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:37,709 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 305 flow [2025-03-04 10:13:37,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=305, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2025-03-04 10:13:37,710 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 3 predicate places. [2025-03-04 10:13:37,710 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 305 flow [2025-03-04 10:13:37,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:37,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:37,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:37,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:37,911 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-04 10:13:37,911 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:37,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:37,911 INFO L85 PathProgramCache]: Analyzing trace with hash -959545414, now seen corresponding path program 1 times [2025-03-04 10:13:37,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:37,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249546341] [2025-03-04 10:13:37,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:37,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:37,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:13:37,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:13:37,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:37,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:38,023 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-04 10:13:38,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249546341] [2025-03-04 10:13:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249546341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:38,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:38,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:13:38,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189534134] [2025-03-04 10:13:38,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:38,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:13:38,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:38,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:13:38,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:13:38,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 75 [2025-03-04 10:13:38,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 305 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:38,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:38,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 75 [2025-03-04 10:13:38,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:39,448 INFO L124 PetriNetUnfolderBase]: 23723/32815 cut-off events. [2025-03-04 10:13:39,448 INFO L125 PetriNetUnfolderBase]: For 3484/3484 co-relation queries the response was YES. [2025-03-04 10:13:39,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74329 conditions, 32815 events. 23723/32815 cut-off events. For 3484/3484 co-relation queries the response was YES. Maximal size of possible extension queue 1518. Compared 214231 event pairs, 14289 based on Foata normal form. 0/26446 useless extension candidates. Maximal degree in co-relation 48942. Up to 20274 conditions per place. [2025-03-04 10:13:39,639 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 111 selfloop transitions, 11 changer transitions 0/130 dead transitions. [2025-03-04 10:13:39,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 130 transitions, 704 flow [2025-03-04 10:13:39,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:13:39,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:13:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2025-03-04 10:13:39,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2025-03-04 10:13:39,640 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 305 flow. Second operand 6 states and 220 transitions. [2025-03-04 10:13:39,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 130 transitions, 704 flow [2025-03-04 10:13:39,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 130 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:39,645 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 332 flow [2025-03-04 10:13:39,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2025-03-04 10:13:39,646 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 8 predicate places. [2025-03-04 10:13:39,646 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 332 flow [2025-03-04 10:13:39,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:39,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:39,646 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:39,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:13:39,646 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:39,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:39,647 INFO L85 PathProgramCache]: Analyzing trace with hash -977121718, now seen corresponding path program 1 times [2025-03-04 10:13:39,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:39,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654064973] [2025-03-04 10:13:39,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:39,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:39,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:13:39,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:13:39,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:39,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:39,755 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-04 10:13:39,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:39,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654064973] [2025-03-04 10:13:39,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654064973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:39,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489146628] [2025-03-04 10:13:39,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:39,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:39,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:39,758 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-04 10:13:39,759 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-04 10:13:39,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:13:39,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:13:39,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:39,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:39,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:13:39,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:39,886 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-04 10:13:39,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:39,932 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-04 10:13:39,969 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-04 10:13:39,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489146628] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:39,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:39,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 10:13:39,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117354285] [2025-03-04 10:13:39,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:39,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:13:39,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:39,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:13:39,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:13:40,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-03-04 10:13:40,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 75 transitions, 332 flow. Second operand has 12 states, 12 states have (on average 22.083333333333332) internal successors, (265), 12 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:40,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:40,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-03-04 10:13:40,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:42,300 INFO L124 PetriNetUnfolderBase]: 24912/34917 cut-off events. [2025-03-04 10:13:42,300 INFO L125 PetriNetUnfolderBase]: For 7851/7851 co-relation queries the response was YES. [2025-03-04 10:13:42,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82230 conditions, 34917 events. 24912/34917 cut-off events. For 7851/7851 co-relation queries the response was YES. Maximal size of possible extension queue 1391. Compared 230089 event pairs, 14858 based on Foata normal form. 0/29376 useless extension candidates. Maximal degree in co-relation 58982. Up to 11711 conditions per place. [2025-03-04 10:13:42,537 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 112 selfloop transitions, 16 changer transitions 0/137 dead transitions. [2025-03-04 10:13:42,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 137 transitions, 761 flow [2025-03-04 10:13:42,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:13:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:13:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 238 transitions. [2025-03-04 10:13:42,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5288888888888889 [2025-03-04 10:13:42,538 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 332 flow. Second operand 6 states and 238 transitions. [2025-03-04 10:13:42,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 137 transitions, 761 flow [2025-03-04 10:13:42,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 137 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:42,553 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 365 flow [2025-03-04 10:13:42,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=365, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-03-04 10:13:42,554 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 12 predicate places. [2025-03-04 10:13:42,554 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 365 flow [2025-03-04 10:13:42,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.083333333333332) internal successors, (265), 12 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:42,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:42,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:42,560 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-04 10:13:42,754 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,SelfDestructingSolverStorable13 [2025-03-04 10:13:42,754 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:42,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:42,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1479978303, now seen corresponding path program 1 times [2025-03-04 10:13:42,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:42,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063272426] [2025-03-04 10:13:42,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:42,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:42,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:13:42,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:13:42,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:42,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:42,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:42,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063272426] [2025-03-04 10:13:42,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063272426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:42,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:42,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:13:42,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050138455] [2025-03-04 10:13:42,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:42,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:13:42,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:42,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:13:42,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:13:42,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 75 [2025-03-04 10:13:42,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 365 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:42,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:42,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 75 [2025-03-04 10:13:42,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:45,267 INFO L124 PetriNetUnfolderBase]: 35130/47683 cut-off events. [2025-03-04 10:13:45,267 INFO L125 PetriNetUnfolderBase]: For 13211/13211 co-relation queries the response was YES. [2025-03-04 10:13:45,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116496 conditions, 47683 events. 35130/47683 cut-off events. For 13211/13211 co-relation queries the response was YES. Maximal size of possible extension queue 1591. Compared 300948 event pairs, 12682 based on Foata normal form. 0/38749 useless extension candidates. Maximal degree in co-relation 89467. Up to 18368 conditions per place. [2025-03-04 10:13:45,843 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 174 selfloop transitions, 14 changer transitions 0/196 dead transitions. [2025-03-04 10:13:45,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 196 transitions, 1101 flow [2025-03-04 10:13:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:13:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:13:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 320 transitions. [2025-03-04 10:13:45,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 10:13:45,844 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 365 flow. Second operand 8 states and 320 transitions. [2025-03-04 10:13:45,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 196 transitions, 1101 flow [2025-03-04 10:13:45,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 196 transitions, 1070 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:13:45,861 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 397 flow [2025-03-04 10:13:45,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=397, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2025-03-04 10:13:45,861 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 19 predicate places. [2025-03-04 10:13:45,861 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 397 flow [2025-03-04 10:13:45,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:45,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:45,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:45,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:13:45,862 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:45,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:45,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1034814671, now seen corresponding path program 1 times [2025-03-04 10:13:45,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:45,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828804569] [2025-03-04 10:13:45,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:45,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:45,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:13:45,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:13:45,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:45,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:45,996 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-04 10:13:45,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:45,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828804569] [2025-03-04 10:13:45,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828804569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:45,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32193660] [2025-03-04 10:13:45,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:45,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:45,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:45,999 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-04 10:13:46,000 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-04 10:13:46,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:13:46,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:13:46,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:46,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:46,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:13:46,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:46,129 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-04 10:13:46,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:46,170 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-04 10:13:46,197 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-04 10:13:46,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32193660] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:46,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:46,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 10:13:46,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216513979] [2025-03-04 10:13:46,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:46,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:13:46,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:46,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:13:46,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:13:46,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-03-04 10:13:46,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 397 flow. Second operand has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:46,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:46,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-03-04 10:13:46,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:48,883 INFO L124 PetriNetUnfolderBase]: 28364/39714 cut-off events. [2025-03-04 10:13:48,884 INFO L125 PetriNetUnfolderBase]: For 18985/18985 co-relation queries the response was YES. [2025-03-04 10:13:48,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102731 conditions, 39714 events. 28364/39714 cut-off events. For 18985/18985 co-relation queries the response was YES. Maximal size of possible extension queue 1338. Compared 260234 event pairs, 14095 based on Foata normal form. 0/34785 useless extension candidates. Maximal degree in co-relation 77742. Up to 16148 conditions per place. [2025-03-04 10:13:49,062 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 127 selfloop transitions, 18 changer transitions 0/154 dead transitions. [2025-03-04 10:13:49,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 154 transitions, 908 flow [2025-03-04 10:13:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:13:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:13:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 272 transitions. [2025-03-04 10:13:49,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.518095238095238 [2025-03-04 10:13:49,064 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 397 flow. Second operand 7 states and 272 transitions. [2025-03-04 10:13:49,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 154 transitions, 908 flow [2025-03-04 10:13:49,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 154 transitions, 899 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:49,089 INFO L231 Difference]: Finished difference. Result has 102 places, 82 transitions, 444 flow [2025-03-04 10:13:49,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=444, PETRI_PLACES=102, PETRI_TRANSITIONS=82} [2025-03-04 10:13:49,090 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 26 predicate places. [2025-03-04 10:13:49,090 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 82 transitions, 444 flow [2025-03-04 10:13:49,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.583333333333332) internal successors, (271), 12 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:49,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:49,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:49,097 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-04 10:13:49,291 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,SelfDestructingSolverStorable15 [2025-03-04 10:13:49,291 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:49,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:49,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1034814672, now seen corresponding path program 1 times [2025-03-04 10:13:49,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:49,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891143606] [2025-03-04 10:13:49,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:49,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:49,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:13:49,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:13:49,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:49,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:13:49,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:49,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891143606] [2025-03-04 10:13:49,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891143606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:49,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:49,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:13:49,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084668869] [2025-03-04 10:13:49,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:49,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:49,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:49,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:49,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:13:49,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-04 10:13:49,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 82 transitions, 444 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:49,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:49,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-04 10:13:49,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:51,635 INFO L124 PetriNetUnfolderBase]: 24520/34654 cut-off events. [2025-03-04 10:13:51,636 INFO L125 PetriNetUnfolderBase]: For 26062/26062 co-relation queries the response was YES. [2025-03-04 10:13:51,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93394 conditions, 34654 events. 24520/34654 cut-off events. For 26062/26062 co-relation queries the response was YES. Maximal size of possible extension queue 1163. Compared 228711 event pairs, 20889 based on Foata normal form. 0/31753 useless extension candidates. Maximal degree in co-relation 70278. Up to 33029 conditions per place. [2025-03-04 10:13:51,838 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 62 selfloop transitions, 9 changer transitions 0/80 dead transitions. [2025-03-04 10:13:51,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 80 transitions, 573 flow [2025-03-04 10:13:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:13:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:13:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-04 10:13:51,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3466666666666667 [2025-03-04 10:13:51,839 INFO L175 Difference]: Start difference. First operand has 102 places, 82 transitions, 444 flow. Second operand 5 states and 130 transitions. [2025-03-04 10:13:51,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 80 transitions, 573 flow [2025-03-04 10:13:51,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 80 transitions, 547 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:51,877 INFO L231 Difference]: Finished difference. Result has 103 places, 80 transitions, 423 flow [2025-03-04 10:13:51,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=423, PETRI_PLACES=103, PETRI_TRANSITIONS=80} [2025-03-04 10:13:51,878 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 27 predicate places. [2025-03-04 10:13:51,878 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 80 transitions, 423 flow [2025-03-04 10:13:51,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:51,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:51,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:51,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:13:51,878 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:51,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:51,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1034814673, now seen corresponding path program 1 times [2025-03-04 10:13:51,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:51,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705082910] [2025-03-04 10:13:51,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:51,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:51,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:13:51,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:13:51,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:51,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:52,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:52,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705082910] [2025-03-04 10:13:52,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705082910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:52,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:52,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:13:52,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165010987] [2025-03-04 10:13:52,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:52,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:52,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:52,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:52,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:13:52,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2025-03-04 10:13:52,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 80 transitions, 423 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:52,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:52,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2025-03-04 10:13:52,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:53,915 INFO L124 PetriNetUnfolderBase]: 18268/26190 cut-off events. [2025-03-04 10:13:53,915 INFO L125 PetriNetUnfolderBase]: For 21945/21945 co-relation queries the response was YES. [2025-03-04 10:13:53,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69087 conditions, 26190 events. 18268/26190 cut-off events. For 21945/21945 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 170832 event pairs, 15422 based on Foata normal form. 1031/25696 useless extension candidates. Maximal degree in co-relation 51497. Up to 24812 conditions per place. [2025-03-04 10:13:54,078 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 60 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2025-03-04 10:13:54,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 77 transitions, 542 flow [2025-03-04 10:13:54,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-04 10:13:54,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2025-03-04 10:13:54,079 INFO L175 Difference]: Start difference. First operand has 103 places, 80 transitions, 423 flow. Second operand 4 states and 112 transitions. [2025-03-04 10:13:54,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 77 transitions, 542 flow [2025-03-04 10:13:54,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 77 transitions, 523 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:13:54,100 INFO L231 Difference]: Finished difference. Result has 98 places, 77 transitions, 403 flow [2025-03-04 10:13:54,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=403, PETRI_PLACES=98, PETRI_TRANSITIONS=77} [2025-03-04 10:13:54,101 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 22 predicate places. [2025-03-04 10:13:54,101 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 77 transitions, 403 flow [2025-03-04 10:13:54,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:54,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:54,101 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:54,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:13:54,101 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:54,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1856175475, now seen corresponding path program 1 times [2025-03-04 10:13:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:54,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418849057] [2025-03-04 10:13:54,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:54,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:13:54,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:13:54,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:54,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:54,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:54,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418849057] [2025-03-04 10:13:54,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418849057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:54,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495534195] [2025-03-04 10:13:54,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:54,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:54,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:54,172 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-04 10:13:54,174 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-04 10:13:54,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:13:54,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:13:54,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:54,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:54,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:13:54,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:54,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:54,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495534195] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:54,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:54,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 10:13:54,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236467520] [2025-03-04 10:13:54,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:54,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:13:54,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:54,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:13:54,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:13:54,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-03-04 10:13:54,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 77 transitions, 403 flow. Second operand has 12 states, 12 states have (on average 22.25) internal successors, (267), 12 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:54,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:54,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-03-04 10:13:54,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:57,620 INFO L124 PetriNetUnfolderBase]: 33284/47654 cut-off events. [2025-03-04 10:13:57,620 INFO L125 PetriNetUnfolderBase]: For 32526/32526 co-relation queries the response was YES. [2025-03-04 10:13:57,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123427 conditions, 47654 events. 33284/47654 cut-off events. For 32526/32526 co-relation queries the response was YES. Maximal size of possible extension queue 1616. Compared 332524 event pairs, 19897 based on Foata normal form. 780/46343 useless extension candidates. Maximal degree in co-relation 59439. Up to 18317 conditions per place. [2025-03-04 10:13:57,886 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 155 selfloop transitions, 44 changer transitions 0/208 dead transitions. [2025-03-04 10:13:57,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 208 transitions, 1361 flow [2025-03-04 10:13:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:13:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:13:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 405 transitions. [2025-03-04 10:13:57,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-04 10:13:57,887 INFO L175 Difference]: Start difference. First operand has 98 places, 77 transitions, 403 flow. Second operand 12 states and 405 transitions. [2025-03-04 10:13:57,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 208 transitions, 1361 flow [2025-03-04 10:13:57,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 208 transitions, 1346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:57,910 INFO L231 Difference]: Finished difference. Result has 112 places, 103 transitions, 718 flow [2025-03-04 10:13:57,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=718, PETRI_PLACES=112, PETRI_TRANSITIONS=103} [2025-03-04 10:13:57,911 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 36 predicate places. [2025-03-04 10:13:57,911 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 103 transitions, 718 flow [2025-03-04 10:13:57,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.25) internal successors, (267), 12 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:57,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:57,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:57,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:58,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:58,112 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:13:58,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1564606592, now seen corresponding path program 1 times [2025-03-04 10:13:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:58,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533563357] [2025-03-04 10:13:58,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:58,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:58,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:13:58,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:13:58,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:58,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:58,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:58,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533563357] [2025-03-04 10:13:58,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533563357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:58,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:58,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:13:58,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924580429] [2025-03-04 10:13:58,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:58,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:13:58,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:58,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:13:58,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:13:58,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-03-04 10:13:58,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 103 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:58,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:58,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-03-04 10:13:58,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:00,880 INFO L124 PetriNetUnfolderBase]: 27828/40220 cut-off events. [2025-03-04 10:14:00,881 INFO L125 PetriNetUnfolderBase]: For 37248/37248 co-relation queries the response was YES. [2025-03-04 10:14:00,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108511 conditions, 40220 events. 27828/40220 cut-off events. For 37248/37248 co-relation queries the response was YES. Maximal size of possible extension queue 1315. Compared 275030 event pairs, 14824 based on Foata normal form. 559/39445 useless extension candidates. Maximal degree in co-relation 53341. Up to 21584 conditions per place. [2025-03-04 10:14:01,130 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 116 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2025-03-04 10:14:01,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 127 transitions, 1048 flow [2025-03-04 10:14:01,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:14:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:14:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-03-04 10:14:01,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5644444444444444 [2025-03-04 10:14:01,131 INFO L175 Difference]: Start difference. First operand has 112 places, 103 transitions, 718 flow. Second operand 3 states and 127 transitions. [2025-03-04 10:14:01,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 127 transitions, 1048 flow [2025-03-04 10:14:01,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 127 transitions, 1013 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-03-04 10:14:01,150 INFO L231 Difference]: Finished difference. Result has 112 places, 103 transitions, 697 flow [2025-03-04 10:14:01,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=112, PETRI_TRANSITIONS=103} [2025-03-04 10:14:01,150 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 36 predicate places. [2025-03-04 10:14:01,150 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 103 transitions, 697 flow [2025-03-04 10:14:01,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:01,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:01,151 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:01,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:14:01,151 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:14:01,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:01,151 INFO L85 PathProgramCache]: Analyzing trace with hash -167430921, now seen corresponding path program 2 times [2025-03-04 10:14:01,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:01,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386453522] [2025-03-04 10:14:01,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:01,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:01,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:14:01,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:14:01,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:01,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:14:01,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:01,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386453522] [2025-03-04 10:14:01,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386453522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:01,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007015826] [2025-03-04 10:14:01,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:01,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:01,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:01,293 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:01,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:14:01,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:14:01,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:14:01,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:01,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:01,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:14:01,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:14:01,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:14:01,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007015826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:01,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:01,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 10:14:01,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776664031] [2025-03-04 10:14:01,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:01,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:14:01,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:01,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:14:01,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:14:01,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 75 [2025-03-04 10:14:01,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 103 transitions, 697 flow. Second operand has 16 states, 16 states have (on average 20.9375) internal successors, (335), 16 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-04 10:14:01,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:01,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 75 [2025-03-04 10:14:01,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:08,037 INFO L124 PetriNetUnfolderBase]: 59215/83407 cut-off events. [2025-03-04 10:14:08,037 INFO L125 PetriNetUnfolderBase]: For 77863/77863 co-relation queries the response was YES. [2025-03-04 10:14:08,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230265 conditions, 83407 events. 59215/83407 cut-off events. For 77863/77863 co-relation queries the response was YES. Maximal size of possible extension queue 2594. Compared 603990 event pairs, 27196 based on Foata normal form. 816/82167 useless extension candidates. Maximal degree in co-relation 192174. Up to 26734 conditions per place. [2025-03-04 10:14:08,571 INFO L140 encePairwiseOnDemand]: 61/75 looper letters, 218 selfloop transitions, 57 changer transitions 0/283 dead transitions. [2025-03-04 10:14:08,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 283 transitions, 1919 flow [2025-03-04 10:14:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:14:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:14:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 457 transitions. [2025-03-04 10:14:08,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4687179487179487 [2025-03-04 10:14:08,573 INFO L175 Difference]: Start difference. First operand has 112 places, 103 transitions, 697 flow. Second operand 13 states and 457 transitions. [2025-03-04 10:14:08,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 283 transitions, 1919 flow [2025-03-04 10:14:08,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 283 transitions, 1905 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:08,635 INFO L231 Difference]: Finished difference. Result has 127 places, 115 transitions, 966 flow [2025-03-04 10:14:08,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=966, PETRI_PLACES=127, PETRI_TRANSITIONS=115} [2025-03-04 10:14:08,636 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 51 predicate places. [2025-03-04 10:14:08,636 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 115 transitions, 966 flow [2025-03-04 10:14:08,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 20.9375) internal successors, (335), 16 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-04 10:14:08,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:08,636 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:08,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:08,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 10:14:08,837 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:14:08,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:08,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1110311788, now seen corresponding path program 1 times [2025-03-04 10:14:08,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:08,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137649082] [2025-03-04 10:14:08,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:08,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:08,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:14:08,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:14:08,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:08,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:14:09,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:09,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137649082] [2025-03-04 10:14:09,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137649082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:09,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876239032] [2025-03-04 10:14:09,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:09,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:09,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:09,027 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:09,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:14:09,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:14:09,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:14:09,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:09,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:09,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:14:09,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:14:09,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:14:09,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876239032] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:09,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:09,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:14:09,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985253601] [2025-03-04 10:14:09,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:09,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:14:09,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:09,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:14:09,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:14:09,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-03-04 10:14:09,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 115 transitions, 966 flow. Second operand has 12 states, 12 states have (on average 22.416666666666668) internal successors, (269), 12 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:09,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:09,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-03-04 10:14:09,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand