./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-vector-add.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 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:14:28,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:14:28,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:14:28,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:14:28,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:14:28,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:14:28,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:14:28,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:14:28,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:14:28,239 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:14:28,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:14:28,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:14:28,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:14:28,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:14:28,240 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:14:28,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:14:28,240 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:14:28,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:14:28,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:14:28,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:14:28,241 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:14:28,241 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:14:28,241 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:14:28,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:14:28,241 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:14:28,241 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:14:28,241 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:14:28,241 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:14:28,241 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:14:28,241 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:14:28,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:14:28,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:14:28,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:14:28,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:14:28,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:14:28,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:14:28,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:14:28,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:14:28,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:14:28,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:14:28,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:14:28,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:14:28,243 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2025-03-04 10:14:28,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:14:28,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:14:28,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:14:28,488 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:14:28,489 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:14:28,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-03-04 10:14:29,630 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/936339e3d/71e89aba58d743688ee8c11a8886233a/FLAG830b7b7ff [2025-03-04 10:14:29,873 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:14:29,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-03-04 10:14:29,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/936339e3d/71e89aba58d743688ee8c11a8886233a/FLAG830b7b7ff [2025-03-04 10:14:30,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/936339e3d/71e89aba58d743688ee8c11a8886233a [2025-03-04 10:14:30,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:14:30,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:14:30,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:14:30,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:14:30,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:14:30,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:14:30" (1/1) ... [2025-03-04 10:14:30,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae087c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:30, skipping insertion in model container [2025-03-04 10:14:30,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:14:30" (1/1) ... [2025-03-04 10:14:30,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:14:30,359 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:14:30,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:14:30,373 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:14:30,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:14:30,410 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:14:30,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:30 WrapperNode [2025-03-04 10:14:30,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:14:30,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:14:30,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:14:30,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:14:30,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:30" (1/1) ... [2025-03-04 10:14:30,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:30" (1/1) ... [2025-03-04 10:14:30,441 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 175 [2025-03-04 10:14:30,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:14:30,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:14:30,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:14:30,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:14:30,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:30" (1/1) ... [2025-03-04 10:14:30,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:30" (1/1) ... [2025-03-04 10:14:30,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:30" (1/1) ... [2025-03-04 10:14:30,478 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 7 writes are split as follows [0, 7]. [2025-03-04 10:14:30,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:30" (1/1) ... [2025-03-04 10:14:30,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:30" (1/1) ... [2025-03-04 10:14:30,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:30" (1/1) ... [2025-03-04 10:14:30,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:30" (1/1) ... [2025-03-04 10:14:30,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:30" (1/1) ... [2025-03-04 10:14:30,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:30" (1/1) ... [2025-03-04 10:14:30,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:14:30,503 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:14:30,503 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:14:30,503 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:14:30,504 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:30" (1/1) ... [2025-03-04 10:14:30,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:14:30,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:30,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:14:30,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:14:30,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:14:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:14:30,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:14:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:14:30,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:14:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:14:30,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:14:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:14:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:14:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:14:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:14:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:14:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:14:30,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:14:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:14:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:14:30,545 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:14:30,623 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:14:30,624 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:14:31,002 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:14:31,002 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:14:31,172 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:14:31,172 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:14:31,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:14:31 BoogieIcfgContainer [2025-03-04 10:14:31,173 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:14:31,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:14:31,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:14:31,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:14:31,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:14:30" (1/3) ... [2025-03-04 10:14:31,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d95013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:14:31, skipping insertion in model container [2025-03-04 10:14:31,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:30" (2/3) ... [2025-03-04 10:14:31,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d95013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:14:31, skipping insertion in model container [2025-03-04 10:14:31,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:14:31" (3/3) ... [2025-03-04 10:14:31,182 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2025-03-04 10:14:31,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:14:31,194 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-vector-add.wvr.c that has 4 procedures, 74 locations, 1 initial locations, 7 loop locations, and 32 error locations. [2025-03-04 10:14:31,194 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:14:31,254 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:14:31,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 80 transitions, 181 flow [2025-03-04 10:14:31,320 INFO L124 PetriNetUnfolderBase]: 7/77 cut-off events. [2025-03-04 10:14:31,321 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:14:31,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 77 events. 7/77 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 206 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-03-04 10:14:31,324 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 80 transitions, 181 flow [2025-03-04 10:14:31,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 76 transitions, 170 flow [2025-03-04 10:14:31,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:14:31,347 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;@658d8d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:14:31,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-03-04 10:14:31,351 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:14:31,351 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:14:31,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:14:31,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:31,352 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:14:31,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:31,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash 662393, now seen corresponding path program 1 times [2025-03-04 10:14:31,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:31,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449240454] [2025-03-04 10:14:31,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:31,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:14:31,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:14:31,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:31,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:31,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:31,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449240454] [2025-03-04 10:14:31,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449240454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:31,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:31,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:14:31,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823704224] [2025-03-04 10:14:31,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:31,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:14:31,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:31,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:14:31,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:14:31,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2025-03-04 10:14:31,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:31,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:31,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2025-03-04 10:14:31,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:31,819 INFO L124 PetriNetUnfolderBase]: 203/522 cut-off events. [2025-03-04 10:14:31,819 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 10:14:31,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 522 events. 203/522 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2857 event pairs, 124 based on Foata normal form. 1/379 useless extension candidates. Maximal degree in co-relation 741. Up to 294 conditions per place. [2025-03-04 10:14:31,827 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 31 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-03-04 10:14:31,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 224 flow [2025-03-04 10:14:31,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:14:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:14:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2025-03-04 10:14:31,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6708333333333333 [2025-03-04 10:14:31,842 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 170 flow. Second operand 3 states and 161 transitions. [2025-03-04 10:14:31,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 224 flow [2025-03-04 10:14:31,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 212 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:14:31,850 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 150 flow [2025-03-04 10:14:31,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2025-03-04 10:14:31,854 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -10 predicate places. [2025-03-04 10:14:31,854 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 150 flow [2025-03-04 10:14:31,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:31,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:31,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:14:31,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:14:31,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:31,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash 662394, now seen corresponding path program 1 times [2025-03-04 10:14:31,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:31,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087341884] [2025-03-04 10:14:31,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:31,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:31,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:14:31,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:14:31,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:31,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:32,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:32,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087341884] [2025-03-04 10:14:32,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087341884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:32,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:32,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:14:32,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078527429] [2025-03-04 10:14:32,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:32,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:14:32,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:32,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:14:32,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:14:32,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2025-03-04 10:14:32,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:32,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:32,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2025-03-04 10:14:32,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:32,309 INFO L124 PetriNetUnfolderBase]: 204/525 cut-off events. [2025-03-04 10:14:32,309 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:14:32,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 525 events. 204/525 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2856 event pairs, 124 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 810. Up to 311 conditions per place. [2025-03-04 10:14:32,313 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 36 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2025-03-04 10:14:32,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 73 transitions, 236 flow [2025-03-04 10:14:32,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:14:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:14:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2025-03-04 10:14:32,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-03-04 10:14:32,315 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 150 flow. Second operand 4 states and 205 transitions. [2025-03-04 10:14:32,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 73 transitions, 236 flow [2025-03-04 10:14:32,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:32,336 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 173 flow [2025-03-04 10:14:32,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2025-03-04 10:14:32,337 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -7 predicate places. [2025-03-04 10:14:32,337 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 173 flow [2025-03-04 10:14:32,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:32,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:32,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:14:32,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:14:32,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:32,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:32,338 INFO L85 PathProgramCache]: Analyzing trace with hash 20536346, now seen corresponding path program 1 times [2025-03-04 10:14:32,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:32,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754565750] [2025-03-04 10:14:32,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:32,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:32,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:14:32,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:14:32,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:32,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:32,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:32,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754565750] [2025-03-04 10:14:32,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754565750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:32,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:32,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:14:32,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373885747] [2025-03-04 10:14:32,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:32,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:14:32,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:32,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:14:32,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:14:32,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 80 [2025-03-04 10:14:32,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:32,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:32,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 80 [2025-03-04 10:14:32,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:32,560 INFO L124 PetriNetUnfolderBase]: 207/540 cut-off events. [2025-03-04 10:14:32,560 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:14:32,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 889 conditions, 540 events. 207/540 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2968 event pairs, 124 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 823. Up to 308 conditions per place. [2025-03-04 10:14:32,565 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 35 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2025-03-04 10:14:32,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 85 transitions, 293 flow [2025-03-04 10:14:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:14:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:14:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2025-03-04 10:14:32,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.721875 [2025-03-04 10:14:32,568 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 173 flow. Second operand 4 states and 231 transitions. [2025-03-04 10:14:32,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 85 transitions, 293 flow [2025-03-04 10:14:32,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 85 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:14:32,571 INFO L231 Difference]: Finished difference. Result has 76 places, 82 transitions, 248 flow [2025-03-04 10:14:32,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=76, PETRI_TRANSITIONS=82} [2025-03-04 10:14:32,572 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -3 predicate places. [2025-03-04 10:14:32,572 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 82 transitions, 248 flow [2025-03-04 10:14:32,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:32,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:32,573 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:14:32,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:14:32,573 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:32,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:32,574 INFO L85 PathProgramCache]: Analyzing trace with hash 636582041, now seen corresponding path program 1 times [2025-03-04 10:14:32,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:32,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141458974] [2025-03-04 10:14:32,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:32,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:32,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:14:32,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:14:32,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:32,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:32,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:32,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141458974] [2025-03-04 10:14:32,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141458974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:32,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893778047] [2025-03-04 10:14:32,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:32,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:32,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:32,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:32,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:14:32,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:14:32,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:14:32,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:32,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:32,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:14:32,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:32,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:14:33,078 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-04 10:14:33,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:33,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893778047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:33,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:33,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:14:33,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090767294] [2025-03-04 10:14:33,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:33,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:33,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:33,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:33,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:33,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2025-03-04 10:14:33,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 82 transitions, 248 flow. Second operand has 11 states, 11 states have (on average 42.36363636363637) internal successors, (466), 11 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:33,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:33,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2025-03-04 10:14:33,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:33,893 INFO L124 PetriNetUnfolderBase]: 207/539 cut-off events. [2025-03-04 10:14:33,893 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:14:33,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 539 events. 207/539 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2956 event pairs, 124 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 829. Up to 322 conditions per place. [2025-03-04 10:14:33,897 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 41 selfloop transitions, 7 changer transitions 0/81 dead transitions. [2025-03-04 10:14:33,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 340 flow [2025-03-04 10:14:33,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:14:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:14:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 286 transitions. [2025-03-04 10:14:33,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5958333333333333 [2025-03-04 10:14:33,900 INFO L175 Difference]: Start difference. First operand has 76 places, 82 transitions, 248 flow. Second operand 6 states and 286 transitions. [2025-03-04 10:14:33,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 340 flow [2025-03-04 10:14:33,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 81 transitions, 340 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:14:33,904 INFO L231 Difference]: Finished difference. Result has 80 places, 81 transitions, 258 flow [2025-03-04 10:14:33,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=80, PETRI_TRANSITIONS=81} [2025-03-04 10:14:33,904 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2025-03-04 10:14:33,905 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 81 transitions, 258 flow [2025-03-04 10:14:33,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 42.36363636363637) internal successors, (466), 11 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:33,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:33,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:14:33,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:14:34,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:34,107 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:34,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:34,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1740791077, now seen corresponding path program 1 times [2025-03-04 10:14:34,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:34,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160156756] [2025-03-04 10:14:34,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:34,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:34,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:14:34,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:14:34,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:34,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:34,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:34,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160156756] [2025-03-04 10:14:34,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160156756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:34,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536753352] [2025-03-04 10:14:34,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:34,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:34,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:34,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:34,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:14:34,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:14:34,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:14:34,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:34,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:34,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:14:34,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:34,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:14:34,450 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:14:34,450 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 32 treesize of output 27 [2025-03-04 10:14:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:34,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:34,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536753352] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:34,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:14:34,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-03-04 10:14:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913043923] [2025-03-04 10:14:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:34,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:14:34,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:34,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:14:34,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:14:34,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2025-03-04 10:14:34,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 81 transitions, 258 flow. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:34,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:34,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2025-03-04 10:14:34,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:34,862 INFO L124 PetriNetUnfolderBase]: 405/1043 cut-off events. [2025-03-04 10:14:34,862 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 10:14:34,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 1043 events. 405/1043 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6749 event pairs, 248 based on Foata normal form. 3/775 useless extension candidates. Maximal degree in co-relation 892. Up to 310 conditions per place. [2025-03-04 10:14:34,868 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 62 selfloop transitions, 11 changer transitions 0/106 dead transitions. [2025-03-04 10:14:34,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 106 transitions, 471 flow [2025-03-04 10:14:34,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:14:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:14:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 279 transitions. [2025-03-04 10:14:34,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6975 [2025-03-04 10:14:34,869 INFO L175 Difference]: Start difference. First operand has 80 places, 81 transitions, 258 flow. Second operand 5 states and 279 transitions. [2025-03-04 10:14:34,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 106 transitions, 471 flow [2025-03-04 10:14:34,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 106 transitions, 441 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-04 10:14:34,871 INFO L231 Difference]: Finished difference. Result has 78 places, 82 transitions, 269 flow [2025-03-04 10:14:34,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=78, PETRI_TRANSITIONS=82} [2025-03-04 10:14:34,872 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -1 predicate places. [2025-03-04 10:14:34,872 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 82 transitions, 269 flow [2025-03-04 10:14:34,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:34,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:34,872 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:34,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:14:35,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:35,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:35,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:35,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2137040400, now seen corresponding path program 1 times [2025-03-04 10:14:35,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:35,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795521017] [2025-03-04 10:14:35,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:35,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:35,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:14:35,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:14:35,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:35,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:35,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:35,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795521017] [2025-03-04 10:14:35,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795521017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:35,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035285436] [2025-03-04 10:14:35,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:35,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:35,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:35,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:35,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:14:35,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:14:35,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:14:35,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:35,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:35,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:14:35,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:35,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:35,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035285436] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:35,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:35,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:14:35,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914163548] [2025-03-04 10:14:35,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:35,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:14:35,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:35,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:14:35,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:14:35,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 80 [2025-03-04 10:14:35,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 82 transitions, 269 flow. Second operand has 13 states, 13 states have (on average 46.53846153846154) internal successors, (605), 13 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:35,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:35,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 80 [2025-03-04 10:14:35,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:35,680 INFO L124 PetriNetUnfolderBase]: 610/1575 cut-off events. [2025-03-04 10:14:35,681 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-04 10:14:35,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 1575 events. 610/1575 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9779 event pairs, 372 based on Foata normal form. 3/1167 useless extension candidates. Maximal degree in co-relation 844. Up to 590 conditions per place. [2025-03-04 10:14:35,689 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 54 selfloop transitions, 39 changer transitions 0/129 dead transitions. [2025-03-04 10:14:35,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 129 transitions, 645 flow [2025-03-04 10:14:35,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:14:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:14:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 500 transitions. [2025-03-04 10:14:35,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-03-04 10:14:35,691 INFO L175 Difference]: Start difference. First operand has 78 places, 82 transitions, 269 flow. Second operand 9 states and 500 transitions. [2025-03-04 10:14:35,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 129 transitions, 645 flow [2025-03-04 10:14:35,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 129 transitions, 643 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:14:35,694 INFO L231 Difference]: Finished difference. Result has 87 places, 103 transitions, 503 flow [2025-03-04 10:14:35,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=503, PETRI_PLACES=87, PETRI_TRANSITIONS=103} [2025-03-04 10:14:35,694 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 8 predicate places. [2025-03-04 10:14:35,694 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 103 transitions, 503 flow [2025-03-04 10:14:35,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.53846153846154) internal successors, (605), 13 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:35,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:35,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:35,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:35,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:35,896 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:35,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:35,896 INFO L85 PathProgramCache]: Analyzing trace with hash 575150342, now seen corresponding path program 1 times [2025-03-04 10:14:35,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:35,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388611064] [2025-03-04 10:14:35,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:35,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:35,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:14:35,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:14:35,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:35,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:35,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:35,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388611064] [2025-03-04 10:14:35,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388611064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:35,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:35,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:14:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099080157] [2025-03-04 10:14:35,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:35,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:14:35,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:35,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:14:35,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:14:36,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-03-04 10:14:36,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 103 transitions, 503 flow. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:36,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:36,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-03-04 10:14:36,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:36,271 INFO L124 PetriNetUnfolderBase]: 874/2158 cut-off events. [2025-03-04 10:14:36,271 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-03-04 10:14:36,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 2158 events. 874/2158 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 13787 event pairs, 496 based on Foata normal form. 2/1590 useless extension candidates. Maximal degree in co-relation 1408. Up to 781 conditions per place. [2025-03-04 10:14:36,283 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 71 selfloop transitions, 27 changer transitions 1/134 dead transitions. [2025-03-04 10:14:36,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 134 transitions, 789 flow [2025-03-04 10:14:36,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:14:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:14:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 343 transitions. [2025-03-04 10:14:36,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7145833333333333 [2025-03-04 10:14:36,285 INFO L175 Difference]: Start difference. First operand has 87 places, 103 transitions, 503 flow. Second operand 6 states and 343 transitions. [2025-03-04 10:14:36,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 134 transitions, 789 flow [2025-03-04 10:14:36,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 134 transitions, 692 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-03-04 10:14:36,289 INFO L231 Difference]: Finished difference. Result has 90 places, 105 transitions, 480 flow [2025-03-04 10:14:36,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=90, PETRI_TRANSITIONS=105} [2025-03-04 10:14:36,289 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 11 predicate places. [2025-03-04 10:14:36,289 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 105 transitions, 480 flow [2025-03-04 10:14:36,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:36,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:36,290 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:14:36,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:14:36,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:36,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:36,291 INFO L85 PathProgramCache]: Analyzing trace with hash -646863791, now seen corresponding path program 2 times [2025-03-04 10:14:36,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:36,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306754305] [2025-03-04 10:14:36,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:36,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:36,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 10:14:36,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:14:36,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:36,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:14:36,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:36,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306754305] [2025-03-04 10:14:36,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306754305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:36,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962607565] [2025-03-04 10:14:36,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:36,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:36,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:36,467 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:36,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:14:36,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 10:14:36,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:14:36,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:36,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:36,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:14:36,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:36,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:14:36,629 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:14:36,629 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 32 treesize of output 27 [2025-03-04 10:14:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:14:36,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:14:36,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962607565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:36,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:36,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2025-03-04 10:14:36,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603737265] [2025-03-04 10:14:36,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:36,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:14:36,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:36,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:14:36,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:14:37,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2025-03-04 10:14:37,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 105 transitions, 480 flow. Second operand has 16 states, 16 states have (on average 42.75) internal successors, (684), 16 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:37,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:37,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2025-03-04 10:14:37,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:38,295 INFO L124 PetriNetUnfolderBase]: 1128/3208 cut-off events. [2025-03-04 10:14:38,295 INFO L125 PetriNetUnfolderBase]: For 603/603 co-relation queries the response was YES. [2025-03-04 10:14:38,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5745 conditions, 3208 events. 1128/3208 cut-off events. For 603/603 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 25819 event pairs, 744 based on Foata normal form. 6/2297 useless extension candidates. Maximal degree in co-relation 2582. Up to 854 conditions per place. [2025-03-04 10:14:38,313 INFO L140 encePairwiseOnDemand]: 64/80 looper letters, 59 selfloop transitions, 46 changer transitions 0/138 dead transitions. [2025-03-04 10:14:38,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 138 transitions, 857 flow [2025-03-04 10:14:38,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 546 transitions. [2025-03-04 10:14:38,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6204545454545455 [2025-03-04 10:14:38,317 INFO L175 Difference]: Start difference. First operand has 90 places, 105 transitions, 480 flow. Second operand 11 states and 546 transitions. [2025-03-04 10:14:38,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 138 transitions, 857 flow [2025-03-04 10:14:38,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 138 transitions, 779 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:14:38,326 INFO L231 Difference]: Finished difference. Result has 94 places, 111 transitions, 581 flow [2025-03-04 10:14:38,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=581, PETRI_PLACES=94, PETRI_TRANSITIONS=111} [2025-03-04 10:14:38,327 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 15 predicate places. [2025-03-04 10:14:38,328 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 111 transitions, 581 flow [2025-03-04 10:14:38,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 42.75) internal successors, (684), 16 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:38,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:38,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:38,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:38,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:38,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:38,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:38,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1390230036, now seen corresponding path program 1 times [2025-03-04 10:14:38,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:38,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235828994] [2025-03-04 10:14:38,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:38,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:38,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:14:38,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:14:38,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:38,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:38,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:38,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235828994] [2025-03-04 10:14:38,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235828994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:38,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:38,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:14:38,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898998960] [2025-03-04 10:14:38,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:38,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:14:38,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:38,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:14:38,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:14:38,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-03-04 10:14:38,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 111 transitions, 581 flow. Second operand has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:38,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:38,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-03-04 10:14:38,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:38,917 INFO L124 PetriNetUnfolderBase]: 1236/3082 cut-off events. [2025-03-04 10:14:38,917 INFO L125 PetriNetUnfolderBase]: For 759/855 co-relation queries the response was YES. [2025-03-04 10:14:38,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5813 conditions, 3082 events. 1236/3082 cut-off events. For 759/855 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 22201 event pairs, 744 based on Foata normal form. 0/2280 useless extension candidates. Maximal degree in co-relation 2564. Up to 1176 conditions per place. [2025-03-04 10:14:38,934 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 70 selfloop transitions, 32 changer transitions 3/137 dead transitions. [2025-03-04 10:14:38,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 137 transitions, 883 flow [2025-03-04 10:14:38,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:14:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:14:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 339 transitions. [2025-03-04 10:14:38,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.70625 [2025-03-04 10:14:38,936 INFO L175 Difference]: Start difference. First operand has 94 places, 111 transitions, 581 flow. Second operand 6 states and 339 transitions. [2025-03-04 10:14:38,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 137 transitions, 883 flow [2025-03-04 10:14:38,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 137 transitions, 819 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-04 10:14:38,941 INFO L231 Difference]: Finished difference. Result has 97 places, 113 transitions, 601 flow [2025-03-04 10:14:38,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=601, PETRI_PLACES=97, PETRI_TRANSITIONS=113} [2025-03-04 10:14:38,942 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 18 predicate places. [2025-03-04 10:14:38,943 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 113 transitions, 601 flow [2025-03-04 10:14:38,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:38,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:38,943 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:38,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:14:38,943 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:38,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:38,944 INFO L85 PathProgramCache]: Analyzing trace with hash -302154241, now seen corresponding path program 1 times [2025-03-04 10:14:38,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:38,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989001277] [2025-03-04 10:14:38,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:38,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:38,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:14:38,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:14:38,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:38,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:39,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:39,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989001277] [2025-03-04 10:14:39,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989001277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:39,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:39,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:14:39,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858440186] [2025-03-04 10:14:39,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:39,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:14:39,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:39,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:14:39,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:14:39,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-03-04 10:14:39,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 113 transitions, 601 flow. Second operand has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:39,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:39,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-03-04 10:14:39,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:39,313 INFO L124 PetriNetUnfolderBase]: 1014/2177 cut-off events. [2025-03-04 10:14:39,314 INFO L125 PetriNetUnfolderBase]: For 1113/1284 co-relation queries the response was YES. [2025-03-04 10:14:39,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4871 conditions, 2177 events. 1014/2177 cut-off events. For 1113/1284 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12887 event pairs, 659 based on Foata normal form. 0/1693 useless extension candidates. Maximal degree in co-relation 2501. Up to 1128 conditions per place. [2025-03-04 10:14:39,320 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 48 selfloop transitions, 19 changer transitions 35/134 dead transitions. [2025-03-04 10:14:39,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 134 transitions, 895 flow [2025-03-04 10:14:39,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:14:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:14:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 336 transitions. [2025-03-04 10:14:39,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-04 10:14:39,322 INFO L175 Difference]: Start difference. First operand has 97 places, 113 transitions, 601 flow. Second operand 6 states and 336 transitions. [2025-03-04 10:14:39,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 134 transitions, 895 flow [2025-03-04 10:14:39,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 134 transitions, 841 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:14:39,330 INFO L231 Difference]: Finished difference. Result has 101 places, 96 transitions, 462 flow [2025-03-04 10:14:39,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=462, PETRI_PLACES=101, PETRI_TRANSITIONS=96} [2025-03-04 10:14:39,331 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 22 predicate places. [2025-03-04 10:14:39,332 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 96 transitions, 462 flow [2025-03-04 10:14:39,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:39,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:39,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:39,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:14:39,332 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:39,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:39,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1487962978, now seen corresponding path program 1 times [2025-03-04 10:14:39,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:39,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073040803] [2025-03-04 10:14:39,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:39,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:39,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:14:39,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:14:39,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:39,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:14:39,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:39,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073040803] [2025-03-04 10:14:39,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073040803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:39,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:39,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:14:39,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371784612] [2025-03-04 10:14:39,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:39,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:14:39,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:39,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:14:39,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:14:39,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2025-03-04 10:14:39,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 462 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 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-04 10:14:39,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:39,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2025-03-04 10:14:39,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:39,793 INFO L124 PetriNetUnfolderBase]: 1293/2724 cut-off events. [2025-03-04 10:14:39,794 INFO L125 PetriNetUnfolderBase]: For 691/931 co-relation queries the response was YES. [2025-03-04 10:14:39,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5705 conditions, 2724 events. 1293/2724 cut-off events. For 691/931 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 18710 event pairs, 918 based on Foata normal form. 0/2330 useless extension candidates. Maximal degree in co-relation 2837. Up to 1864 conditions per place. [2025-03-04 10:14:39,806 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 59 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2025-03-04 10:14:39,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 93 transitions, 588 flow [2025-03-04 10:14:39,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:14:39,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:14:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2025-03-04 10:14:39,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.535 [2025-03-04 10:14:39,807 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 462 flow. Second operand 5 states and 214 transitions. [2025-03-04 10:14:39,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 93 transitions, 588 flow [2025-03-04 10:14:39,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 93 transitions, 499 flow, removed 16 selfloop flow, removed 11 redundant places. [2025-03-04 10:14:39,814 INFO L231 Difference]: Finished difference. Result has 83 places, 93 transitions, 381 flow [2025-03-04 10:14:39,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=83, PETRI_TRANSITIONS=93} [2025-03-04 10:14:39,815 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 4 predicate places. [2025-03-04 10:14:39,815 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 93 transitions, 381 flow [2025-03-04 10:14:39,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 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-04 10:14:39,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:39,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:39,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:14:39,815 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:39,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:39,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1487962977, now seen corresponding path program 1 times [2025-03-04 10:14:39,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:39,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926839672] [2025-03-04 10:14:39,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:39,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:39,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:14:39,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:14:39,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:39,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:40,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:40,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926839672] [2025-03-04 10:14:40,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926839672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:40,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504744503] [2025-03-04 10:14:40,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:40,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:40,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:40,102 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:40,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:14:40,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:14:40,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:14:40,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:40,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:40,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 10:14:40,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:40,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:14:40,214 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 10:14:40,214 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 20 treesize of output 22 [2025-03-04 10:14:40,309 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 10:14:40,310 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 3 case distinctions, treesize of input 34 treesize of output 37 [2025-03-04 10:14:40,386 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-03-04 10:14:40,387 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 3 case distinctions, treesize of input 28 treesize of output 31 [2025-03-04 10:14:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:14:40,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:14:40,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504744503] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:40,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:14:40,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 15 [2025-03-04 10:14:40,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781960332] [2025-03-04 10:14:40,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:40,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:14:40,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:40,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:14:40,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:14:40,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2025-03-04 10:14:40,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 93 transitions, 381 flow. Second operand has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:40,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:40,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2025-03-04 10:14:40,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:41,327 INFO L124 PetriNetUnfolderBase]: 1212/2931 cut-off events. [2025-03-04 10:14:41,327 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 10:14:41,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4888 conditions, 2931 events. 1212/2931 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 22192 event pairs, 507 based on Foata normal form. 0/2182 useless extension candidates. Maximal degree in co-relation 1615. Up to 1135 conditions per place. [2025-03-04 10:14:41,338 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 66 selfloop transitions, 13 changer transitions 0/107 dead transitions. [2025-03-04 10:14:41,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 107 transitions, 575 flow [2025-03-04 10:14:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:14:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:14:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 352 transitions. [2025-03-04 10:14:41,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-04 10:14:41,341 INFO L175 Difference]: Start difference. First operand has 83 places, 93 transitions, 381 flow. Second operand 7 states and 352 transitions. [2025-03-04 10:14:41,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 107 transitions, 575 flow [2025-03-04 10:14:41,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 107 transitions, 565 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:14:41,343 INFO L231 Difference]: Finished difference. Result has 88 places, 95 transitions, 419 flow [2025-03-04 10:14:41,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=419, PETRI_PLACES=88, PETRI_TRANSITIONS=95} [2025-03-04 10:14:41,344 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 9 predicate places. [2025-03-04 10:14:41,345 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 419 flow [2025-03-04 10:14:41,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:41,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:41,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:41,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:41,550 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,SelfDestructingSolverStorable11 [2025-03-04 10:14:41,552 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:41,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1117788563, now seen corresponding path program 1 times [2025-03-04 10:14:41,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:41,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437390429] [2025-03-04 10:14:41,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:41,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:41,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:14:41,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:14:41,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:41,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:14:41,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:41,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437390429] [2025-03-04 10:14:41,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437390429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:41,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:41,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:14:41,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245554713] [2025-03-04 10:14:41,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:41,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:14:41,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:41,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:14:41,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:14:41,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2025-03-04 10:14:41,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 95 transitions, 419 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 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-04 10:14:41,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:41,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2025-03-04 10:14:41,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:41,962 INFO L124 PetriNetUnfolderBase]: 1713/3546 cut-off events. [2025-03-04 10:14:41,963 INFO L125 PetriNetUnfolderBase]: For 1297/1408 co-relation queries the response was YES. [2025-03-04 10:14:41,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7389 conditions, 3546 events. 1713/3546 cut-off events. For 1297/1408 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 25580 event pairs, 1158 based on Foata normal form. 0/3214 useless extension candidates. Maximal degree in co-relation 2448. Up to 2404 conditions per place. [2025-03-04 10:14:41,978 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 59 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2025-03-04 10:14:41,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 92 transitions, 547 flow [2025-03-04 10:14:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:14:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:14:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2025-03-04 10:14:41,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.535 [2025-03-04 10:14:41,980 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 419 flow. Second operand 5 states and 214 transitions. [2025-03-04 10:14:41,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 92 transitions, 547 flow [2025-03-04 10:14:41,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 92 transitions, 537 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:14:41,982 INFO L231 Difference]: Finished difference. Result has 86 places, 92 transitions, 419 flow [2025-03-04 10:14:41,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=419, PETRI_PLACES=86, PETRI_TRANSITIONS=92} [2025-03-04 10:14:41,984 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 7 predicate places. [2025-03-04 10:14:41,984 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 92 transitions, 419 flow [2025-03-04 10:14:41,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 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-04 10:14:41,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:41,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:41,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:14:41,984 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:41,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:41,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1117788564, now seen corresponding path program 1 times [2025-03-04 10:14:41,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:41,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462247041] [2025-03-04 10:14:41,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:41,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:41,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:14:42,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:14:42,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:42,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:42,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:14:42,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:42,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462247041] [2025-03-04 10:14:42,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462247041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:42,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404055308] [2025-03-04 10:14:42,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:42,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:42,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:42,237 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:42,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:14:42,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:14:42,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:14:42,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:42,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:42,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 10:14:42,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:42,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:14:42,367 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 10:14:42,367 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 25 treesize of output 25 [2025-03-04 10:14:42,429 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-03-04 10:14:42,430 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 3 case distinctions, treesize of input 28 treesize of output 31 [2025-03-04 10:14:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:14:42,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:14:42,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404055308] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:42,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:14:42,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 16 [2025-03-04 10:14:42,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867976158] [2025-03-04 10:14:42,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:42,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:14:42,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:42,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:14:42,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:14:43,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2025-03-04 10:14:43,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 92 transitions, 419 flow. Second operand has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:43,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:43,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2025-03-04 10:14:43,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:43,487 INFO L124 PetriNetUnfolderBase]: 1212/2703 cut-off events. [2025-03-04 10:14:43,487 INFO L125 PetriNetUnfolderBase]: For 439/565 co-relation queries the response was YES. [2025-03-04 10:14:43,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5315 conditions, 2703 events. 1212/2703 cut-off events. For 439/565 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 18836 event pairs, 507 based on Foata normal form. 63/2272 useless extension candidates. Maximal degree in co-relation 1756. Up to 1135 conditions per place. [2025-03-04 10:14:43,500 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 65 selfloop transitions, 13 changer transitions 0/104 dead transitions. [2025-03-04 10:14:43,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 104 transitions, 601 flow [2025-03-04 10:14:43,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:14:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:14:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 352 transitions. [2025-03-04 10:14:43,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-04 10:14:43,501 INFO L175 Difference]: Start difference. First operand has 86 places, 92 transitions, 419 flow. Second operand 7 states and 352 transitions. [2025-03-04 10:14:43,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 104 transitions, 601 flow [2025-03-04 10:14:43,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 104 transitions, 589 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:14:43,504 INFO L231 Difference]: Finished difference. Result has 91 places, 93 transitions, 451 flow [2025-03-04 10:14:43,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=451, PETRI_PLACES=91, PETRI_TRANSITIONS=93} [2025-03-04 10:14:43,505 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 12 predicate places. [2025-03-04 10:14:43,505 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 93 transitions, 451 flow [2025-03-04 10:14:43,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:43,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:43,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:43,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:14:43,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:43,706 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:43,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:43,707 INFO L85 PathProgramCache]: Analyzing trace with hash 232760197, now seen corresponding path program 1 times [2025-03-04 10:14:43,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:43,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113202122] [2025-03-04 10:14:43,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:43,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:43,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:14:43,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:14:43,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:43,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:43,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:43,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113202122] [2025-03-04 10:14:43,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113202122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:43,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404376573] [2025-03-04 10:14:43,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:43,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:43,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:43,917 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:43,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:14:43,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:14:43,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:14:43,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:43,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:43,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 10:14:43,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:43,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:14:44,027 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 10:14:44,028 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 20 treesize of output 22 [2025-03-04 10:14:44,103 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 10:14:44,103 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 3 case distinctions, treesize of input 34 treesize of output 37 [2025-03-04 10:14:44,161 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-03-04 10:14:44,161 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 3 case distinctions, treesize of input 28 treesize of output 31 [2025-03-04 10:14:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:14:44,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:14:44,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404376573] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:44,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:14:44,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 15 [2025-03-04 10:14:44,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833436132] [2025-03-04 10:14:44,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:44,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:14:44,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:44,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:14:44,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:14:44,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2025-03-04 10:14:44,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 93 transitions, 451 flow. Second operand has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:44,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:44,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2025-03-04 10:14:44,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:45,097 INFO L124 PetriNetUnfolderBase]: 1629/3624 cut-off events. [2025-03-04 10:14:45,097 INFO L125 PetriNetUnfolderBase]: For 5476/6124 co-relation queries the response was YES. [2025-03-04 10:14:45,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8181 conditions, 3624 events. 1629/3624 cut-off events. For 5476/6124 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 27899 event pairs, 702 based on Foata normal form. 0/2935 useless extension candidates. Maximal degree in co-relation 2711. Up to 1486 conditions per place. [2025-03-04 10:14:45,117 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 67 selfloop transitions, 13 changer transitions 0/107 dead transitions. [2025-03-04 10:14:45,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 107 transitions, 673 flow [2025-03-04 10:14:45,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:14:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:14:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 351 transitions. [2025-03-04 10:14:45,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6267857142857143 [2025-03-04 10:14:45,121 INFO L175 Difference]: Start difference. First operand has 91 places, 93 transitions, 451 flow. Second operand 7 states and 351 transitions. [2025-03-04 10:14:45,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 107 transitions, 673 flow [2025-03-04 10:14:45,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 107 transitions, 652 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:45,124 INFO L231 Difference]: Finished difference. Result has 94 places, 95 transitions, 481 flow [2025-03-04 10:14:45,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=481, PETRI_PLACES=94, PETRI_TRANSITIONS=95} [2025-03-04 10:14:45,125 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 15 predicate places. [2025-03-04 10:14:45,125 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 95 transitions, 481 flow [2025-03-04 10:14:45,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:45,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:45,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:45,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:45,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:45,330 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:45,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:45,330 INFO L85 PathProgramCache]: Analyzing trace with hash 291707712, now seen corresponding path program 1 times [2025-03-04 10:14:45,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:45,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792329023] [2025-03-04 10:14:45,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:45,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:45,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:14:45,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:14:45,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:45,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:14:45,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:45,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792329023] [2025-03-04 10:14:45,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792329023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:45,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:45,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:14:45,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870928570] [2025-03-04 10:14:45,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:45,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:14:45,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:45,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:14:45,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:14:45,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 80 [2025-03-04 10:14:45,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 95 transitions, 481 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:45,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:45,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 80 [2025-03-04 10:14:45,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:45,595 INFO L124 PetriNetUnfolderBase]: 1044/2379 cut-off events. [2025-03-04 10:14:45,595 INFO L125 PetriNetUnfolderBase]: For 4062/4653 co-relation queries the response was YES. [2025-03-04 10:14:45,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6165 conditions, 2379 events. 1044/2379 cut-off events. For 4062/4653 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 17192 event pairs, 702 based on Foata normal form. 84/2065 useless extension candidates. Maximal degree in co-relation 2038. Up to 1489 conditions per place. [2025-03-04 10:14:45,608 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 57 selfloop transitions, 9 changer transitions 0/93 dead transitions. [2025-03-04 10:14:45,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 93 transitions, 609 flow [2025-03-04 10:14:45,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:14:45,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:14:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2025-03-04 10:14:45,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.565 [2025-03-04 10:14:45,609 INFO L175 Difference]: Start difference. First operand has 94 places, 95 transitions, 481 flow. Second operand 5 states and 226 transitions. [2025-03-04 10:14:45,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 93 transitions, 609 flow [2025-03-04 10:14:45,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 595 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:14:45,612 INFO L231 Difference]: Finished difference. Result has 92 places, 93 transitions, 481 flow [2025-03-04 10:14:45,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=481, PETRI_PLACES=92, PETRI_TRANSITIONS=93} [2025-03-04 10:14:45,613 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 13 predicate places. [2025-03-04 10:14:45,613 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 93 transitions, 481 flow [2025-03-04 10:14:45,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:45,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:45,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:45,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:14:45,613 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:45,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:45,614 INFO L85 PathProgramCache]: Analyzing trace with hash 291707713, now seen corresponding path program 1 times [2025-03-04 10:14:45,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:45,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282008715] [2025-03-04 10:14:45,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:45,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:45,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:14:45,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:14:45,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:45,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:14:45,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:45,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282008715] [2025-03-04 10:14:45,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282008715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:45,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330350164] [2025-03-04 10:14:45,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:45,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:45,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:45,759 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:45,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:14:45,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:14:45,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:14:45,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:45,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:45,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 10:14:45,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:45,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:14:45,871 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 10:14:45,871 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 25 treesize of output 25 [2025-03-04 10:14:45,920 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-03-04 10:14:45,920 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 3 case distinctions, treesize of input 28 treesize of output 31 [2025-03-04 10:14:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:14:46,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:14:46,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330350164] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:46,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:14:46,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 15 [2025-03-04 10:14:46,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678113858] [2025-03-04 10:14:46,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:46,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:14:46,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:46,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:14:46,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:14:46,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-03-04 10:14:46,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 93 transitions, 481 flow. Second operand has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:46,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:46,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-03-04 10:14:46,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:46,658 INFO L124 PetriNetUnfolderBase]: 1374/3099 cut-off events. [2025-03-04 10:14:46,659 INFO L125 PetriNetUnfolderBase]: For 3537/3936 co-relation queries the response was YES. [2025-03-04 10:14:46,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8107 conditions, 3099 events. 1374/3099 cut-off events. For 3537/3936 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 23082 event pairs, 702 based on Foata normal form. 180/2854 useless extension candidates. Maximal degree in co-relation 2684. Up to 1588 conditions per place. [2025-03-04 10:14:46,675 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 64 selfloop transitions, 15 changer transitions 0/106 dead transitions. [2025-03-04 10:14:46,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 106 transitions, 688 flow [2025-03-04 10:14:46,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:14:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:14:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2025-03-04 10:14:46,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.628125 [2025-03-04 10:14:46,677 INFO L175 Difference]: Start difference. First operand has 92 places, 93 transitions, 481 flow. Second operand 8 states and 402 transitions. [2025-03-04 10:14:46,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 106 transitions, 688 flow [2025-03-04 10:14:46,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 106 transitions, 674 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:14:46,681 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 513 flow [2025-03-04 10:14:46,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=513, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2025-03-04 10:14:46,682 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 18 predicate places. [2025-03-04 10:14:46,682 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 513 flow [2025-03-04 10:14:46,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:46,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:46,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:46,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:14:46,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:14:46,887 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:46,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:46,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1374367878, now seen corresponding path program 1 times [2025-03-04 10:14:46,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:46,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368151657] [2025-03-04 10:14:46,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:46,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:46,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:14:46,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:14:46,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:46,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:14:47,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:47,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368151657] [2025-03-04 10:14:47,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368151657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:47,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73143452] [2025-03-04 10:14:47,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:47,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:47,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:47,101 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:47,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:14:47,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:14:47,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:14:47,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:47,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:47,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 10:14:47,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:47,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:14:47,222 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 10:14:47,223 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 25 treesize of output 25 [2025-03-04 10:14:47,283 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-03-04 10:14:47,284 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 3 case distinctions, treesize of input 23 treesize of output 28 [2025-03-04 10:14:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:14:47,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:14:47,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73143452] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:47,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:14:47,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 16 [2025-03-04 10:14:47,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971020489] [2025-03-04 10:14:47,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:47,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:14:47,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:47,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:14:47,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:14:47,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2025-03-04 10:14:47,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 513 flow. Second operand has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:47,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:47,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2025-03-04 10:14:47,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:48,375 INFO L124 PetriNetUnfolderBase]: 1773/3684 cut-off events. [2025-03-04 10:14:48,375 INFO L125 PetriNetUnfolderBase]: For 10261/11161 co-relation queries the response was YES. [2025-03-04 10:14:48,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10635 conditions, 3684 events. 1773/3684 cut-off events. For 10261/11161 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 26927 event pairs, 702 based on Foata normal form. 69/3176 useless extension candidates. Maximal degree in co-relation 3527. Up to 1588 conditions per place. [2025-03-04 10:14:48,393 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 68 selfloop transitions, 13 changer transitions 0/107 dead transitions. [2025-03-04 10:14:48,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 107 transitions, 744 flow [2025-03-04 10:14:48,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:14:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:14:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 351 transitions. [2025-03-04 10:14:48,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6267857142857143 [2025-03-04 10:14:48,395 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 513 flow. Second operand 7 states and 351 transitions. [2025-03-04 10:14:48,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 107 transitions, 744 flow [2025-03-04 10:14:48,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 107 transitions, 705 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 10:14:48,400 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 525 flow [2025-03-04 10:14:48,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=525, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2025-03-04 10:14:48,400 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 19 predicate places. [2025-03-04 10:14:48,400 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 525 flow [2025-03-04 10:14:48,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:48,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:48,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:48,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:14:48,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:14:48,605 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:48,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:48,605 INFO L85 PathProgramCache]: Analyzing trace with hash 344269351, now seen corresponding path program 1 times [2025-03-04 10:14:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:48,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549723468] [2025-03-04 10:14:48,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:48,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:48,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:14:48,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:14:48,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:48,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:14:48,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:48,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549723468] [2025-03-04 10:14:48,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549723468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:48,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705774127] [2025-03-04 10:14:48,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:48,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:48,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:48,718 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-04 10:14:48,720 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-04 10:14:48,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:14:48,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:14:48,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:48,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:48,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 10:14:48,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:48,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:14:48,815 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 15 treesize of output 11 [2025-03-04 10:14:48,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:14:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:14:48,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:14:48,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705774127] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:48,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:14:48,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 11 [2025-03-04 10:14:48,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35661474] [2025-03-04 10:14:48,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:48,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:14:48,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:48,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:14:48,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:14:49,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-03-04 10:14:49,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 525 flow. Second operand has 7 states, 7 states have (on average 46.57142857142857) internal successors, (326), 7 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:49,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:49,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-03-04 10:14:49,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:49,448 INFO L124 PetriNetUnfolderBase]: 1503/3417 cut-off events. [2025-03-04 10:14:49,449 INFO L125 PetriNetUnfolderBase]: For 7346/8027 co-relation queries the response was YES. [2025-03-04 10:14:49,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10331 conditions, 3417 events. 1503/3417 cut-off events. For 7346/8027 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 26188 event pairs, 702 based on Foata normal form. 123/3070 useless extension candidates. Maximal degree in co-relation 3425. Up to 1693 conditions per place. [2025-03-04 10:14:49,462 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 69 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2025-03-04 10:14:49,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 108 transitions, 755 flow [2025-03-04 10:14:49,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:14:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:14:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 357 transitions. [2025-03-04 10:14:49,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6375 [2025-03-04 10:14:49,463 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 525 flow. Second operand 7 states and 357 transitions. [2025-03-04 10:14:49,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 108 transitions, 755 flow [2025-03-04 10:14:49,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 108 transitions, 736 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:49,467 INFO L231 Difference]: Finished difference. Result has 100 places, 96 transitions, 545 flow [2025-03-04 10:14:49,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=545, PETRI_PLACES=100, PETRI_TRANSITIONS=96} [2025-03-04 10:14:49,468 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 21 predicate places. [2025-03-04 10:14:49,468 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 96 transitions, 545 flow [2025-03-04 10:14:49,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.57142857142857) internal successors, (326), 7 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:49,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:49,468 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:49,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:14:49,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:49,673 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:49,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:49,673 INFO L85 PathProgramCache]: Analyzing trace with hash 318330263, now seen corresponding path program 1 times [2025-03-04 10:14:49,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:49,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291054318] [2025-03-04 10:14:49,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:49,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:14:49,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:14:49,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:49,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:49,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:49,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291054318] [2025-03-04 10:14:49,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291054318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:49,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085275665] [2025-03-04 10:14:49,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:49,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:49,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:49,916 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-04 10:14:49,918 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-04 10:14:49,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:14:49,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:14:49,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:49,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:49,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 10:14:49,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:49,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:14:50,065 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 10:14:50,065 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 20 treesize of output 22 [2025-03-04 10:14:50,150 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 10:14:50,151 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 3 case distinctions, treesize of input 34 treesize of output 37 [2025-03-04 10:14:50,219 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 10:14:50,220 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 3 case distinctions, treesize of input 34 treesize of output 37 [2025-03-04 10:14:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:50,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:50,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:50,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085275665] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:50,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:50,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2025-03-04 10:14:50,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807760238] [2025-03-04 10:14:50,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:50,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:14:50,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:50,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:14:50,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:14:52,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 80 [2025-03-04 10:14:52,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 96 transitions, 545 flow. Second operand has 24 states, 24 states have (on average 31.583333333333332) internal successors, (758), 24 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:52,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:52,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 80 [2025-03-04 10:14:52,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:53,593 INFO L124 PetriNetUnfolderBase]: 3829/6654 cut-off events. [2025-03-04 10:14:53,593 INFO L125 PetriNetUnfolderBase]: For 22010/23500 co-relation queries the response was YES. [2025-03-04 10:14:53,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22748 conditions, 6654 events. 3829/6654 cut-off events. For 22010/23500 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 45405 event pairs, 1164 based on Foata normal form. 0/5877 useless extension candidates. Maximal degree in co-relation 7545. Up to 1574 conditions per place. [2025-03-04 10:14:53,625 INFO L140 encePairwiseOnDemand]: 65/80 looper letters, 142 selfloop transitions, 44 changer transitions 0/208 dead transitions. [2025-03-04 10:14:53,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 208 transitions, 1652 flow [2025-03-04 10:14:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:14:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:14:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 699 transitions. [2025-03-04 10:14:53,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4598684210526316 [2025-03-04 10:14:53,627 INFO L175 Difference]: Start difference. First operand has 100 places, 96 transitions, 545 flow. Second operand 19 states and 699 transitions. [2025-03-04 10:14:53,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 208 transitions, 1652 flow [2025-03-04 10:14:53,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 208 transitions, 1589 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:14:53,634 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 689 flow [2025-03-04 10:14:53,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=689, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2025-03-04 10:14:53,635 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 34 predicate places. [2025-03-04 10:14:53,635 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 689 flow [2025-03-04 10:14:53,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 31.583333333333332) internal successors, (758), 24 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:53,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:53,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:53,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:53,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:53,836 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:53,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:53,836 INFO L85 PathProgramCache]: Analyzing trace with hash 344269350, now seen corresponding path program 1 times [2025-03-04 10:14:53,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:53,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096842311] [2025-03-04 10:14:53,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:53,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:53,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:14:53,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:14:53,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:53,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:14:53,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:53,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096842311] [2025-03-04 10:14:53,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096842311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:53,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:53,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:14:53,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645750790] [2025-03-04 10:14:53,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:53,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:14:53,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:53,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:14:53,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:14:53,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 80 [2025-03-04 10:14:53,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 689 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:53,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:53,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 80 [2025-03-04 10:14:53,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:54,094 INFO L124 PetriNetUnfolderBase]: 1237/2511 cut-off events. [2025-03-04 10:14:54,094 INFO L125 PetriNetUnfolderBase]: For 7370/8009 co-relation queries the response was YES. [2025-03-04 10:14:54,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9123 conditions, 2511 events. 1237/2511 cut-off events. For 7370/8009 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16443 event pairs, 702 based on Foata normal form. 180/2415 useless extension candidates. Maximal degree in co-relation 6068. Up to 1694 conditions per place. [2025-03-04 10:14:54,107 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 72 selfloop transitions, 6 changer transitions 0/104 dead transitions. [2025-03-04 10:14:54,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 104 transitions, 839 flow [2025-03-04 10:14:54,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:14:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:14:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2025-03-04 10:14:54,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5875 [2025-03-04 10:14:54,109 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 689 flow. Second operand 4 states and 188 transitions. [2025-03-04 10:14:54,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 104 transitions, 839 flow [2025-03-04 10:14:54,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 104 transitions, 814 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:14:54,113 INFO L231 Difference]: Finished difference. Result has 109 places, 104 transitions, 670 flow [2025-03-04 10:14:54,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=670, PETRI_PLACES=109, PETRI_TRANSITIONS=104} [2025-03-04 10:14:54,114 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 30 predicate places. [2025-03-04 10:14:54,114 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 104 transitions, 670 flow [2025-03-04 10:14:54,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:54,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:54,115 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:54,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:14:54,115 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:54,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:54,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1158259718, now seen corresponding path program 1 times [2025-03-04 10:14:54,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:54,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153052411] [2025-03-04 10:14:54,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:54,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:54,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:14:54,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:14:54,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:54,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:54,186 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:54,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:54,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153052411] [2025-03-04 10:14:54,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153052411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:54,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617412337] [2025-03-04 10:14:54,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:54,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:54,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:54,189 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:54,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:14:54,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:14:54,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:14:54,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:54,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:54,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:14:54,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:54,319 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:54,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:54,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617412337] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:54,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:54,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:14:54,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578616338] [2025-03-04 10:14:54,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:54,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:14:54,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:54,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:14:54,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:14:54,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-03-04 10:14:54,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 104 transitions, 670 flow. Second operand has 14 states, 14 states have (on average 46.357142857142854) internal successors, (649), 14 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:54,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:54,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-03-04 10:14:54,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:54,723 INFO L124 PetriNetUnfolderBase]: 1513/2910 cut-off events. [2025-03-04 10:14:54,723 INFO L125 PetriNetUnfolderBase]: For 7518/8054 co-relation queries the response was YES. [2025-03-04 10:14:54,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10099 conditions, 2910 events. 1513/2910 cut-off events. For 7518/8054 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 17952 event pairs, 578 based on Foata normal form. 68/2753 useless extension candidates. Maximal degree in co-relation 7008. Up to 818 conditions per place. [2025-03-04 10:14:54,736 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 95 selfloop transitions, 45 changer transitions 0/165 dead transitions. [2025-03-04 10:14:54,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 165 transitions, 1255 flow [2025-03-04 10:14:54,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:14:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:14:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 548 transitions. [2025-03-04 10:14:54,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.685 [2025-03-04 10:14:54,737 INFO L175 Difference]: Start difference. First operand has 109 places, 104 transitions, 670 flow. Second operand 10 states and 548 transitions. [2025-03-04 10:14:54,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 165 transitions, 1255 flow [2025-03-04 10:14:54,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 165 transitions, 1248 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:54,743 INFO L231 Difference]: Finished difference. Result has 119 places, 108 transitions, 808 flow [2025-03-04 10:14:54,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=808, PETRI_PLACES=119, PETRI_TRANSITIONS=108} [2025-03-04 10:14:54,743 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 40 predicate places. [2025-03-04 10:14:54,743 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 108 transitions, 808 flow [2025-03-04 10:14:54,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 46.357142857142854) internal successors, (649), 14 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:54,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:54,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:54,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:14:54,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 10:14:54,948 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:54,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:54,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1278304180, now seen corresponding path program 1 times [2025-03-04 10:14:54,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:54,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028135700] [2025-03-04 10:14:54,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:54,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:54,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:14:54,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:14:54,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:54,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:55,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:55,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028135700] [2025-03-04 10:14:55,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028135700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:55,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088121072] [2025-03-04 10:14:55,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:55,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:55,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:55,196 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:55,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:14:55,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:14:55,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:14:55,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:55,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:55,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 10:14:55,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:55,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:14:55,366 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 10:14:55,367 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 25 treesize of output 25 [2025-03-04 10:14:55,418 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 10:14:55,418 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 3 case distinctions, treesize of input 34 treesize of output 37 [2025-03-04 10:14:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:55,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:55,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088121072] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:55,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:55,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 26 [2025-03-04 10:14:55,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280191362] [2025-03-04 10:14:55,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:55,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:14:55,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:55,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:14:55,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:14:57,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 80 [2025-03-04 10:14:57,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 108 transitions, 808 flow. Second operand has 28 states, 28 states have (on average 34.25) internal successors, (959), 28 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:57,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:57,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 80 [2025-03-04 10:14:57,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:59,003 INFO L124 PetriNetUnfolderBase]: 3305/5732 cut-off events. [2025-03-04 10:14:59,003 INFO L125 PetriNetUnfolderBase]: For 21187/21907 co-relation queries the response was YES. [2025-03-04 10:14:59,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21358 conditions, 5732 events. 3305/5732 cut-off events. For 21187/21907 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 37075 event pairs, 1028 based on Foata normal form. 0/5482 useless extension candidates. Maximal degree in co-relation 14696. Up to 1418 conditions per place. [2025-03-04 10:14:59,027 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 149 selfloop transitions, 42 changer transitions 0/209 dead transitions. [2025-03-04 10:14:59,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 209 transitions, 1947 flow [2025-03-04 10:14:59,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:14:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 10:14:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 847 transitions. [2025-03-04 10:14:59,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48125 [2025-03-04 10:14:59,028 INFO L175 Difference]: Start difference. First operand has 119 places, 108 transitions, 808 flow. Second operand 22 states and 847 transitions. [2025-03-04 10:14:59,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 209 transitions, 1947 flow [2025-03-04 10:14:59,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 209 transitions, 1856 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 10:14:59,040 INFO L231 Difference]: Finished difference. Result has 134 places, 109 transitions, 833 flow [2025-03-04 10:14:59,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=833, PETRI_PLACES=134, PETRI_TRANSITIONS=109} [2025-03-04 10:14:59,040 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 55 predicate places. [2025-03-04 10:14:59,040 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 109 transitions, 833 flow [2025-03-04 10:14:59,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 34.25) internal successors, (959), 28 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:59,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:59,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:59,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:59,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 10:14:59,245 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:14:59,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:59,245 INFO L85 PathProgramCache]: Analyzing trace with hash 972724537, now seen corresponding path program 1 times [2025-03-04 10:14:59,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:59,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251584884] [2025-03-04 10:14:59,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:59,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:14:59,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:14:59,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:59,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:59,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:59,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251584884] [2025-03-04 10:14:59,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251584884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:59,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458445316] [2025-03-04 10:14:59,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:59,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:59,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:59,421 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:59,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:14:59,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:14:59,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:14:59,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:59,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:59,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 10:14:59,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:59,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:14:59,557 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 15 treesize of output 11 [2025-03-04 10:14:59,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:14:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:59,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:59,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458445316] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:59,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:59,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-03-04 10:14:59,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862547904] [2025-03-04 10:14:59,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:59,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:14:59,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:59,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:14:59,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:15:00,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 80 [2025-03-04 10:15:00,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 109 transitions, 833 flow. Second operand has 26 states, 26 states have (on average 41.42307692307692) internal successors, (1077), 26 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:00,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:00,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 80 [2025-03-04 10:15:00,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:01,579 INFO L124 PetriNetUnfolderBase]: 2140/3667 cut-off events. [2025-03-04 10:15:01,579 INFO L125 PetriNetUnfolderBase]: For 19409/20941 co-relation queries the response was YES. [2025-03-04 10:15:01,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15986 conditions, 3667 events. 2140/3667 cut-off events. For 19409/20941 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 22338 event pairs, 648 based on Foata normal form. 148/3505 useless extension candidates. Maximal degree in co-relation 12333. Up to 809 conditions per place. [2025-03-04 10:15:01,597 INFO L140 encePairwiseOnDemand]: 62/80 looper letters, 183 selfloop transitions, 53 changer transitions 0/258 dead transitions. [2025-03-04 10:15:01,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 258 transitions, 2396 flow [2025-03-04 10:15:01,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:15:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:15:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 927 transitions. [2025-03-04 10:15:01,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6098684210526316 [2025-03-04 10:15:01,598 INFO L175 Difference]: Start difference. First operand has 134 places, 109 transitions, 833 flow. Second operand 19 states and 927 transitions. [2025-03-04 10:15:01,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 258 transitions, 2396 flow [2025-03-04 10:15:01,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 258 transitions, 2284 flow, removed 6 selfloop flow, removed 14 redundant places. [2025-03-04 10:15:01,608 INFO L231 Difference]: Finished difference. Result has 138 places, 119 transitions, 883 flow [2025-03-04 10:15:01,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=883, PETRI_PLACES=138, PETRI_TRANSITIONS=119} [2025-03-04 10:15:01,609 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 59 predicate places. [2025-03-04 10:15:01,609 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 119 transitions, 883 flow [2025-03-04 10:15:01,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 41.42307692307692) internal successors, (1077), 26 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:01,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:01,610 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:01,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:15:01,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:01,814 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:01,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:01,814 INFO L85 PathProgramCache]: Analyzing trace with hash 130386668, now seen corresponding path program 1 times [2025-03-04 10:15:01,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:01,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997413978] [2025-03-04 10:15:01,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:01,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:01,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:15:01,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:15:01,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:01,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:01,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:01,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997413978] [2025-03-04 10:15:01,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997413978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:01,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888041797] [2025-03-04 10:15:01,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:01,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:01,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:01,893 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:01,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:15:01,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:15:01,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:15:01,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:01,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:01,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:15:01,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:02,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:02,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888041797] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:02,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:02,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 10:15:02,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643713985] [2025-03-04 10:15:02,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:02,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:15:02,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:02,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:15:02,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:15:02,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-03-04 10:15:02,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 119 transitions, 883 flow. Second operand has 16 states, 16 states have (on average 46.4375) internal successors, (743), 16 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:02,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:02,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-03-04 10:15:02,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:02,570 INFO L124 PetriNetUnfolderBase]: 2087/3708 cut-off events. [2025-03-04 10:15:02,570 INFO L125 PetriNetUnfolderBase]: For 17296/18252 co-relation queries the response was YES. [2025-03-04 10:15:02,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15231 conditions, 3708 events. 2087/3708 cut-off events. For 17296/18252 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 22943 event pairs, 739 based on Foata normal form. 123/3716 useless extension candidates. Maximal degree in co-relation 12049. Up to 904 conditions per place. [2025-03-04 10:15:02,589 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 104 selfloop transitions, 45 changer transitions 0/175 dead transitions. [2025-03-04 10:15:02,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 175 transitions, 1505 flow [2025-03-04 10:15:02,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:15:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:15:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 546 transitions. [2025-03-04 10:15:02,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6825 [2025-03-04 10:15:02,590 INFO L175 Difference]: Start difference. First operand has 138 places, 119 transitions, 883 flow. Second operand 10 states and 546 transitions. [2025-03-04 10:15:02,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 175 transitions, 1505 flow [2025-03-04 10:15:02,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 175 transitions, 1442 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 10:15:02,599 INFO L231 Difference]: Finished difference. Result has 143 places, 123 transitions, 965 flow [2025-03-04 10:15:02,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=965, PETRI_PLACES=143, PETRI_TRANSITIONS=123} [2025-03-04 10:15:02,600 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 64 predicate places. [2025-03-04 10:15:02,600 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 123 transitions, 965 flow [2025-03-04 10:15:02,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 46.4375) internal successors, (743), 16 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:02,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:02,601 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:02,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:15:02,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:02,801 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:02,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:02,801 INFO L85 PathProgramCache]: Analyzing trace with hash 143598110, now seen corresponding path program 2 times [2025-03-04 10:15:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:02,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554610795] [2025-03-04 10:15:02,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:02,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:02,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 10:15:02,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:15:02,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:02,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:15:03,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:03,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554610795] [2025-03-04 10:15:03,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554610795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:03,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790088467] [2025-03-04 10:15:03,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:03,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:03,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:03,065 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:03,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:15:03,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 10:15:03,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:15:03,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:03,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:03,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 10:15:03,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:03,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:15:03,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:15:03,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:15:03,234 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 25 treesize of output 18 [2025-03-04 10:15:03,246 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 10:15:03,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 10:15:03,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:15:03,297 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 25 treesize of output 18 [2025-03-04 10:15:03,302 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:15:03,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:15:03,348 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:15:03,348 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 23 treesize of output 20 [2025-03-04 10:15:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:15:03,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:06,702 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_603 Int)) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_285| Int)) (<= (+ c_~A~0.offset 8) (select (store |c_#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_285| v_ArrVal_603) c_~A~0.base))) (< v_ArrVal_603 (* 4 (mod c_~N~0 1073741824))))) (<= 0 (+ c_~A~0.offset 4))) is different from false [2025-03-04 10:15:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:15:07,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790088467] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:07,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:07,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-03-04 10:15:07,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071326172] [2025-03-04 10:15:07,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:07,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:15:07,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:07,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:15:07,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=528, Unknown=1, NotChecked=46, Total=650 [2025-03-04 10:15:07,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 80 [2025-03-04 10:15:07,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 123 transitions, 965 flow. Second operand has 26 states, 26 states have (on average 7.615384615384615) internal successors, (198), 26 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:07,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:07,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 80 [2025-03-04 10:15:07,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:09,906 INFO L124 PetriNetUnfolderBase]: 9006/12613 cut-off events. [2025-03-04 10:15:09,906 INFO L125 PetriNetUnfolderBase]: For 33667/33905 co-relation queries the response was YES. [2025-03-04 10:15:09,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47728 conditions, 12613 events. 9006/12613 cut-off events. For 33667/33905 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 61566 event pairs, 937 based on Foata normal form. 315/12423 useless extension candidates. Maximal degree in co-relation 47679. Up to 3276 conditions per place. [2025-03-04 10:15:09,968 INFO L140 encePairwiseOnDemand]: 66/80 looper letters, 238 selfloop transitions, 37 changer transitions 0/277 dead transitions. [2025-03-04 10:15:09,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 277 transitions, 2224 flow [2025-03-04 10:15:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:15:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:15:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 343 transitions. [2025-03-04 10:15:09,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2256578947368421 [2025-03-04 10:15:09,969 INFO L175 Difference]: Start difference. First operand has 143 places, 123 transitions, 965 flow. Second operand 19 states and 343 transitions. [2025-03-04 10:15:09,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 277 transitions, 2224 flow [2025-03-04 10:15:09,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 277 transitions, 2062 flow, removed 10 selfloop flow, removed 14 redundant places. [2025-03-04 10:15:09,988 INFO L231 Difference]: Finished difference. Result has 140 places, 106 transitions, 805 flow [2025-03-04 10:15:09,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=805, PETRI_PLACES=140, PETRI_TRANSITIONS=106} [2025-03-04 10:15:09,989 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 61 predicate places. [2025-03-04 10:15:09,989 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 106 transitions, 805 flow [2025-03-04 10:15:09,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.615384615384615) internal successors, (198), 26 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:09,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:09,989 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:09,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 10:15:10,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 10:15:10,190 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:10,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:10,190 INFO L85 PathProgramCache]: Analyzing trace with hash 156574709, now seen corresponding path program 1 times [2025-03-04 10:15:10,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:10,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584312689] [2025-03-04 10:15:10,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:10,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:10,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:15:10,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:15:10,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:10,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:15:10,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:10,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584312689] [2025-03-04 10:15:10,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584312689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:10,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140252874] [2025-03-04 10:15:10,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:10,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:10,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:10,546 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:10,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:15:10,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:15:10,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:15:10,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:10,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:10,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 10:15:10,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:10,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:15:10,667 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 10:15:10,668 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 20 treesize of output 22 [2025-03-04 10:15:10,725 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-03-04 10:15:10,726 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 3 case distinctions, treesize of input 23 treesize of output 28 [2025-03-04 10:15:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:15:11,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 10:15:11,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140252874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:11,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:11,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 28 [2025-03-04 10:15:11,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316762696] [2025-03-04 10:15:11,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:11,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 10:15:11,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:11,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 10:15:11,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:15:13,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 80 [2025-03-04 10:15:13,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 106 transitions, 805 flow. Second operand has 29 states, 29 states have (on average 36.37931034482759) internal successors, (1055), 29 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:13,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:13,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 80 [2025-03-04 10:15:13,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:14,972 INFO L124 PetriNetUnfolderBase]: 1567/2749 cut-off events. [2025-03-04 10:15:14,972 INFO L125 PetriNetUnfolderBase]: For 15703/16555 co-relation queries the response was YES. [2025-03-04 10:15:14,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11599 conditions, 2749 events. 1567/2749 cut-off events. For 15703/16555 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 14654 event pairs, 573 based on Foata normal form. 102/2766 useless extension candidates. Maximal degree in co-relation 7643. Up to 651 conditions per place. [2025-03-04 10:15:14,982 INFO L140 encePairwiseOnDemand]: 65/80 looper letters, 122 selfloop transitions, 31 changer transitions 0/172 dead transitions. [2025-03-04 10:15:14,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 172 transitions, 1446 flow [2025-03-04 10:15:14,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:15:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:15:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 782 transitions. [2025-03-04 10:15:14,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5144736842105263 [2025-03-04 10:15:14,984 INFO L175 Difference]: Start difference. First operand has 140 places, 106 transitions, 805 flow. Second operand 19 states and 782 transitions. [2025-03-04 10:15:14,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 172 transitions, 1446 flow [2025-03-04 10:15:14,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 172 transitions, 1368 flow, removed 6 selfloop flow, removed 15 redundant places. [2025-03-04 10:15:14,991 INFO L231 Difference]: Finished difference. Result has 146 places, 106 transitions, 793 flow [2025-03-04 10:15:14,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=793, PETRI_PLACES=146, PETRI_TRANSITIONS=106} [2025-03-04 10:15:14,991 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 67 predicate places. [2025-03-04 10:15:14,992 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 106 transitions, 793 flow [2025-03-04 10:15:14,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 36.37931034482759) internal successors, (1055), 29 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:14,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:14,992 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:14,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:15:15,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 10:15:15,192 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:15,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:15,193 INFO L85 PathProgramCache]: Analyzing trace with hash 465317766, now seen corresponding path program 1 times [2025-03-04 10:15:15,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:15,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426805191] [2025-03-04 10:15:15,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:15,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:15,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:15:15,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:15:15,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:15,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:15:15,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:15,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426805191] [2025-03-04 10:15:15,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426805191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:15,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241301310] [2025-03-04 10:15:15,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:15,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:15,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:15,258 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:15,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:15:15,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:15:15,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:15:15,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:15,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:15,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:15:15,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:15,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:15,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241301310] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:15,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:15:15,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-04 10:15:15,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595282514] [2025-03-04 10:15:15,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:15,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:15:15,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:15,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:15:15,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:15:15,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-03-04 10:15:15,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 106 transitions, 793 flow. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:15,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:15,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-03-04 10:15:15,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:15,610 INFO L124 PetriNetUnfolderBase]: 1111/2188 cut-off events. [2025-03-04 10:15:15,610 INFO L125 PetriNetUnfolderBase]: For 11444/11995 co-relation queries the response was YES. [2025-03-04 10:15:15,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9117 conditions, 2188 events. 1111/2188 cut-off events. For 11444/11995 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 12428 event pairs, 406 based on Foata normal form. 34/2111 useless extension candidates. Maximal degree in co-relation 6093. Up to 927 conditions per place. [2025-03-04 10:15:15,622 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 92 selfloop transitions, 10 changer transitions 0/126 dead transitions. [2025-03-04 10:15:15,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 126 transitions, 1123 flow [2025-03-04 10:15:15,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:15:15,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:15:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 268 transitions. [2025-03-04 10:15:15,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.67 [2025-03-04 10:15:15,623 INFO L175 Difference]: Start difference. First operand has 146 places, 106 transitions, 793 flow. Second operand 5 states and 268 transitions. [2025-03-04 10:15:15,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 126 transitions, 1123 flow [2025-03-04 10:15:15,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 126 transitions, 1031 flow, removed 0 selfloop flow, removed 20 redundant places. [2025-03-04 10:15:15,630 INFO L231 Difference]: Finished difference. Result has 131 places, 106 transitions, 728 flow [2025-03-04 10:15:15,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=728, PETRI_PLACES=131, PETRI_TRANSITIONS=106} [2025-03-04 10:15:15,631 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 52 predicate places. [2025-03-04 10:15:15,631 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 106 transitions, 728 flow [2025-03-04 10:15:15,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:15,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:15,631 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:15,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:15:15,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:15:15,832 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:15,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:15,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1842428, now seen corresponding path program 2 times [2025-03-04 10:15:15,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:15,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064059532] [2025-03-04 10:15:15,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:15,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:15,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 10:15:15,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:15:15,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:15,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:15:16,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:16,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064059532] [2025-03-04 10:15:16,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064059532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:16,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418189038] [2025-03-04 10:15:16,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:16,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:16,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:16,131 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:16,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:15:16,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 10:15:16,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:15:16,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:16,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:16,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 10:15:16,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:16,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:15:16,288 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 10:15:16,288 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 25 treesize of output 25 [2025-03-04 10:15:16,359 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 10:15:16,359 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 3 case distinctions, treesize of input 29 treesize of output 34 [2025-03-04 10:15:16,437 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-03-04 10:15:16,437 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 3 case distinctions, treesize of input 23 treesize of output 28 [2025-03-04 10:15:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:15:16,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:15:16,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418189038] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:16,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:16,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 25 [2025-03-04 10:15:16,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657595845] [2025-03-04 10:15:16,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:16,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 10:15:16,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:16,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 10:15:16,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:15:19,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 80 [2025-03-04 10:15:19,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 106 transitions, 728 flow. Second operand has 27 states, 27 states have (on average 31.666666666666668) internal successors, (855), 27 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:19,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:19,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 80 [2025-03-04 10:15:19,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:21,432 INFO L124 PetriNetUnfolderBase]: 3118/5232 cut-off events. [2025-03-04 10:15:21,432 INFO L125 PetriNetUnfolderBase]: For 26147/26655 co-relation queries the response was YES. [2025-03-04 10:15:21,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19752 conditions, 5232 events. 3118/5232 cut-off events. For 26147/26655 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 30441 event pairs, 456 based on Foata normal form. 168/5388 useless extension candidates. Maximal degree in co-relation 15051. Up to 852 conditions per place. [2025-03-04 10:15:21,459 INFO L140 encePairwiseOnDemand]: 66/80 looper letters, 166 selfloop transitions, 37 changer transitions 0/224 dead transitions. [2025-03-04 10:15:21,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 224 transitions, 1797 flow [2025-03-04 10:15:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:15:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:15:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 733 transitions. [2025-03-04 10:15:21,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48223684210526313 [2025-03-04 10:15:21,460 INFO L175 Difference]: Start difference. First operand has 131 places, 106 transitions, 728 flow. Second operand 19 states and 733 transitions. [2025-03-04 10:15:21,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 224 transitions, 1797 flow [2025-03-04 10:15:21,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 224 transitions, 1758 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 10:15:21,473 INFO L231 Difference]: Finished difference. Result has 147 places, 109 transitions, 816 flow [2025-03-04 10:15:21,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=816, PETRI_PLACES=147, PETRI_TRANSITIONS=109} [2025-03-04 10:15:21,473 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 68 predicate places. [2025-03-04 10:15:21,473 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 109 transitions, 816 flow [2025-03-04 10:15:21,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 31.666666666666668) internal successors, (855), 27 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:21,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:21,474 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:21,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 10:15:21,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:15:21,675 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:21,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:21,675 INFO L85 PathProgramCache]: Analyzing trace with hash 558849280, now seen corresponding path program 1 times [2025-03-04 10:15:21,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:21,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549408850] [2025-03-04 10:15:21,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:21,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:21,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:15:21,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:15:21,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:21,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:15:21,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:21,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549408850] [2025-03-04 10:15:21,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549408850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:21,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734724021] [2025-03-04 10:15:21,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:21,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:21,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:21,895 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:21,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:15:21,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:15:21,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:15:21,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:21,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:21,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 10:15:21,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:21,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:15:22,031 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 10:15:22,032 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 16 treesize of output 18 [2025-03-04 10:15:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:15:22,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:22,443 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 10:15:22,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734724021] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:22,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:22,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-03-04 10:15:22,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823233150] [2025-03-04 10:15:22,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:22,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:15:22,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:22,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:15:22,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:15:23,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2025-03-04 10:15:23,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 109 transitions, 816 flow. Second operand has 24 states, 24 states have (on average 37.583333333333336) internal successors, (902), 24 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:23,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:23,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2025-03-04 10:15:23,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:24,779 INFO L124 PetriNetUnfolderBase]: 1449/2827 cut-off events. [2025-03-04 10:15:24,779 INFO L125 PetriNetUnfolderBase]: For 18305/18973 co-relation queries the response was YES. [2025-03-04 10:15:24,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12251 conditions, 2827 events. 1449/2827 cut-off events. For 18305/18973 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 16527 event pairs, 647 based on Foata normal form. 42/2771 useless extension candidates. Maximal degree in co-relation 9120. Up to 838 conditions per place. [2025-03-04 10:15:24,794 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 104 selfloop transitions, 25 changer transitions 0/153 dead transitions. [2025-03-04 10:15:24,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 153 transitions, 1338 flow [2025-03-04 10:15:24,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:15:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:15:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 629 transitions. [2025-03-04 10:15:24,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5241666666666667 [2025-03-04 10:15:24,795 INFO L175 Difference]: Start difference. First operand has 147 places, 109 transitions, 816 flow. Second operand 15 states and 629 transitions. [2025-03-04 10:15:24,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 153 transitions, 1338 flow [2025-03-04 10:15:24,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 153 transitions, 1229 flow, removed 18 selfloop flow, removed 15 redundant places. [2025-03-04 10:15:24,805 INFO L231 Difference]: Finished difference. Result has 147 places, 109 transitions, 787 flow [2025-03-04 10:15:24,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=787, PETRI_PLACES=147, PETRI_TRANSITIONS=109} [2025-03-04 10:15:24,806 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 68 predicate places. [2025-03-04 10:15:24,806 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 109 transitions, 787 flow [2025-03-04 10:15:24,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 37.583333333333336) internal successors, (902), 24 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:24,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:24,806 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:24,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 10:15:25,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:25,007 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:25,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:25,007 INFO L85 PathProgramCache]: Analyzing trace with hash -57114661, now seen corresponding path program 1 times [2025-03-04 10:15:25,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:25,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715394231] [2025-03-04 10:15:25,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:25,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:25,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:15:25,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:15:25,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:25,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:15:25,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:25,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715394231] [2025-03-04 10:15:25,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715394231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:25,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858968627] [2025-03-04 10:15:25,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:25,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:25,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:25,374 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:25,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:15:25,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:15:25,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:15:25,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:25,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:25,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 10:15:25,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:25,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:15:25,510 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 10:15:25,510 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 20 treesize of output 22 [2025-03-04 10:15:25,574 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-03-04 10:15:25,574 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 3 case distinctions, treesize of input 23 treesize of output 28 [2025-03-04 10:15:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:15:25,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 10:15:26,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858968627] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:26,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:26,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 30 [2025-03-04 10:15:26,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439272066] [2025-03-04 10:15:26,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:26,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:15:26,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:26,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:15:26,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:15:28,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 80 [2025-03-04 10:15:28,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 109 transitions, 787 flow. Second operand has 31 states, 31 states have (on average 34.41935483870968) internal successors, (1067), 31 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:28,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:28,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 80 [2025-03-04 10:15:28,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:30,611 INFO L124 PetriNetUnfolderBase]: 3464/5635 cut-off events. [2025-03-04 10:15:30,611 INFO L125 PetriNetUnfolderBase]: For 26964/27100 co-relation queries the response was YES. [2025-03-04 10:15:30,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22971 conditions, 5635 events. 3464/5635 cut-off events. For 26964/27100 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 31705 event pairs, 947 based on Foata normal form. 84/5564 useless extension candidates. Maximal degree in co-relation 17389. Up to 1634 conditions per place. [2025-03-04 10:15:30,635 INFO L140 encePairwiseOnDemand]: 62/80 looper letters, 157 selfloop transitions, 38 changer transitions 0/213 dead transitions. [2025-03-04 10:15:30,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 213 transitions, 1787 flow [2025-03-04 10:15:30,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:15:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 10:15:30,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 809 transitions. [2025-03-04 10:15:30,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.505625 [2025-03-04 10:15:30,637 INFO L175 Difference]: Start difference. First operand has 147 places, 109 transitions, 787 flow. Second operand 20 states and 809 transitions. [2025-03-04 10:15:30,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 213 transitions, 1787 flow [2025-03-04 10:15:30,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 213 transitions, 1756 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:15:30,648 INFO L231 Difference]: Finished difference. Result has 164 places, 114 transitions, 907 flow [2025-03-04 10:15:30,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=907, PETRI_PLACES=164, PETRI_TRANSITIONS=114} [2025-03-04 10:15:30,649 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 85 predicate places. [2025-03-04 10:15:30,649 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 114 transitions, 907 flow [2025-03-04 10:15:30,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 34.41935483870968) internal successors, (1067), 31 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:30,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:30,649 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:30,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 10:15:30,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:30,850 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:30,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1770553882, now seen corresponding path program 1 times [2025-03-04 10:15:30,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:30,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218282670] [2025-03-04 10:15:30,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:30,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:30,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:15:30,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:15:30,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:30,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:15:31,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:31,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218282670] [2025-03-04 10:15:31,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218282670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:31,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077645204] [2025-03-04 10:15:31,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:31,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:31,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:31,031 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:31,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:15:31,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:15:31,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:15:31,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:31,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:31,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 10:15:31,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:31,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:15:31,222 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:15:31,222 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 32 treesize of output 27 [2025-03-04 10:15:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:15:31,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 10:15:31,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077645204] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:31,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:31,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 23 [2025-03-04 10:15:31,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662929255] [2025-03-04 10:15:31,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:31,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:15:31,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:31,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:15:31,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:15:32,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 80 [2025-03-04 10:15:32,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 114 transitions, 907 flow. Second operand has 24 states, 24 states have (on average 40.958333333333336) internal successors, (983), 24 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:32,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:32,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 80 [2025-03-04 10:15:32,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:33,825 INFO L124 PetriNetUnfolderBase]: 1946/3231 cut-off events. [2025-03-04 10:15:33,825 INFO L125 PetriNetUnfolderBase]: For 20334/20847 co-relation queries the response was YES. [2025-03-04 10:15:33,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14694 conditions, 3231 events. 1946/3231 cut-off events. For 20334/20847 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 17045 event pairs, 562 based on Foata normal form. 86/3194 useless extension candidates. Maximal degree in co-relation 10080. Up to 689 conditions per place. [2025-03-04 10:15:33,873 INFO L140 encePairwiseOnDemand]: 65/80 looper letters, 139 selfloop transitions, 33 changer transitions 0/198 dead transitions. [2025-03-04 10:15:33,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 198 transitions, 1756 flow [2025-03-04 10:15:33,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:15:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:15:33,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 679 transitions. [2025-03-04 10:15:33,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.60625 [2025-03-04 10:15:33,874 INFO L175 Difference]: Start difference. First operand has 164 places, 114 transitions, 907 flow. Second operand 14 states and 679 transitions. [2025-03-04 10:15:33,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 198 transitions, 1756 flow [2025-03-04 10:15:33,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 198 transitions, 1687 flow, removed 2 selfloop flow, removed 17 redundant places. [2025-03-04 10:15:33,885 INFO L231 Difference]: Finished difference. Result has 161 places, 115 transitions, 918 flow [2025-03-04 10:15:33,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=918, PETRI_PLACES=161, PETRI_TRANSITIONS=115} [2025-03-04 10:15:33,886 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 82 predicate places. [2025-03-04 10:15:33,886 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 115 transitions, 918 flow [2025-03-04 10:15:33,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 40.958333333333336) internal successors, (983), 24 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:33,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:33,887 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:33,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 10:15:34,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:34,087 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:34,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:34,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1386336494, now seen corresponding path program 2 times [2025-03-04 10:15:34,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:34,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646681676] [2025-03-04 10:15:34,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:34,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:34,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 10:15:34,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:15:34,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:34,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:15:34,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:34,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646681676] [2025-03-04 10:15:34,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646681676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:34,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871436627] [2025-03-04 10:15:34,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:34,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:34,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:34,186 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:34,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:15:34,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 10:15:34,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:15:34,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:34,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:34,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:15:34,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:15:34,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:15:34,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871436627] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:34,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:34,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-04 10:15:34,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067667078] [2025-03-04 10:15:34,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:34,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:15:34,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:34,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:15:34,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:15:34,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-03-04 10:15:34,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 115 transitions, 918 flow. Second operand has 19 states, 19 states have (on average 46.26315789473684) internal successors, (879), 19 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:34,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:34,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-03-04 10:15:34,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:35,287 INFO L124 PetriNetUnfolderBase]: 2427/4434 cut-off events. [2025-03-04 10:15:35,287 INFO L125 PetriNetUnfolderBase]: For 31712/32962 co-relation queries the response was YES. [2025-03-04 10:15:35,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20304 conditions, 4434 events. 2427/4434 cut-off events. For 31712/32962 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 26386 event pairs, 914 based on Foata normal form. 69/4353 useless extension candidates. Maximal degree in co-relation 15502. Up to 1311 conditions per place. [2025-03-04 10:15:35,315 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 144 selfloop transitions, 66 changer transitions 0/240 dead transitions. [2025-03-04 10:15:35,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 240 transitions, 2319 flow [2025-03-04 10:15:35,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:15:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:15:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 858 transitions. [2025-03-04 10:15:35,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6703125 [2025-03-04 10:15:35,317 INFO L175 Difference]: Start difference. First operand has 161 places, 115 transitions, 918 flow. Second operand 16 states and 858 transitions. [2025-03-04 10:15:35,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 240 transitions, 2319 flow [2025-03-04 10:15:35,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 240 transitions, 2185 flow, removed 1 selfloop flow, removed 11 redundant places. [2025-03-04 10:15:35,335 INFO L231 Difference]: Finished difference. Result has 171 places, 147 transitions, 1337 flow [2025-03-04 10:15:35,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1337, PETRI_PLACES=171, PETRI_TRANSITIONS=147} [2025-03-04 10:15:35,335 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 92 predicate places. [2025-03-04 10:15:35,335 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 147 transitions, 1337 flow [2025-03-04 10:15:35,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 46.26315789473684) internal successors, (879), 19 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:35,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:35,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:35,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 10:15:35,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:35,536 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:35,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:35,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1104607895, now seen corresponding path program 1 times [2025-03-04 10:15:35,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:35,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685909043] [2025-03-04 10:15:35,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:35,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:35,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:15:35,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:15:35,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:35,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:35,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:35,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685909043] [2025-03-04 10:15:35,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685909043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:35,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254234565] [2025-03-04 10:15:35,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:35,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:35,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:35,607 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:35,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:15:35,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:15:35,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:15:35,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:35,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:35,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:15:35,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:35,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:15:35,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:15:35,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254234565] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:35,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:15:35,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-03-04 10:15:35,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434934219] [2025-03-04 10:15:35,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:35,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:15:35,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:35,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:15:35,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:15:35,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2025-03-04 10:15:35,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 147 transitions, 1337 flow. Second operand has 7 states, 7 states have (on average 47.285714285714285) internal successors, (331), 7 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:35,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:35,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2025-03-04 10:15:35,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:36,461 INFO L124 PetriNetUnfolderBase]: 3272/6409 cut-off events. [2025-03-04 10:15:36,461 INFO L125 PetriNetUnfolderBase]: For 37609/38059 co-relation queries the response was YES. [2025-03-04 10:15:36,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28729 conditions, 6409 events. 3272/6409 cut-off events. For 37609/38059 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 44215 event pairs, 1146 based on Foata normal form. 0/5982 useless extension candidates. Maximal degree in co-relation 22295. Up to 2265 conditions per place. [2025-03-04 10:15:36,500 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 205 selfloop transitions, 30 changer transitions 0/263 dead transitions. [2025-03-04 10:15:36,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 263 transitions, 3007 flow [2025-03-04 10:15:36,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:15:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:15:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 478 transitions. [2025-03-04 10:15:36,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6638888888888889 [2025-03-04 10:15:36,501 INFO L175 Difference]: Start difference. First operand has 171 places, 147 transitions, 1337 flow. Second operand 9 states and 478 transitions. [2025-03-04 10:15:36,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 263 transitions, 3007 flow [2025-03-04 10:15:36,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 263 transitions, 2972 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:36,545 INFO L231 Difference]: Finished difference. Result has 179 places, 166 transitions, 1513 flow [2025-03-04 10:15:36,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1513, PETRI_PLACES=179, PETRI_TRANSITIONS=166} [2025-03-04 10:15:36,545 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 100 predicate places. [2025-03-04 10:15:36,545 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 166 transitions, 1513 flow [2025-03-04 10:15:36,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 47.285714285714285) internal successors, (331), 7 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:36,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:36,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:36,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 10:15:36,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:36,746 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:36,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:36,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1499330167, now seen corresponding path program 2 times [2025-03-04 10:15:36,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:36,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588479624] [2025-03-04 10:15:36,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:36,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:36,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 10:15:36,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 34 statements. [2025-03-04 10:15:36,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:15:36,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:15:36,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:36,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588479624] [2025-03-04 10:15:36,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588479624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:36,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:36,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:15:36,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88494872] [2025-03-04 10:15:36,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:36,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:15:36,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:36,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:15:36,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:15:36,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-03-04 10:15:36,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 166 transitions, 1513 flow. Second operand has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:36,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:36,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-03-04 10:15:36,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:37,560 INFO L124 PetriNetUnfolderBase]: 4028/7498 cut-off events. [2025-03-04 10:15:37,560 INFO L125 PetriNetUnfolderBase]: For 64811/66775 co-relation queries the response was YES. [2025-03-04 10:15:37,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37558 conditions, 7498 events. 4028/7498 cut-off events. For 64811/66775 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 52244 event pairs, 1633 based on Foata normal form. 90/7228 useless extension candidates. Maximal degree in co-relation 31143. Up to 3434 conditions per place. [2025-03-04 10:15:37,621 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 217 selfloop transitions, 17 changer transitions 13/279 dead transitions. [2025-03-04 10:15:37,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 279 transitions, 3331 flow [2025-03-04 10:15:37,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:15:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:15:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 337 transitions. [2025-03-04 10:15:37,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7020833333333333 [2025-03-04 10:15:37,622 INFO L175 Difference]: Start difference. First operand has 179 places, 166 transitions, 1513 flow. Second operand 6 states and 337 transitions. [2025-03-04 10:15:37,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 279 transitions, 3331 flow [2025-03-04 10:15:37,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 279 transitions, 3328 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:37,690 INFO L231 Difference]: Finished difference. Result has 186 places, 179 transitions, 1715 flow [2025-03-04 10:15:37,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1715, PETRI_PLACES=186, PETRI_TRANSITIONS=179} [2025-03-04 10:15:37,690 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 107 predicate places. [2025-03-04 10:15:37,690 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 179 transitions, 1715 flow [2025-03-04 10:15:37,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:37,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:37,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:37,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 10:15:37,691 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:37,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:37,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2100645579, now seen corresponding path program 3 times [2025-03-04 10:15:37,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:37,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135393297] [2025-03-04 10:15:37,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:15:37,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:37,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 3 equivalence classes. [2025-03-04 10:15:37,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 34 statements. [2025-03-04 10:15:37,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:15:37,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:15:37,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:37,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135393297] [2025-03-04 10:15:37,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135393297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:37,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:37,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:15:37,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171790127] [2025-03-04 10:15:37,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:37,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:15:37,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:37,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:15:37,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:15:37,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-03-04 10:15:37,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 179 transitions, 1715 flow. Second operand has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:37,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:37,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-03-04 10:15:37,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:38,862 INFO L124 PetriNetUnfolderBase]: 4448/8640 cut-off events. [2025-03-04 10:15:38,863 INFO L125 PetriNetUnfolderBase]: For 75540/77195 co-relation queries the response was YES. [2025-03-04 10:15:38,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45638 conditions, 8640 events. 4448/8640 cut-off events. For 75540/77195 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 63257 event pairs, 2159 based on Foata normal form. 125/8373 useless extension candidates. Maximal degree in co-relation 44991. Up to 4664 conditions per place. [2025-03-04 10:15:38,919 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 186 selfloop transitions, 38 changer transitions 12/268 dead transitions. [2025-03-04 10:15:38,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 268 transitions, 3253 flow [2025-03-04 10:15:38,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:15:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:15:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 338 transitions. [2025-03-04 10:15:38,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7041666666666667 [2025-03-04 10:15:38,920 INFO L175 Difference]: Start difference. First operand has 186 places, 179 transitions, 1715 flow. Second operand 6 states and 338 transitions. [2025-03-04 10:15:38,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 268 transitions, 3253 flow [2025-03-04 10:15:39,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 268 transitions, 3237 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:15:39,031 INFO L231 Difference]: Finished difference. Result has 194 places, 198 transitions, 2083 flow [2025-03-04 10:15:39,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2083, PETRI_PLACES=194, PETRI_TRANSITIONS=198} [2025-03-04 10:15:39,032 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 115 predicate places. [2025-03-04 10:15:39,032 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 198 transitions, 2083 flow [2025-03-04 10:15:39,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:39,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:39,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:39,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 10:15:39,033 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:39,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:39,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1418993459, now seen corresponding path program 4 times [2025-03-04 10:15:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:39,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955429858] [2025-03-04 10:15:39,033 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:15:39,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:39,039 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-04 10:15:39,041 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 34 statements. [2025-03-04 10:15:39,042 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:15:39,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:15:39,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:39,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955429858] [2025-03-04 10:15:39,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955429858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:39,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290008069] [2025-03-04 10:15:39,076 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:15:39,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:39,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:39,078 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:39,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:15:39,165 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-04 10:15:39,179 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 34 statements. [2025-03-04 10:15:39,180 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:15:39,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:39,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:15:39,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:15:39,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:15:39,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290008069] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:39,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:39,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 10:15:39,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571157455] [2025-03-04 10:15:39,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:39,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:15:39,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:39,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:15:39,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:15:39,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 80 [2025-03-04 10:15:39,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 198 transitions, 2083 flow. Second operand has 12 states, 12 states have (on average 45.166666666666664) internal successors, (542), 12 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:39,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:39,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 80 [2025-03-04 10:15:39,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:42,778 INFO L124 PetriNetUnfolderBase]: 13836/26000 cut-off events. [2025-03-04 10:15:42,778 INFO L125 PetriNetUnfolderBase]: For 218974/221036 co-relation queries the response was YES. [2025-03-04 10:15:42,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135914 conditions, 26000 events. 13836/26000 cut-off events. For 218974/221036 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 219156 event pairs, 342 based on Foata normal form. 445/26342 useless extension candidates. Maximal degree in co-relation 134681. Up to 4704 conditions per place. [2025-03-04 10:15:43,120 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 547 selfloop transitions, 481 changer transitions 4/1056 dead transitions. [2025-03-04 10:15:43,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 1056 transitions, 14077 flow [2025-03-04 10:15:43,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 10:15:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-04 10:15:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 1759 transitions. [2025-03-04 10:15:43,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6282142857142857 [2025-03-04 10:15:43,122 INFO L175 Difference]: Start difference. First operand has 194 places, 198 transitions, 2083 flow. Second operand 35 states and 1759 transitions. [2025-03-04 10:15:43,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 1056 transitions, 14077 flow [2025-03-04 10:15:44,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 1056 transitions, 13709 flow, removed 79 selfloop flow, removed 1 redundant places. [2025-03-04 10:15:44,087 INFO L231 Difference]: Finished difference. Result has 255 places, 682 transitions, 9161 flow [2025-03-04 10:15:44,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=2040, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=9161, PETRI_PLACES=255, PETRI_TRANSITIONS=682} [2025-03-04 10:15:44,088 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 176 predicate places. [2025-03-04 10:15:44,088 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 682 transitions, 9161 flow [2025-03-04 10:15:44,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 45.166666666666664) internal successors, (542), 12 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:44,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:44,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:44,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 10:15:44,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 10:15:44,289 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:44,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:44,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1890302415, now seen corresponding path program 5 times [2025-03-04 10:15:44,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:44,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886599539] [2025-03-04 10:15:44,290 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:15:44,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:44,300 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 3 equivalence classes. [2025-03-04 10:15:44,308 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:15:44,309 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:15:44,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:15:44,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:44,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886599539] [2025-03-04 10:15:44,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886599539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:44,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800482619] [2025-03-04 10:15:44,378 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:15:44,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:44,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:44,382 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:44,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:15:44,461 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 3 equivalence classes. [2025-03-04 10:15:44,491 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:15:44,492 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:15:44,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:44,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:15:44,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:44,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:15:44,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:15:44,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800482619] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:44,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:15:44,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-04 10:15:44,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387253289] [2025-03-04 10:15:44,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:44,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:15:44,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:44,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:15:44,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:15:44,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2025-03-04 10:15:44,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 682 transitions, 9161 flow. Second operand has 7 states, 7 states have (on average 47.285714285714285) internal successors, (331), 7 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:44,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:44,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2025-03-04 10:15:44,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:48,025 INFO L124 PetriNetUnfolderBase]: 11240/21460 cut-off events. [2025-03-04 10:15:48,026 INFO L125 PetriNetUnfolderBase]: For 370971/374912 co-relation queries the response was YES. [2025-03-04 10:15:48,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138307 conditions, 21460 events. 11240/21460 cut-off events. For 370971/374912 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 179522 event pairs, 1488 based on Foata normal form. 740/21604 useless extension candidates. Maximal degree in co-relation 137204. Up to 5250 conditions per place. [2025-03-04 10:15:48,305 INFO L140 encePairwiseOnDemand]: 69/80 looper letters, 411 selfloop transitions, 425 changer transitions 0/870 dead transitions. [2025-03-04 10:15:48,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 870 transitions, 13369 flow [2025-03-04 10:15:48,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:15:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:15:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 431 transitions. [2025-03-04 10:15:48,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6734375 [2025-03-04 10:15:48,306 INFO L175 Difference]: Start difference. First operand has 255 places, 682 transitions, 9161 flow. Second operand 8 states and 431 transitions. [2025-03-04 10:15:48,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 870 transitions, 13369 flow [2025-03-04 10:15:50,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 870 transitions, 13196 flow, removed 58 selfloop flow, removed 1 redundant places. [2025-03-04 10:15:50,088 INFO L231 Difference]: Finished difference. Result has 265 places, 778 transitions, 11835 flow [2025-03-04 10:15:50,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=9024, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=346, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11835, PETRI_PLACES=265, PETRI_TRANSITIONS=778} [2025-03-04 10:15:50,088 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 186 predicate places. [2025-03-04 10:15:50,088 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 778 transitions, 11835 flow [2025-03-04 10:15:50,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 47.285714285714285) internal successors, (331), 7 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:50,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:50,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:50,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-04 10:15:50,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 10:15:50,289 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:50,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:50,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1877047567, now seen corresponding path program 6 times [2025-03-04 10:15:50,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:50,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100017603] [2025-03-04 10:15:50,290 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:15:50,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:50,299 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 3 equivalence classes. [2025-03-04 10:15:50,304 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 34 statements. [2025-03-04 10:15:50,304 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 10:15:50,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:15:50,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:50,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100017603] [2025-03-04 10:15:50,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100017603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:50,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:50,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:15:50,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025543065] [2025-03-04 10:15:50,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:50,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:15:50,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:50,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:15:50,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:15:50,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-03-04 10:15:50,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 778 transitions, 11835 flow. Second operand has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:50,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:50,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-03-04 10:15:50,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:54,168 INFO L124 PetriNetUnfolderBase]: 10250/19718 cut-off events. [2025-03-04 10:15:54,168 INFO L125 PetriNetUnfolderBase]: For 407667/411686 co-relation queries the response was YES. [2025-03-04 10:15:54,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136927 conditions, 19718 events. 10250/19718 cut-off events. For 407667/411686 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 164956 event pairs, 2681 based on Foata normal form. 344/19191 useless extension candidates. Maximal degree in co-relation 135890. Up to 9796 conditions per place. [2025-03-04 10:15:54,383 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 567 selfloop transitions, 222 changer transitions 16/936 dead transitions. [2025-03-04 10:15:54,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 936 transitions, 15850 flow [2025-03-04 10:15:54,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:15:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:15:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 336 transitions. [2025-03-04 10:15:54,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-04 10:15:54,384 INFO L175 Difference]: Start difference. First operand has 265 places, 778 transitions, 11835 flow. Second operand 6 states and 336 transitions. [2025-03-04 10:15:54,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 936 transitions, 15850 flow [2025-03-04 10:15:56,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 936 transitions, 15777 flow, removed 24 selfloop flow, removed 4 redundant places. [2025-03-04 10:15:56,374 INFO L231 Difference]: Finished difference. Result has 267 places, 799 transitions, 12704 flow [2025-03-04 10:15:56,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=11770, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=778, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12704, PETRI_PLACES=267, PETRI_TRANSITIONS=799} [2025-03-04 10:15:56,375 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 188 predicate places. [2025-03-04 10:15:56,375 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 799 transitions, 12704 flow [2025-03-04 10:15:56,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:56,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:56,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:56,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 10:15:56,375 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2025-03-04 10:15:56,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash -119254675, now seen corresponding path program 7 times [2025-03-04 10:15:56,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:56,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746799193] [2025-03-04 10:15:56,376 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:15:56,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:56,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:15:56,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:15:56,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:56,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:56,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:56,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746799193] [2025-03-04 10:15:56,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746799193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:56,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877394470] [2025-03-04 10:15:56,470 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:15:56,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:56,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:56,475 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:56,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 10:15:56,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:15:56,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:15:56,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:56,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:56,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:15:56,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:15:56,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:15:56,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877394470] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:56,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:15:56,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2025-03-04 10:15:56,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397853161] [2025-03-04 10:15:56,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:56,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:15:56,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:56,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:15:56,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:15:56,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2025-03-04 10:15:56,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 799 transitions, 12704 flow. Second operand has 7 states, 7 states have (on average 47.285714285714285) internal successors, (331), 7 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:56,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:56,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2025-03-04 10:15:56,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand