./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:19:17,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:19:17,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:19:17,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:19:17,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:19:18,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:19:18,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:19:18,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:19:18,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:19:18,009 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:19:18,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:19:18,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:19:18,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:19:18,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:19:18,010 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:19:18,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:19:18,011 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:19:18,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:19:18,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:19:18,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:19:18,011 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:19:18,011 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:19:18,011 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:19:18,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:19:18,011 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:19:18,011 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:19:18,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:19:18,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:19:18,012 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:19:18,012 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:19:18,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:19:18,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:19:18,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:19:18,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:19:18,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:19:18,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:19:18,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:19:18,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:19:18,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:19:18,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:19:18,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:19:18,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:19:18,013 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 -> 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 [2025-03-09 01:19:18,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:19:18,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:19:18,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:19:18,239 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:19:18,239 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:19:18,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-03-09 01:19:19,369 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29db6ff6f/0873da44c667443683f39259331f78c0/FLAG1ff368d3b [2025-03-09 01:19:19,593 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:19:19,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-03-09 01:19:19,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29db6ff6f/0873da44c667443683f39259331f78c0/FLAG1ff368d3b [2025-03-09 01:19:19,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29db6ff6f/0873da44c667443683f39259331f78c0 [2025-03-09 01:19:19,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:19:19,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:19:19,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:19:19,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:19:19,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:19:19,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5f321f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:19, skipping insertion in model container [2025-03-09 01:19:19,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:19:19" (1/1) ... [2025-03-09 01:19:19,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:19:20,097 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-09 01:19:20,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:19:20,107 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:19:20,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:19:20,133 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:19:20,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:20 WrapperNode [2025-03-09 01:19:20,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:19:20,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:19:20,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:19:20,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:19:20,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:20" (1/1) ... [2025-03-09 01:19:20,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:20" (1/1) ... [2025-03-09 01:19:20,161 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 254 [2025-03-09 01:19:20,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:19:20,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:19:20,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:19:20,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:19:20,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:20" (1/1) ... [2025-03-09 01:19:20,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:20" (1/1) ... [2025-03-09 01:19:20,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:20" (1/1) ... [2025-03-09 01:19:20,183 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-09 01:19:20,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:20" (1/1) ... [2025-03-09 01:19:20,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:20" (1/1) ... [2025-03-09 01:19:20,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:20" (1/1) ... [2025-03-09 01:19:20,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:20" (1/1) ... [2025-03-09 01:19:20,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:20" (1/1) ... [2025-03-09 01:19:20,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:20" (1/1) ... [2025-03-09 01:19:20,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:19:20,200 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:19:20,200 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:19:20,200 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:19:20,200 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:20" (1/1) ... [2025-03-09 01:19:20,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:19:20,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:20,226 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-09 01:19:20,228 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-09 01:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:19:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:19:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:19:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:19:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:19:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:19:20,246 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:19:20,343 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:19:20,345 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:19:20,783 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:19:20,783 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:19:21,011 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:19:21,011 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:19:21,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:19:21 BoogieIcfgContainer [2025-03-09 01:19:21,011 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:19:21,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:19:21,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:19:21,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:19:21,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:19:19" (1/3) ... [2025-03-09 01:19:21,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c4c6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:19:21, skipping insertion in model container [2025-03-09 01:19:21,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:20" (2/3) ... [2025-03-09 01:19:21,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c4c6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:19:21, skipping insertion in model container [2025-03-09 01:19:21,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:19:21" (3/3) ... [2025-03-09 01:19:21,019 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2025-03-09 01:19:21,029 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:19:21,031 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-trans.wvr.c that has 4 procedures, 79 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-03-09 01:19:21,032 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:19:21,098 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:19:21,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 195 flow [2025-03-09 01:19:21,153 INFO L124 PetriNetUnfolderBase]: 9/84 cut-off events. [2025-03-09 01:19:21,155 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:19:21,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 84 events. 9/84 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 274 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2025-03-09 01:19:21,161 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 195 flow [2025-03-09 01:19:21,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 83 transitions, 184 flow [2025-03-09 01:19:21,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:19:21,183 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;@7e3edf85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:19:21,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-03-09 01:19:21,187 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:19:21,187 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:19:21,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:19:21,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:21,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:19:21,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:21,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:21,193 INFO L85 PathProgramCache]: Analyzing trace with hash 757133, now seen corresponding path program 1 times [2025-03-09 01:19:21,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:21,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816157432] [2025-03-09 01:19:21,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:21,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:19:21,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:19:21,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:21,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:21,361 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-09 01:19:21,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:21,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816157432] [2025-03-09 01:19:21,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816157432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:21,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:21,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:19:21,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021774135] [2025-03-09 01:19:21,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:21,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:19:21,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:21,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:19:21,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:19:21,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-09 01:19:21,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-09 01:19:21,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:21,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-09 01:19:21,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:21,684 INFO L124 PetriNetUnfolderBase]: 858/1703 cut-off events. [2025-03-09 01:19:21,684 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-09 01:19:21,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2955 conditions, 1703 events. 858/1703 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10877 event pairs, 507 based on Foata normal form. 1/1149 useless extension candidates. Maximal degree in co-relation 2707. Up to 1158 conditions per place. [2025-03-09 01:19:21,696 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 33 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-03-09 01:19:21,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 244 flow [2025-03-09 01:19:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:19:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:19:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-03-09 01:19:21,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2025-03-09 01:19:21,708 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 184 flow. Second operand 3 states and 180 transitions. [2025-03-09 01:19:21,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 244 flow [2025-03-09 01:19:21,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 232 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:19:21,716 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 166 flow [2025-03-09 01:19:21,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2025-03-09 01:19:21,721 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2025-03-09 01:19:21,721 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 166 flow [2025-03-09 01:19:21,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-09 01:19:21,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:21,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:19:21,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:19:21,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:21,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:21,723 INFO L85 PathProgramCache]: Analyzing trace with hash 757134, now seen corresponding path program 1 times [2025-03-09 01:19:21,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:21,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001117965] [2025-03-09 01:19:21,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:21,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:21,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:19:21,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:19:21,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:21,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:21,962 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-09 01:19:21,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:21,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001117965] [2025-03-09 01:19:21,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001117965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:21,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:21,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:19:21,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723473045] [2025-03-09 01:19:21,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:21,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:21,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:21,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:21,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:22,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-09 01:19:22,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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-09 01:19:22,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:22,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-09 01:19:22,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:22,268 INFO L124 PetriNetUnfolderBase]: 859/1706 cut-off events. [2025-03-09 01:19:22,268 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-09 01:19:22,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2910 conditions, 1706 events. 859/1706 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10895 event pairs, 507 based on Foata normal form. 0/1148 useless extension candidates. Maximal degree in co-relation 2873. Up to 1171 conditions per place. [2025-03-09 01:19:22,280 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 37 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2025-03-09 01:19:22,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 81 transitions, 254 flow [2025-03-09 01:19:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:22,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 230 transitions. [2025-03-09 01:19:22,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6609195402298851 [2025-03-09 01:19:22,282 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 166 flow. Second operand 4 states and 230 transitions. [2025-03-09 01:19:22,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 81 transitions, 254 flow [2025-03-09 01:19:22,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 81 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:22,284 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 189 flow [2025-03-09 01:19:22,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2025-03-09 01:19:22,284 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -6 predicate places. [2025-03-09 01:19:22,285 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 189 flow [2025-03-09 01:19:22,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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-09 01:19:22,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:22,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:19:22,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:19:22,285 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:22,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:22,285 INFO L85 PathProgramCache]: Analyzing trace with hash 23472374, now seen corresponding path program 1 times [2025-03-09 01:19:22,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:22,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754591799] [2025-03-09 01:19:22,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:22,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:22,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:19:22,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:19:22,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:22,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:22,467 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-09 01:19:22,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:22,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754591799] [2025-03-09 01:19:22,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754591799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:22,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:22,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:19:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169811996] [2025-03-09 01:19:22,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:22,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:22,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:22,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:22,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:22,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-09 01:19:22,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 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-09 01:19:22,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:22,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-09 01:19:22,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:22,810 INFO L124 PetriNetUnfolderBase]: 860/1709 cut-off events. [2025-03-09 01:19:22,810 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-09 01:19:22,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2927 conditions, 1709 events. 860/1709 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10920 event pairs, 507 based on Foata normal form. 0/1150 useless extension candidates. Maximal degree in co-relation 2902. Up to 1170 conditions per place. [2025-03-09 01:19:22,824 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 37 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-03-09 01:19:22,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 84 transitions, 283 flow [2025-03-09 01:19:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2025-03-09 01:19:22,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2025-03-09 01:19:22,827 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 189 flow. Second operand 5 states and 280 transitions. [2025-03-09 01:19:22,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 84 transitions, 283 flow [2025-03-09 01:19:22,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 84 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:22,829 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 223 flow [2025-03-09 01:19:22,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=83, PETRI_TRANSITIONS=84} [2025-03-09 01:19:22,831 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2025-03-09 01:19:22,832 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 223 flow [2025-03-09 01:19:22,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 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-09 01:19:22,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:22,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:19:22,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:19:22,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:22,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:22,833 INFO L85 PathProgramCache]: Analyzing trace with hash 727645539, now seen corresponding path program 1 times [2025-03-09 01:19:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:22,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288558951] [2025-03-09 01:19:22,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:22,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:22,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:19:22,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:19:22,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:22,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:23,026 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-09 01:19:23,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:23,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288558951] [2025-03-09 01:19:23,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288558951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:23,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:23,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:19:23,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216911339] [2025-03-09 01:19:23,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:23,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:23,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:23,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:23,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:23,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-09 01:19:23,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 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-09 01:19:23,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:23,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-09 01:19:23,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:23,426 INFO L124 PetriNetUnfolderBase]: 861/1712 cut-off events. [2025-03-09 01:19:23,426 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-09 01:19:23,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 1712 events. 861/1712 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10911 event pairs, 507 based on Foata normal form. 0/1154 useless extension candidates. Maximal degree in co-relation 2918. Up to 1173 conditions per place. [2025-03-09 01:19:23,437 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 38 selfloop transitions, 9 changer transitions 0/87 dead transitions. [2025-03-09 01:19:23,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 87 transitions, 323 flow [2025-03-09 01:19:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2025-03-09 01:19:23,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2025-03-09 01:19:23,439 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 223 flow. Second operand 5 states and 280 transitions. [2025-03-09 01:19:23,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 87 transitions, 323 flow [2025-03-09 01:19:23,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 87 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:23,440 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 265 flow [2025-03-09 01:19:23,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2025-03-09 01:19:23,441 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 4 predicate places. [2025-03-09 01:19:23,441 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 265 flow [2025-03-09 01:19:23,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 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-09 01:19:23,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:23,442 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:19:23,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:19:23,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:23,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:23,442 INFO L85 PathProgramCache]: Analyzing trace with hash 727630626, now seen corresponding path program 1 times [2025-03-09 01:19:23,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:23,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847493181] [2025-03-09 01:19:23,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:23,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:23,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:19:23,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:19:23,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:23,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:23,614 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-09 01:19:23,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:23,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847493181] [2025-03-09 01:19:23,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847493181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:23,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826497622] [2025-03-09 01:19:23,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:23,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:23,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:23,617 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-09 01:19:23,619 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-09 01:19:23,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:19:23,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:19:23,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:23,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:23,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:19:23,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:23,739 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-09 01:19:23,908 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-09 01:19:23,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:24,014 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-09 01:19:24,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826497622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:24,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:24,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:19:24,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522542013] [2025-03-09 01:19:24,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:24,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:19:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:24,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:19:24,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:19:24,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-09 01:19:24,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 265 flow. Second operand has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 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-09 01:19:24,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:24,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-09 01:19:24,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:24,757 INFO L124 PetriNetUnfolderBase]: 861/1711 cut-off events. [2025-03-09 01:19:24,757 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-09 01:19:24,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 1711 events. 861/1711 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10928 event pairs, 507 based on Foata normal form. 0/1156 useless extension candidates. Maximal degree in co-relation 2933. Up to 1171 conditions per place. [2025-03-09 01:19:24,766 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 37 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2025-03-09 01:19:24,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 86 transitions, 353 flow [2025-03-09 01:19:24,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:19:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:19:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 370 transitions. [2025-03-09 01:19:24,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6075533661740559 [2025-03-09 01:19:24,767 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 265 flow. Second operand 7 states and 370 transitions. [2025-03-09 01:19:24,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 86 transitions, 353 flow [2025-03-09 01:19:24,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 86 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:24,769 INFO L231 Difference]: Finished difference. Result has 91 places, 86 transitions, 272 flow [2025-03-09 01:19:24,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=91, PETRI_TRANSITIONS=86} [2025-03-09 01:19:24,770 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 7 predicate places. [2025-03-09 01:19:24,770 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 86 transitions, 272 flow [2025-03-09 01:19:24,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 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-09 01:19:24,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:24,771 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 01:19:24,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:24,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:24,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:24,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:24,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1082138908, now seen corresponding path program 1 times [2025-03-09 01:19:24,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:24,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217519749] [2025-03-09 01:19:24,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:24,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:24,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:19:24,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:19:24,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:24,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:25,135 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-09 01:19:25,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:25,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217519749] [2025-03-09 01:19:25,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217519749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:25,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988270923] [2025-03-09 01:19:25,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:25,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:25,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:25,138 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-09 01:19:25,140 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-09 01:19:25,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:19:25,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:19:25,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:25,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:25,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:19:25,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:25,209 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-09 01:19:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:25,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:25,432 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-09 01:19:25,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988270923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:25,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:25,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:19:25,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941128919] [2025-03-09 01:19:25,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:25,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:19:25,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:25,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:19:25,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:19:26,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-09 01:19:26,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 86 transitions, 272 flow. Second operand has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 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-09 01:19:26,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:26,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-09 01:19:26,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:26,327 INFO L124 PetriNetUnfolderBase]: 861/1710 cut-off events. [2025-03-09 01:19:26,328 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-09 01:19:26,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2968 conditions, 1710 events. 861/1710 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10946 event pairs, 507 based on Foata normal form. 1/1158 useless extension candidates. Maximal degree in co-relation 2930. Up to 1165 conditions per place. [2025-03-09 01:19:26,337 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 33 selfloop transitions, 12 changer transitions 0/85 dead transitions. [2025-03-09 01:19:26,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 85 transitions, 356 flow [2025-03-09 01:19:26,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:19:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:19:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 372 transitions. [2025-03-09 01:19:26,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6108374384236454 [2025-03-09 01:19:26,339 INFO L175 Difference]: Start difference. First operand has 91 places, 86 transitions, 272 flow. Second operand 7 states and 372 transitions. [2025-03-09 01:19:26,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 85 transitions, 356 flow [2025-03-09 01:19:26,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 85 transitions, 321 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-03-09 01:19:26,341 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 255 flow [2025-03-09 01:19:26,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2025-03-09 01:19:26,342 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 4 predicate places. [2025-03-09 01:19:26,342 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 255 flow [2025-03-09 01:19:26,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 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-09 01:19:26,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:26,343 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 01:19:26,355 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-09 01:19:26,547 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-09 01:19:26,547 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:26,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:26,548 INFO L85 PathProgramCache]: Analyzing trace with hash -812282841, now seen corresponding path program 1 times [2025-03-09 01:19:26,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:26,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679383488] [2025-03-09 01:19:26,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:26,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:26,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:19:26,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:19:26,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:26,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:26,744 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-09 01:19:26,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:26,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679383488] [2025-03-09 01:19:26,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679383488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:26,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696311628] [2025-03-09 01:19:26,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:26,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:26,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:26,747 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-09 01:19:26,748 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-09 01:19:26,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:19:26,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:19:26,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:26,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:26,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:19:26,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:26,824 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-09 01:19:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:26,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:27,017 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-09 01:19:27,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696311628] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:27,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:27,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:19:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571813915] [2025-03-09 01:19:27,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:27,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:19:27,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:27,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:19:27,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:19:27,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-09 01:19:27,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 255 flow. Second operand has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 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-09 01:19:27,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:27,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-09 01:19:27,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:27,902 INFO L124 PetriNetUnfolderBase]: 861/1709 cut-off events. [2025-03-09 01:19:27,902 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-09 01:19:27,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2956 conditions, 1709 events. 861/1709 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10914 event pairs, 507 based on Foata normal form. 0/1156 useless extension candidates. Maximal degree in co-relation 2911. Up to 1164 conditions per place. [2025-03-09 01:19:27,911 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 29 selfloop transitions, 15 changer transitions 0/84 dead transitions. [2025-03-09 01:19:27,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 84 transitions, 338 flow [2025-03-09 01:19:27,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:19:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:19:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 371 transitions. [2025-03-09 01:19:27,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2025-03-09 01:19:27,915 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 255 flow. Second operand 7 states and 371 transitions. [2025-03-09 01:19:27,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 84 transitions, 338 flow [2025-03-09 01:19:27,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 84 transitions, 313 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-09 01:19:27,918 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 255 flow [2025-03-09 01:19:27,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2025-03-09 01:19:27,919 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 3 predicate places. [2025-03-09 01:19:27,919 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 255 flow [2025-03-09 01:19:27,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 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-09 01:19:27,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:27,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:27,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:19:28,120 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-09 01:19:28,120 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:28,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:28,121 INFO L85 PathProgramCache]: Analyzing trace with hash 593170345, now seen corresponding path program 1 times [2025-03-09 01:19:28,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:28,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545167537] [2025-03-09 01:19:28,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:28,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:28,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:19:28,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:19:28,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:28,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:28,183 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-09 01:19:28,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545167537] [2025-03-09 01:19:28,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545167537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:28,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:28,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:28,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125300933] [2025-03-09 01:19:28,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:28,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:28,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:28,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:28,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:28,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-09 01:19:28,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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-09 01:19:28,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:28,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-09 01:19:28,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:28,445 INFO L124 PetriNetUnfolderBase]: 1467/3027 cut-off events. [2025-03-09 01:19:28,445 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-09 01:19:28,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5185 conditions, 3027 events. 1467/3027 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 22228 event pairs, 659 based on Foata normal form. 62/2186 useless extension candidates. Maximal degree in co-relation 3503. Up to 1332 conditions per place. [2025-03-09 01:19:28,458 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 90 selfloop transitions, 4 changer transitions 0/133 dead transitions. [2025-03-09 01:19:28,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 133 transitions, 595 flow [2025-03-09 01:19:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 328 transitions. [2025-03-09 01:19:28,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7540229885057471 [2025-03-09 01:19:28,459 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 255 flow. Second operand 5 states and 328 transitions. [2025-03-09 01:19:28,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 133 transitions, 595 flow [2025-03-09 01:19:28,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 133 transitions, 538 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-09 01:19:28,464 INFO L231 Difference]: Finished difference. Result has 87 places, 85 transitions, 237 flow [2025-03-09 01:19:28,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=87, PETRI_TRANSITIONS=85} [2025-03-09 01:19:28,465 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 3 predicate places. [2025-03-09 01:19:28,465 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 85 transitions, 237 flow [2025-03-09 01:19:28,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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-09 01:19:28,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:28,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:28,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:19:28,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:28,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:28,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2125580651, now seen corresponding path program 1 times [2025-03-09 01:19:28,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:28,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675457242] [2025-03-09 01:19:28,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:28,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:28,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:19:28,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:19:28,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:28,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:28,532 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-09 01:19:28,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:28,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675457242] [2025-03-09 01:19:28,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675457242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:28,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:28,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:19:28,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507792579] [2025-03-09 01:19:28,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:28,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:28,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:28,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:28,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:28,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-09 01:19:28,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 85 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 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-09 01:19:28,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:28,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-09 01:19:28,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:28,862 INFO L124 PetriNetUnfolderBase]: 2406/4964 cut-off events. [2025-03-09 01:19:28,862 INFO L125 PetriNetUnfolderBase]: For 515/515 co-relation queries the response was YES. [2025-03-09 01:19:28,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8853 conditions, 4964 events. 2406/4964 cut-off events. For 515/515 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 40091 event pairs, 1023 based on Foata normal form. 62/3586 useless extension candidates. Maximal degree in co-relation 5317. Up to 1984 conditions per place. [2025-03-09 01:19:28,907 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 82 selfloop transitions, 8 changer transitions 0/129 dead transitions. [2025-03-09 01:19:28,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 129 transitions, 529 flow [2025-03-09 01:19:28,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 377 transitions. [2025-03-09 01:19:28,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-03-09 01:19:28,909 INFO L175 Difference]: Start difference. First operand has 87 places, 85 transitions, 237 flow. Second operand 6 states and 377 transitions. [2025-03-09 01:19:28,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 129 transitions, 529 flow [2025-03-09 01:19:28,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 129 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:28,911 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 284 flow [2025-03-09 01:19:28,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2025-03-09 01:19:28,912 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 9 predicate places. [2025-03-09 01:19:28,912 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 284 flow [2025-03-09 01:19:28,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 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-09 01:19:28,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:28,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:28,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:19:28,913 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:28,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1260642438, now seen corresponding path program 1 times [2025-03-09 01:19:28,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:28,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562174570] [2025-03-09 01:19:28,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:28,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:28,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:19:28,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:19:28,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:28,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:28,959 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-09 01:19:28,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:28,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562174570] [2025-03-09 01:19:28,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562174570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:28,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:28,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:19:28,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724076622] [2025-03-09 01:19:28,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:28,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:28,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:28,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:28,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:28,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-09 01:19:28,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 284 flow. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 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-09 01:19:28,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:28,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-09 01:19:28,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:29,284 INFO L124 PetriNetUnfolderBase]: 1967/4496 cut-off events. [2025-03-09 01:19:29,284 INFO L125 PetriNetUnfolderBase]: For 1180/1180 co-relation queries the response was YES. [2025-03-09 01:19:29,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8035 conditions, 4496 events. 1967/4496 cut-off events. For 1180/1180 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 37708 event pairs, 1032 based on Foata normal form. 82/3189 useless extension candidates. Maximal degree in co-relation 4943. Up to 2084 conditions per place. [2025-03-09 01:19:29,297 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 77 selfloop transitions, 7 changer transitions 0/123 dead transitions. [2025-03-09 01:19:29,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 123 transitions, 549 flow [2025-03-09 01:19:29,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 370 transitions. [2025-03-09 01:19:29,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7088122605363985 [2025-03-09 01:19:29,299 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 284 flow. Second operand 6 states and 370 transitions. [2025-03-09 01:19:29,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 123 transitions, 549 flow [2025-03-09 01:19:29,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 123 transitions, 546 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:29,302 INFO L231 Difference]: Finished difference. Result has 99 places, 90 transitions, 305 flow [2025-03-09 01:19:29,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2025-03-09 01:19:29,302 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 15 predicate places. [2025-03-09 01:19:29,303 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 305 flow [2025-03-09 01:19:29,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 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-09 01:19:29,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:29,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:29,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:19:29,303 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:29,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash -367409643, now seen corresponding path program 1 times [2025-03-09 01:19:29,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:29,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233492197] [2025-03-09 01:19:29,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:29,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:29,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:19:29,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:19:29,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:29,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:29,359 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-09 01:19:29,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:29,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233492197] [2025-03-09 01:19:29,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233492197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:29,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:29,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:29,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116915325] [2025-03-09 01:19:29,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:29,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:29,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:29,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:29,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:29,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-09 01:19:29,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 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-09 01:19:29,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:29,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-09 01:19:29,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:29,651 INFO L124 PetriNetUnfolderBase]: 1636/3376 cut-off events. [2025-03-09 01:19:29,651 INFO L125 PetriNetUnfolderBase]: For 1258/1258 co-relation queries the response was YES. [2025-03-09 01:19:29,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6628 conditions, 3376 events. 1636/3376 cut-off events. For 1258/1258 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 25006 event pairs, 928 based on Foata normal form. 58/2606 useless extension candidates. Maximal degree in co-relation 3803. Up to 1759 conditions per place. [2025-03-09 01:19:29,660 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 92 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2025-03-09 01:19:29,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 135 transitions, 674 flow [2025-03-09 01:19:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 320 transitions. [2025-03-09 01:19:29,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.735632183908046 [2025-03-09 01:19:29,661 INFO L175 Difference]: Start difference. First operand has 99 places, 90 transitions, 305 flow. Second operand 5 states and 320 transitions. [2025-03-09 01:19:29,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 135 transitions, 674 flow [2025-03-09 01:19:29,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 135 transitions, 658 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:29,664 INFO L231 Difference]: Finished difference. Result has 102 places, 91 transitions, 312 flow [2025-03-09 01:19:29,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=102, PETRI_TRANSITIONS=91} [2025-03-09 01:19:29,664 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 18 predicate places. [2025-03-09 01:19:29,665 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 91 transitions, 312 flow [2025-03-09 01:19:29,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 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-09 01:19:29,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:29,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:29,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:19:29,665 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:29,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:29,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2070568772, now seen corresponding path program 1 times [2025-03-09 01:19:29,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:29,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149528427] [2025-03-09 01:19:29,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:29,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:29,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:19:29,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:19:29,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:29,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:29,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:29,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149528427] [2025-03-09 01:19:29,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149528427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:29,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058139740] [2025-03-09 01:19:29,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:29,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:29,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:29,898 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-09 01:19:29,900 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-09 01:19:29,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:19:29,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:19:29,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:29,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:29,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:19:29,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:29,970 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-09 01:19:30,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:19:30,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:19:30,030 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 01:19:30,030 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-09 01:19:30,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:19:30,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:19:30,067 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:30,067 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-09 01:19:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:30,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:30,271 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 162 treesize of output 156 [2025-03-09 01:19:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:30,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058139740] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:30,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:30,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-09 01:19:30,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550593784] [2025-03-09 01:19:30,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:30,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:19:30,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:30,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:19:30,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:19:34,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 87 [2025-03-09 01:19:34,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 91 transitions, 312 flow. Second operand has 16 states, 16 states have (on average 38.9375) internal successors, (623), 16 states have internal predecessors, (623), 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-09 01:19:34,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:34,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 87 [2025-03-09 01:19:34,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:35,094 INFO L124 PetriNetUnfolderBase]: 4047/7686 cut-off events. [2025-03-09 01:19:35,094 INFO L125 PetriNetUnfolderBase]: For 1869/1869 co-relation queries the response was YES. [2025-03-09 01:19:35,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15019 conditions, 7686 events. 4047/7686 cut-off events. For 1869/1869 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 58740 event pairs, 1005 based on Foata normal form. 0/5932 useless extension candidates. Maximal degree in co-relation 13014. Up to 2166 conditions per place. [2025-03-09 01:19:35,130 INFO L140 encePairwiseOnDemand]: 71/87 looper letters, 116 selfloop transitions, 22 changer transitions 0/168 dead transitions. [2025-03-09 01:19:35,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 168 transitions, 823 flow [2025-03-09 01:19:35,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:19:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:19:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 475 transitions. [2025-03-09 01:19:35,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6066411238825032 [2025-03-09 01:19:35,132 INFO L175 Difference]: Start difference. First operand has 102 places, 91 transitions, 312 flow. Second operand 9 states and 475 transitions. [2025-03-09 01:19:35,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 168 transitions, 823 flow [2025-03-09 01:19:35,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 168 transitions, 818 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:35,137 INFO L231 Difference]: Finished difference. Result has 105 places, 95 transitions, 403 flow [2025-03-09 01:19:35,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=403, PETRI_PLACES=105, PETRI_TRANSITIONS=95} [2025-03-09 01:19:35,138 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 21 predicate places. [2025-03-09 01:19:35,138 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 95 transitions, 403 flow [2025-03-09 01:19:35,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 38.9375) internal successors, (623), 16 states have internal predecessors, (623), 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-09 01:19:35,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:35,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:35,146 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-09 01:19:35,343 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-09 01:19:35,343 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:35,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:35,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1623778081, now seen corresponding path program 1 times [2025-03-09 01:19:35,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:35,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221334733] [2025-03-09 01:19:35,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:35,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:35,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:19:35,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:19:35,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:35,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:35,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:35,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221334733] [2025-03-09 01:19:35,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221334733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:35,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:35,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:19:35,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720350800] [2025-03-09 01:19:35,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:35,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:35,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:35,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:35,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:35,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-09 01:19:35,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 95 transitions, 403 flow. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 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-09 01:19:35,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:35,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-09 01:19:35,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:35,887 INFO L124 PetriNetUnfolderBase]: 3962/8842 cut-off events. [2025-03-09 01:19:35,888 INFO L125 PetriNetUnfolderBase]: For 5120/5166 co-relation queries the response was YES. [2025-03-09 01:19:35,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17808 conditions, 8842 events. 3962/8842 cut-off events. For 5120/5166 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 78899 event pairs, 2151 based on Foata normal form. 162/6960 useless extension candidates. Maximal degree in co-relation 11982. Up to 3683 conditions per place. [2025-03-09 01:19:35,920 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 94 selfloop transitions, 13 changer transitions 0/142 dead transitions. [2025-03-09 01:19:35,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 142 transitions, 815 flow [2025-03-09 01:19:35,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 321 transitions. [2025-03-09 01:19:35,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379310344827587 [2025-03-09 01:19:35,922 INFO L175 Difference]: Start difference. First operand has 105 places, 95 transitions, 403 flow. Second operand 5 states and 321 transitions. [2025-03-09 01:19:35,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 142 transitions, 815 flow [2025-03-09 01:19:35,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 142 transitions, 792 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:35,928 INFO L231 Difference]: Finished difference. Result has 109 places, 97 transitions, 442 flow [2025-03-09 01:19:35,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=442, PETRI_PLACES=109, PETRI_TRANSITIONS=97} [2025-03-09 01:19:35,928 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 25 predicate places. [2025-03-09 01:19:35,928 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 442 flow [2025-03-09 01:19:35,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 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-09 01:19:35,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:35,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:35,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:19:35,930 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:35,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:35,932 INFO L85 PathProgramCache]: Analyzing trace with hash 236878210, now seen corresponding path program 1 times [2025-03-09 01:19:35,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:35,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428879360] [2025-03-09 01:19:35,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:35,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:35,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:19:35,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:19:35,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:35,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:36,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:36,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428879360] [2025-03-09 01:19:36,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428879360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:36,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585654125] [2025-03-09 01:19:36,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:36,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:36,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:36,096 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-09 01:19:36,098 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-09 01:19:36,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:19:36,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:19:36,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:36,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:36,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:19:36,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:36,165 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-09 01:19:36,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:19:36,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:19:36,202 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:36,202 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-09 01:19:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:36,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:36,306 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 52 treesize of output 48 [2025-03-09 01:19:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:36,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585654125] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:36,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:36,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 01:19:36,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70379807] [2025-03-09 01:19:36,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:36,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:19:36,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:36,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:19:36,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:19:36,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 87 [2025-03-09 01:19:37,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 442 flow. Second operand has 13 states, 13 states have (on average 45.92307692307692) internal successors, (597), 13 states have internal predecessors, (597), 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-09 01:19:37,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:37,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 87 [2025-03-09 01:19:37,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:37,814 INFO L124 PetriNetUnfolderBase]: 4462/8708 cut-off events. [2025-03-09 01:19:37,814 INFO L125 PetriNetUnfolderBase]: For 5706/5706 co-relation queries the response was YES. [2025-03-09 01:19:37,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18872 conditions, 8708 events. 4462/8708 cut-off events. For 5706/5706 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 70533 event pairs, 1564 based on Foata normal form. 0/7304 useless extension candidates. Maximal degree in co-relation 13204. Up to 2366 conditions per place. [2025-03-09 01:19:37,844 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 108 selfloop transitions, 24 changer transitions 0/165 dead transitions. [2025-03-09 01:19:37,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 165 transitions, 904 flow [2025-03-09 01:19:37,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:19:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:19:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 514 transitions. [2025-03-09 01:19:37,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6564495530012772 [2025-03-09 01:19:37,846 INFO L175 Difference]: Start difference. First operand has 109 places, 97 transitions, 442 flow. Second operand 9 states and 514 transitions. [2025-03-09 01:19:37,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 165 transitions, 904 flow [2025-03-09 01:19:37,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 165 transitions, 897 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:37,853 INFO L231 Difference]: Finished difference. Result has 117 places, 99 transitions, 509 flow [2025-03-09 01:19:37,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=509, PETRI_PLACES=117, PETRI_TRANSITIONS=99} [2025-03-09 01:19:37,854 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 33 predicate places. [2025-03-09 01:19:37,854 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 99 transitions, 509 flow [2025-03-09 01:19:37,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 45.92307692307692) internal successors, (597), 13 states have internal predecessors, (597), 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-09 01:19:37,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:37,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:37,861 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-09 01:19:38,059 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-09 01:19:38,059 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:38,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash 236878209, now seen corresponding path program 1 times [2025-03-09 01:19:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:38,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464611271] [2025-03-09 01:19:38,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:38,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:38,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:19:38,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:19:38,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:38,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:19:38,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:38,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464611271] [2025-03-09 01:19:38,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464611271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:38,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:38,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:19:38,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146411482] [2025-03-09 01:19:38,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:38,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:38,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:38,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:38,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:38,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 87 [2025-03-09 01:19:38,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 99 transitions, 509 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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-09 01:19:38,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:38,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 87 [2025-03-09 01:19:38,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:38,716 INFO L124 PetriNetUnfolderBase]: 5163/9745 cut-off events. [2025-03-09 01:19:38,716 INFO L125 PetriNetUnfolderBase]: For 9051/9051 co-relation queries the response was YES. [2025-03-09 01:19:38,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22420 conditions, 9745 events. 5163/9745 cut-off events. For 9051/9051 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 77690 event pairs, 3904 based on Foata normal form. 205/8641 useless extension candidates. Maximal degree in co-relation 16183. Up to 7450 conditions per place. [2025-03-09 01:19:38,799 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 55 selfloop transitions, 12 changer transitions 0/95 dead transitions. [2025-03-09 01:19:38,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 95 transitions, 635 flow [2025-03-09 01:19:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2025-03-09 01:19:38,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5563218390804597 [2025-03-09 01:19:38,800 INFO L175 Difference]: Start difference. First operand has 117 places, 99 transitions, 509 flow. Second operand 5 states and 242 transitions. [2025-03-09 01:19:38,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 95 transitions, 635 flow [2025-03-09 01:19:38,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 95 transitions, 585 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-09 01:19:38,808 INFO L231 Difference]: Finished difference. Result has 111 places, 95 transitions, 475 flow [2025-03-09 01:19:38,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=475, PETRI_PLACES=111, PETRI_TRANSITIONS=95} [2025-03-09 01:19:38,808 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 27 predicate places. [2025-03-09 01:19:38,808 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 95 transitions, 475 flow [2025-03-09 01:19:38,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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-09 01:19:38,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:38,809 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:38,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:19:38,809 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:38,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:38,809 INFO L85 PathProgramCache]: Analyzing trace with hash 990353154, now seen corresponding path program 1 times [2025-03-09 01:19:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:38,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260498695] [2025-03-09 01:19:38,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:38,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:38,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:19:38,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:19:38,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:38,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:38,872 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-09 01:19:38,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:38,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260498695] [2025-03-09 01:19:38,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260498695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:38,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:38,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:19:38,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446775894] [2025-03-09 01:19:38,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:38,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:38,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:38,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:38,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:38,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-09 01:19:38,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 95 transitions, 475 flow. Second operand has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 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-09 01:19:38,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:38,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-09 01:19:38,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:39,411 INFO L124 PetriNetUnfolderBase]: 3442/7049 cut-off events. [2025-03-09 01:19:39,411 INFO L125 PetriNetUnfolderBase]: For 7271/7427 co-relation queries the response was YES. [2025-03-09 01:19:39,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15664 conditions, 7049 events. 3442/7049 cut-off events. For 7271/7427 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 57062 event pairs, 2103 based on Foata normal form. 94/5840 useless extension candidates. Maximal degree in co-relation 10285. Up to 3660 conditions per place. [2025-03-09 01:19:39,444 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 89 selfloop transitions, 13 changer transitions 0/133 dead transitions. [2025-03-09 01:19:39,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 133 transitions, 865 flow [2025-03-09 01:19:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2025-03-09 01:19:39,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7218390804597701 [2025-03-09 01:19:39,445 INFO L175 Difference]: Start difference. First operand has 111 places, 95 transitions, 475 flow. Second operand 5 states and 314 transitions. [2025-03-09 01:19:39,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 133 transitions, 865 flow [2025-03-09 01:19:39,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 133 transitions, 849 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:39,454 INFO L231 Difference]: Finished difference. Result has 114 places, 97 transitions, 509 flow [2025-03-09 01:19:39,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=509, PETRI_PLACES=114, PETRI_TRANSITIONS=97} [2025-03-09 01:19:39,454 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 30 predicate places. [2025-03-09 01:19:39,454 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 97 transitions, 509 flow [2025-03-09 01:19:39,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 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-09 01:19:39,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:39,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:39,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:19:39,455 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:39,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:39,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1154391389, now seen corresponding path program 1 times [2025-03-09 01:19:39,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:39,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241642229] [2025-03-09 01:19:39,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:39,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:39,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:19:39,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:19:39,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:39,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:39,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:39,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241642229] [2025-03-09 01:19:39,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241642229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:39,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024067924] [2025-03-09 01:19:39,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:39,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:39,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:39,593 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-09 01:19:39,594 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-09 01:19:39,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:19:39,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:19:39,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:39,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:39,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:19:39,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:39,662 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-09 01:19:39,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:19:39,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:19:39,697 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:39,697 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-09 01:19:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:39,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:39,803 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 52 treesize of output 48 [2025-03-09 01:19:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:39,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024067924] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:39,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:39,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 01:19:39,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775407006] [2025-03-09 01:19:39,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:39,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:19:39,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:39,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:19:39,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:19:40,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 87 [2025-03-09 01:19:40,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 97 transitions, 509 flow. Second operand has 13 states, 13 states have (on average 45.38461538461539) internal successors, (590), 13 states have internal predecessors, (590), 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-09 01:19:40,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:40,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 87 [2025-03-09 01:19:40,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:41,363 INFO L124 PetriNetUnfolderBase]: 7077/13268 cut-off events. [2025-03-09 01:19:41,363 INFO L125 PetriNetUnfolderBase]: For 15201/15717 co-relation queries the response was YES. [2025-03-09 01:19:41,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29773 conditions, 13268 events. 7077/13268 cut-off events. For 15201/15717 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 109341 event pairs, 1975 based on Foata normal form. 0/11044 useless extension candidates. Maximal degree in co-relation 22166. Up to 3993 conditions per place. [2025-03-09 01:19:41,419 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 116 selfloop transitions, 24 changer transitions 0/168 dead transitions. [2025-03-09 01:19:41,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 168 transitions, 1065 flow [2025-03-09 01:19:41,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:19:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:19:41,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 503 transitions. [2025-03-09 01:19:41,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6424010217113666 [2025-03-09 01:19:41,421 INFO L175 Difference]: Start difference. First operand has 114 places, 97 transitions, 509 flow. Second operand 9 states and 503 transitions. [2025-03-09 01:19:41,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 168 transitions, 1065 flow [2025-03-09 01:19:41,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 168 transitions, 1047 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:41,430 INFO L231 Difference]: Finished difference. Result has 121 places, 98 transitions, 557 flow [2025-03-09 01:19:41,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=557, PETRI_PLACES=121, PETRI_TRANSITIONS=98} [2025-03-09 01:19:41,430 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 37 predicate places. [2025-03-09 01:19:41,430 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 98 transitions, 557 flow [2025-03-09 01:19:41,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 45.38461538461539) internal successors, (590), 13 states have internal predecessors, (590), 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-09 01:19:41,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:41,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:41,437 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-09 01:19:41,635 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,SelfDestructingSolverStorable16 [2025-03-09 01:19:41,635 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:41,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1426395410, now seen corresponding path program 1 times [2025-03-09 01:19:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:41,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100625401] [2025-03-09 01:19:41,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:41,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:41,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:19:41,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:19:41,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:41,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:41,673 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-09 01:19:41,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:41,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100625401] [2025-03-09 01:19:41,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100625401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:41,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:41,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:19:41,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489188999] [2025-03-09 01:19:41,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:41,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:41,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:41,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:41,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:41,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 87 [2025-03-09 01:19:41,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 98 transitions, 557 flow. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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-09 01:19:41,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:41,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 87 [2025-03-09 01:19:41,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:42,381 INFO L124 PetriNetUnfolderBase]: 6715/12950 cut-off events. [2025-03-09 01:19:42,381 INFO L125 PetriNetUnfolderBase]: For 16988/17438 co-relation queries the response was YES. [2025-03-09 01:19:42,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30254 conditions, 12950 events. 6715/12950 cut-off events. For 16988/17438 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 108670 event pairs, 5344 based on Foata normal form. 0/12008 useless extension candidates. Maximal degree in co-relation 22807. Up to 9717 conditions per place. [2025-03-09 01:19:42,434 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 59 selfloop transitions, 9 changer transitions 0/94 dead transitions. [2025-03-09 01:19:42,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 94 transitions, 685 flow [2025-03-09 01:19:42,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2025-03-09 01:19:42,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5890804597701149 [2025-03-09 01:19:42,435 INFO L175 Difference]: Start difference. First operand has 121 places, 98 transitions, 557 flow. Second operand 4 states and 205 transitions. [2025-03-09 01:19:42,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 94 transitions, 685 flow [2025-03-09 01:19:42,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 94 transitions, 641 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-09 01:19:42,444 INFO L231 Difference]: Finished difference. Result has 114 places, 94 transitions, 523 flow [2025-03-09 01:19:42,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=523, PETRI_PLACES=114, PETRI_TRANSITIONS=94} [2025-03-09 01:19:42,445 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 30 predicate places. [2025-03-09 01:19:42,445 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 94 transitions, 523 flow [2025-03-09 01:19:42,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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-09 01:19:42,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:42,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:42,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:19:42,446 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:42,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:42,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1426395411, now seen corresponding path program 1 times [2025-03-09 01:19:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:42,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452170959] [2025-03-09 01:19:42,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:42,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:42,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:19:42,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:19:42,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:42,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:42,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:42,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452170959] [2025-03-09 01:19:42,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452170959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:42,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853026323] [2025-03-09 01:19:42,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:42,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:42,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:42,539 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-09 01:19:42,540 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-09 01:19:42,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:19:42,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:19:42,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:42,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:42,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:19:42,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:42,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:42,726 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 22 treesize of output 18 [2025-03-09 01:19:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:42,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853026323] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:42,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:42,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 01:19:42,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817421520] [2025-03-09 01:19:42,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:42,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:19:42,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:42,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:19:42,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:19:43,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-09 01:19:43,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 94 transitions, 523 flow. Second operand has 11 states, 11 states have (on average 49.18181818181818) internal successors, (541), 11 states have internal predecessors, (541), 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-09 01:19:43,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:43,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-09 01:19:43,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:43,990 INFO L124 PetriNetUnfolderBase]: 6288/11209 cut-off events. [2025-03-09 01:19:43,990 INFO L125 PetriNetUnfolderBase]: For 15001/15412 co-relation queries the response was YES. [2025-03-09 01:19:44,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27190 conditions, 11209 events. 6288/11209 cut-off events. For 15001/15412 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 84953 event pairs, 2100 based on Foata normal form. 0/10271 useless extension candidates. Maximal degree in co-relation 20038. Up to 3122 conditions per place. [2025-03-09 01:19:44,041 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 112 selfloop transitions, 24 changer transitions 0/161 dead transitions. [2025-03-09 01:19:44,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 161 transitions, 1073 flow [2025-03-09 01:19:44,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:19:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:19:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 437 transitions. [2025-03-09 01:19:44,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7175697865353038 [2025-03-09 01:19:44,043 INFO L175 Difference]: Start difference. First operand has 114 places, 94 transitions, 523 flow. Second operand 7 states and 437 transitions. [2025-03-09 01:19:44,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 161 transitions, 1073 flow [2025-03-09 01:19:44,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 161 transitions, 1063 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:44,054 INFO L231 Difference]: Finished difference. Result has 119 places, 94 transitions, 577 flow [2025-03-09 01:19:44,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=577, PETRI_PLACES=119, PETRI_TRANSITIONS=94} [2025-03-09 01:19:44,055 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 35 predicate places. [2025-03-09 01:19:44,055 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 94 transitions, 577 flow [2025-03-09 01:19:44,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.18181818181818) internal successors, (541), 11 states have internal predecessors, (541), 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-09 01:19:44,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:44,055 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:44,061 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-09 01:19:44,255 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-09 01:19:44,256 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:19:44,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:44,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2032867518, now seen corresponding path program 1 times [2025-03-09 01:19:44,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:44,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372611012] [2025-03-09 01:19:44,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:44,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:44,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:19:44,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:19:44,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:44,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:19:44,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372611012] [2025-03-09 01:19:44,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372611012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:44,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132159749] [2025-03-09 01:19:44,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:44,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:44,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:44,436 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-09 01:19:44,437 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-09 01:19:44,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:19:44,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:19:44,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:44,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:44,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 01:19:44,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:44,517 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-09 01:19:44,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:19:44,552 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 14 treesize of output 9 [2025-03-09 01:19:44,557 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:44,557 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-09 01:19:44,572 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:19:44,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-09 01:19:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:19:44,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:44,757 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 46 treesize of output 42 [2025-03-09 01:19:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:19:44,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132159749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:44,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:44,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 13 [2025-03-09 01:19:44,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655368297] [2025-03-09 01:19:44,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:44,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:19:44,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:44,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:19:44,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:19:48,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:19:52,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:19:56,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:00,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:05,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:07,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:11,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:15,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:19,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:23,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:27,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:31,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:35,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:39,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:39,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-09 01:20:39,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 94 transitions, 577 flow. Second operand has 15 states, 15 states have (on average 30.466666666666665) internal successors, (457), 15 states have internal predecessors, (457), 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-09 01:20:39,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:39,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-09 01:20:39,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:41,744 INFO L124 PetriNetUnfolderBase]: 15730/26866 cut-off events. [2025-03-09 01:20:41,744 INFO L125 PetriNetUnfolderBase]: For 37516/38359 co-relation queries the response was YES. [2025-03-09 01:20:41,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65455 conditions, 26866 events. 15730/26866 cut-off events. For 37516/38359 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 220137 event pairs, 5096 based on Foata normal form. 0/24606 useless extension candidates. Maximal degree in co-relation 56496. Up to 6988 conditions per place. [2025-03-09 01:20:41,887 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 138 selfloop transitions, 24 changer transitions 0/182 dead transitions. [2025-03-09 01:20:41,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 182 transitions, 1307 flow [2025-03-09 01:20:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:20:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:20:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 413 transitions. [2025-03-09 01:20:41,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4747126436781609 [2025-03-09 01:20:41,889 INFO L175 Difference]: Start difference. First operand has 119 places, 94 transitions, 577 flow. Second operand 10 states and 413 transitions. [2025-03-09 01:20:41,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 182 transitions, 1307 flow [2025-03-09 01:20:41,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 182 transitions, 1246 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:41,907 INFO L231 Difference]: Finished difference. Result has 125 places, 96 transitions, 605 flow [2025-03-09 01:20:41,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=605, PETRI_PLACES=125, PETRI_TRANSITIONS=96} [2025-03-09 01:20:41,907 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 41 predicate places. [2025-03-09 01:20:41,907 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 96 transitions, 605 flow [2025-03-09 01:20:41,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 30.466666666666665) internal successors, (457), 15 states have internal predecessors, (457), 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-09 01:20:41,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:41,908 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:41,915 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-09 01:20:42,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:42,108 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:20:42,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:42,109 INFO L85 PathProgramCache]: Analyzing trace with hash 208187522, now seen corresponding path program 1 times [2025-03-09 01:20:42,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:42,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085181056] [2025-03-09 01:20:42,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:42,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:42,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:20:42,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:20:42,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:42,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:42,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:42,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085181056] [2025-03-09 01:20:42,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085181056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:42,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891863080] [2025-03-09 01:20:42,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:42,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:42,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:42,181 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-09 01:20:42,183 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-09 01:20:42,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:20:42,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:20:42,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:42,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:42,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:20:42,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:42,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:42,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891863080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:42,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:42,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-03-09 01:20:42,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850852770] [2025-03-09 01:20:42,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:42,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:20:42,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:42,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:20:42,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:20:42,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-09 01:20:42,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 96 transitions, 605 flow. Second operand has 16 states, 16 states have (on average 51.125) internal successors, (818), 16 states have internal predecessors, (818), 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-09 01:20:42,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:42,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-09 01:20:42,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:46,270 INFO L124 PetriNetUnfolderBase]: 26284/47428 cut-off events. [2025-03-09 01:20:46,271 INFO L125 PetriNetUnfolderBase]: For 78093/81167 co-relation queries the response was YES. [2025-03-09 01:20:46,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120877 conditions, 47428 events. 26284/47428 cut-off events. For 78093/81167 co-relation queries the response was YES. Maximal size of possible extension queue 1873. Compared 454502 event pairs, 11026 based on Foata normal form. 744/46259 useless extension candidates. Maximal degree in co-relation 60819. Up to 11115 conditions per place. [2025-03-09 01:20:46,598 INFO L140 encePairwiseOnDemand]: 74/87 looper letters, 295 selfloop transitions, 56 changer transitions 0/378 dead transitions. [2025-03-09 01:20:46,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 378 transitions, 2845 flow [2025-03-09 01:20:46,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 01:20:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-09 01:20:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1489 transitions. [2025-03-09 01:20:46,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6845977011494253 [2025-03-09 01:20:46,601 INFO L175 Difference]: Start difference. First operand has 125 places, 96 transitions, 605 flow. Second operand 25 states and 1489 transitions. [2025-03-09 01:20:46,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 378 transitions, 2845 flow [2025-03-09 01:20:46,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 378 transitions, 2727 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:46,671 INFO L231 Difference]: Finished difference. Result has 155 places, 134 transitions, 1062 flow [2025-03-09 01:20:46,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1062, PETRI_PLACES=155, PETRI_TRANSITIONS=134} [2025-03-09 01:20:46,671 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 71 predicate places. [2025-03-09 01:20:46,671 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 134 transitions, 1062 flow [2025-03-09 01:20:46,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.125) internal successors, (818), 16 states have internal predecessors, (818), 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-09 01:20:46,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:46,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:46,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:46,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:46,873 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:20:46,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1405615644, now seen corresponding path program 1 times [2025-03-09 01:20:46,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:46,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563257683] [2025-03-09 01:20:46,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:46,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:46,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:20:46,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:20:46,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:46,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:46,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:46,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563257683] [2025-03-09 01:20:46,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563257683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:46,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510533585] [2025-03-09 01:20:46,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:46,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:46,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:46,996 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:46,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:20:47,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:20:47,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:20:47,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:47,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:47,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:20:47,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:47,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:47,180 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 22 treesize of output 18 [2025-03-09 01:20:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:47,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510533585] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:47,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:47,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 01:20:47,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433331980] [2025-03-09 01:20:47,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:47,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:20:47,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:47,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:20:47,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:20:47,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 87 [2025-03-09 01:20:47,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 134 transitions, 1062 flow. Second operand has 11 states, 11 states have (on average 49.54545454545455) internal successors, (545), 11 states have internal predecessors, (545), 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-09 01:20:47,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:47,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 87 [2025-03-09 01:20:47,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:51,633 INFO L124 PetriNetUnfolderBase]: 28248/48922 cut-off events. [2025-03-09 01:20:51,633 INFO L125 PetriNetUnfolderBase]: For 119480/125524 co-relation queries the response was YES. [2025-03-09 01:20:51,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128597 conditions, 48922 events. 28248/48922 cut-off events. For 119480/125524 co-relation queries the response was YES. Maximal size of possible extension queue 1997. Compared 454270 event pairs, 9294 based on Foata normal form. 0/47467 useless extension candidates. Maximal degree in co-relation 125819. Up to 13189 conditions per place. [2025-03-09 01:20:52,052 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 160 selfloop transitions, 37 changer transitions 0/222 dead transitions. [2025-03-09 01:20:52,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 222 transitions, 2075 flow [2025-03-09 01:20:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:20:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:20:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 433 transitions. [2025-03-09 01:20:52,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7110016420361248 [2025-03-09 01:20:52,053 INFO L175 Difference]: Start difference. First operand has 155 places, 134 transitions, 1062 flow. Second operand 7 states and 433 transitions. [2025-03-09 01:20:52,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 222 transitions, 2075 flow [2025-03-09 01:20:52,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 222 transitions, 2052 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:52,270 INFO L231 Difference]: Finished difference. Result has 158 places, 134 transitions, 1132 flow [2025-03-09 01:20:52,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1132, PETRI_PLACES=158, PETRI_TRANSITIONS=134} [2025-03-09 01:20:52,270 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 74 predicate places. [2025-03-09 01:20:52,270 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 134 transitions, 1132 flow [2025-03-09 01:20:52,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.54545454545455) internal successors, (545), 11 states have internal predecessors, (545), 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-09 01:20:52,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:52,271 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:52,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:52,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 01:20:52,471 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-03-09 01:20:52,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash -660018909, now seen corresponding path program 1 times [2025-03-09 01:20:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:52,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200906014] [2025-03-09 01:20:52,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:52,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:52,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:20:52,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:20:52,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:52,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:52,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:52,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200906014] [2025-03-09 01:20:52,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200906014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:52,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521148337] [2025-03-09 01:20:52,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:52,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:52,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:52,540 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:52,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:20:52,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:20:52,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:20:52,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:52,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:52,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:20:52,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:52,675 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-09 01:20:52,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:52,735 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-09 01:20:52,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521148337] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:52,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:52,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-09 01:20:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079619842] [2025-03-09 01:20:52,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:52,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:20:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:52,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:20:52,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:20:52,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 87 [2025-03-09 01:20:52,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 134 transitions, 1132 flow. Second operand has 16 states, 16 states have (on average 51.3125) internal successors, (821), 16 states have internal predecessors, (821), 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-09 01:20:52,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:52,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 87 [2025-03-09 01:20:52,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand