./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:38:25,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:38:25,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:38:25,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:38:25,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:38:25,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:38:25,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:38:25,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:38:25,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:38:25,304 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:38:25,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:38:25,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:38:25,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:38:25,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:38:25,305 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:38:25,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:38:25,306 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:38:25,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:38:25,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:38:25,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:38:25,306 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:38:25,306 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:38:25,306 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:38:25,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:38:25,306 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:38:25,306 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:38:25,306 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:38:25,306 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:38:25,306 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:38:25,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:38:25,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:38:25,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:38:25,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:38:25,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:38:25,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:38:25,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:38:25,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:38:25,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:38:25,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:38:25,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:38:25,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:38:25,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:38:25,308 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-jdk21/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 -> 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 [2025-02-08 08:38:25,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:38:25,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:38:25,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:38:25,539 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:38:25,539 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:38:25,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-02-08 08:38:26,659 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e1938ca3/8fe0164a09fd410bb146433abc917aeb/FLAG01bdf29a4 [2025-02-08 08:38:26,953 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:38:26,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-02-08 08:38:26,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e1938ca3/8fe0164a09fd410bb146433abc917aeb/FLAG01bdf29a4 [2025-02-08 08:38:27,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e1938ca3/8fe0164a09fd410bb146433abc917aeb [2025-02-08 08:38:27,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:38:27,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:38:27,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:38:27,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:38:27,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:38:27,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:38:27" (1/1) ... [2025-02-08 08:38:27,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79bfd6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:27, skipping insertion in model container [2025-02-08 08:38:27,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:38:27" (1/1) ... [2025-02-08 08:38:27,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:38:27,438 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:38:27,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:38:27,447 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:38:27,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:38:27,496 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:38:27,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:27 WrapperNode [2025-02-08 08:38:27,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:38:27,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:38:27,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:38:27,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:38:27,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:27" (1/1) ... [2025-02-08 08:38:27,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:27" (1/1) ... [2025-02-08 08:38:27,530 INFO L138 Inliner]: procedures = 24, calls = 54, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 327 [2025-02-08 08:38:27,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:38:27,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:38:27,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:38:27,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:38:27,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:27" (1/1) ... [2025-02-08 08:38:27,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:27" (1/1) ... [2025-02-08 08:38:27,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:27" (1/1) ... [2025-02-08 08:38:27,550 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-08 08:38:27,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:27" (1/1) ... [2025-02-08 08:38:27,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:27" (1/1) ... [2025-02-08 08:38:27,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:27" (1/1) ... [2025-02-08 08:38:27,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:27" (1/1) ... [2025-02-08 08:38:27,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:27" (1/1) ... [2025-02-08 08:38:27,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:27" (1/1) ... [2025-02-08 08:38:27,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:38:27,564 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:38:27,564 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:38:27,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:38:27,565 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:27" (1/1) ... [2025-02-08 08:38:27,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:38:27,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:27,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:38:27,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:38:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:38:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:38:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:38:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:38:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:38:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:38:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:38:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:38:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:38:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:38:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:38:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:38:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:38:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:38:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:38:27,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:38:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:38:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:38:27,611 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:38:27,683 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:38:27,685 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:38:28,029 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:38:28,030 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:38:28,285 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:38:28,285 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:38:28,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:38:28 BoogieIcfgContainer [2025-02-08 08:38:28,286 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:38:28,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:38:28,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:38:28,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:38:28,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:38:27" (1/3) ... [2025-02-08 08:38:28,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e839255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:38:28, skipping insertion in model container [2025-02-08 08:38:28,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:27" (2/3) ... [2025-02-08 08:38:28,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e839255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:38:28, skipping insertion in model container [2025-02-08 08:38:28,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:38:28" (3/3) ... [2025-02-08 08:38:28,292 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2025-02-08 08:38:28,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:38:28,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-1.wvr-bad.c that has 4 procedures, 72 locations, 1 initial locations, 6 loop locations, and 24 error locations. [2025-02-08 08:38:28,304 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:38:28,346 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 08:38:28,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 88 transitions, 197 flow [2025-02-08 08:38:28,388 INFO L124 PetriNetUnfolderBase]: 17/85 cut-off events. [2025-02-08 08:38:28,390 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:38:28,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 85 events. 17/85 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 238 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 64. Up to 6 conditions per place. [2025-02-08 08:38:28,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 88 transitions, 197 flow [2025-02-08 08:38:28,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 84 transitions, 186 flow [2025-02-08 08:38:28,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:38:28,406 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;@1622bb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:38:28,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-02-08 08:38:28,409 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:38:28,409 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:38:28,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:38:28,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:28,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:38:28,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:28,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:28,414 INFO L85 PathProgramCache]: Analyzing trace with hash 909938, now seen corresponding path program 1 times [2025-02-08 08:38:28,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:28,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319702787] [2025-02-08 08:38:28,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:28,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:28,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:38:28,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:38:28,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:28,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:28,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:28,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319702787] [2025-02-08 08:38:28,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319702787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:28,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:28,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:38:28,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642428044] [2025-02-08 08:38:28,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:28,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:38:28,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:28,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:38:28,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:38:28,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-02-08 08:38:28,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 84 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:28,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:28,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-02-08 08:38:28,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:29,545 INFO L124 PetriNetUnfolderBase]: 7255/10518 cut-off events. [2025-02-08 08:38:29,545 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2025-02-08 08:38:29,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20334 conditions, 10518 events. 7255/10518 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 976. Compared 69424 event pairs, 5236 based on Foata normal form. 1/5700 useless extension candidates. Maximal degree in co-relation 19646. Up to 9450 conditions per place. [2025-02-08 08:38:29,611 INFO L140 encePairwiseOnDemand]: 79/88 looper letters, 54 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2025-02-08 08:38:29,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 282 flow [2025-02-08 08:38:29,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:38:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:38:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2025-02-08 08:38:29,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-02-08 08:38:29,621 INFO L175 Difference]: Start difference. First operand has 77 places, 84 transitions, 186 flow. Second operand 3 states and 135 transitions. [2025-02-08 08:38:29,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 282 flow [2025-02-08 08:38:29,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 270 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:38:29,630 INFO L231 Difference]: Finished difference. Result has 68 places, 76 transitions, 162 flow [2025-02-08 08:38:29,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=68, PETRI_TRANSITIONS=76} [2025-02-08 08:38:29,633 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -9 predicate places. [2025-02-08 08:38:29,633 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 76 transitions, 162 flow [2025-02-08 08:38:29,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:29,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:29,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:38:29,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:38:29,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:29,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:29,635 INFO L85 PathProgramCache]: Analyzing trace with hash 909939, now seen corresponding path program 1 times [2025-02-08 08:38:29,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:29,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582685085] [2025-02-08 08:38:29,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:29,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:29,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:38:29,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:38:29,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:29,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:29,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:29,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:29,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582685085] [2025-02-08 08:38:29,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582685085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:29,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:29,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:29,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804693178] [2025-02-08 08:38:29,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:29,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:29,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:29,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:29,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:29,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-02-08 08:38:29,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 76 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-02-08 08:38:29,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:29,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-02-08 08:38:29,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:30,623 INFO L124 PetriNetUnfolderBase]: 7258/10527 cut-off events. [2025-02-08 08:38:30,623 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-02-08 08:38:30,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20134 conditions, 10527 events. 7258/10527 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 976. Compared 69493 event pairs, 5236 based on Foata normal form. 0/5704 useless extension candidates. Maximal degree in co-relation 20084. Up to 9463 conditions per place. [2025-02-08 08:38:30,664 INFO L140 encePairwiseOnDemand]: 75/88 looper letters, 58 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2025-02-08 08:38:30,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 85 transitions, 318 flow [2025-02-08 08:38:30,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2025-02-08 08:38:30,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744318181818182 [2025-02-08 08:38:30,665 INFO L175 Difference]: Start difference. First operand has 68 places, 76 transitions, 162 flow. Second operand 4 states and 167 transitions. [2025-02-08 08:38:30,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 85 transitions, 318 flow [2025-02-08 08:38:30,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 85 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:30,668 INFO L231 Difference]: Finished difference. Result has 72 places, 85 transitions, 240 flow [2025-02-08 08:38:30,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=72, PETRI_TRANSITIONS=85} [2025-02-08 08:38:30,668 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -5 predicate places. [2025-02-08 08:38:30,668 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 85 transitions, 240 flow [2025-02-08 08:38:30,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-02-08 08:38:30,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:30,669 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:38:30,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:38:30,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:30,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:30,669 INFO L85 PathProgramCache]: Analyzing trace with hash 874480081, now seen corresponding path program 1 times [2025-02-08 08:38:30,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:30,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655671285] [2025-02-08 08:38:30,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:30,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:30,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:38:30,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:38:30,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:30,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:30,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:30,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655671285] [2025-02-08 08:38:30,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655671285] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:38:30,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262109660] [2025-02-08 08:38:30,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:30,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:30,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:30,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:38:30,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:38:30,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:38:31,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:38:31,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:31,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:31,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 08:38:31,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:38:31,065 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-02-08 08:38:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:31,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:38:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:31,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262109660] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:38:31,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:38:31,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-08 08:38:31,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102100231] [2025-02-08 08:38:31,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:38:31,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:38:31,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:31,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:38:31,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:38:31,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-02-08 08:38:31,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 85 transitions, 240 flow. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 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-02-08 08:38:31,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:31,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-02-08 08:38:31,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:32,353 INFO L124 PetriNetUnfolderBase]: 7261/10533 cut-off events. [2025-02-08 08:38:32,353 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-08 08:38:32,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20185 conditions, 10533 events. 7261/10533 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 976. Compared 69349 event pairs, 5236 based on Foata normal form. 0/5715 useless extension candidates. Maximal degree in co-relation 20098. Up to 9452 conditions per place. [2025-02-08 08:38:32,398 INFO L140 encePairwiseOnDemand]: 75/88 looper letters, 48 selfloop transitions, 26 changer transitions 0/91 dead transitions. [2025-02-08 08:38:32,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 91 transitions, 416 flow [2025-02-08 08:38:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:38:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:38:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 272 transitions. [2025-02-08 08:38:32,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2025-02-08 08:38:32,400 INFO L175 Difference]: Start difference. First operand has 72 places, 85 transitions, 240 flow. Second operand 8 states and 272 transitions. [2025-02-08 08:38:32,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 91 transitions, 416 flow [2025-02-08 08:38:32,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 91 transitions, 416 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:38:32,402 INFO L231 Difference]: Finished difference. Result has 76 places, 91 transitions, 320 flow [2025-02-08 08:38:32,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=320, PETRI_PLACES=76, PETRI_TRANSITIONS=91} [2025-02-08 08:38:32,406 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -1 predicate places. [2025-02-08 08:38:32,406 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 91 transitions, 320 flow [2025-02-08 08:38:32,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 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-02-08 08:38:32,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:32,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:32,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 08:38:32,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:38:32,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:32,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:32,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1989804160, now seen corresponding path program 1 times [2025-02-08 08:38:32,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:32,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011763415] [2025-02-08 08:38:32,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:32,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:32,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:38:32,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:38:32,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:32,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:32,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:32,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011763415] [2025-02-08 08:38:32,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011763415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:32,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:32,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:38:32,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171034356] [2025-02-08 08:38:32,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:32,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:38:32,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:32,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:38:32,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:38:32,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-02-08 08:38:32,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 91 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:32,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:32,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-02-08 08:38:32,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:33,578 INFO L124 PetriNetUnfolderBase]: 12112/17635 cut-off events. [2025-02-08 08:38:33,578 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2025-02-08 08:38:33,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33764 conditions, 17635 events. 12112/17635 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 1310. Compared 122089 event pairs, 4256 based on Foata normal form. 356/10132 useless extension candidates. Maximal degree in co-relation 33652. Up to 9751 conditions per place. [2025-02-08 08:38:33,645 INFO L140 encePairwiseOnDemand]: 79/88 looper letters, 108 selfloop transitions, 3 changer transitions 0/128 dead transitions. [2025-02-08 08:38:33,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 128 transitions, 620 flow [2025-02-08 08:38:33,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:38:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:38:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-02-08 08:38:33,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2025-02-08 08:38:33,649 INFO L175 Difference]: Start difference. First operand has 76 places, 91 transitions, 320 flow. Second operand 3 states and 180 transitions. [2025-02-08 08:38:33,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 128 transitions, 620 flow [2025-02-08 08:38:33,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 128 transitions, 549 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-02-08 08:38:33,654 INFO L231 Difference]: Finished difference. Result has 73 places, 93 transitions, 278 flow [2025-02-08 08:38:33,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=73, PETRI_TRANSITIONS=93} [2025-02-08 08:38:33,655 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -4 predicate places. [2025-02-08 08:38:33,656 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 93 transitions, 278 flow [2025-02-08 08:38:33,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:33,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:33,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:33,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:38:33,656 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:33,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:33,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1554384837, now seen corresponding path program 1 times [2025-02-08 08:38:33,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:33,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900165707] [2025-02-08 08:38:33,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:33,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:33,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:38:33,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:38:33,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:33,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:33,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:33,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900165707] [2025-02-08 08:38:33,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900165707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:33,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:33,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:33,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726514705] [2025-02-08 08:38:33,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:33,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:38:33,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:33,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:38:33,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:38:33,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 88 [2025-02-08 08:38:33,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 93 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:33,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:33,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 88 [2025-02-08 08:38:33,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:34,657 INFO L124 PetriNetUnfolderBase]: 15261/21871 cut-off events. [2025-02-08 08:38:34,658 INFO L125 PetriNetUnfolderBase]: For 1267/1291 co-relation queries the response was YES. [2025-02-08 08:38:34,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45028 conditions, 21871 events. 15261/21871 cut-off events. For 1267/1291 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 137992 event pairs, 5655 based on Foata normal form. 0/14483 useless extension candidates. Maximal degree in co-relation 8288. Up to 10528 conditions per place. [2025-02-08 08:38:34,738 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 109 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2025-02-08 08:38:34,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 125 transitions, 576 flow [2025-02-08 08:38:34,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:38:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:38:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2025-02-08 08:38:34,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-02-08 08:38:34,739 INFO L175 Difference]: Start difference. First operand has 73 places, 93 transitions, 278 flow. Second operand 3 states and 160 transitions. [2025-02-08 08:38:34,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 125 transitions, 576 flow [2025-02-08 08:38:34,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 125 transitions, 573 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:38:34,744 INFO L231 Difference]: Finished difference. Result has 76 places, 94 transitions, 297 flow [2025-02-08 08:38:34,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=76, PETRI_TRANSITIONS=94} [2025-02-08 08:38:34,745 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -1 predicate places. [2025-02-08 08:38:34,745 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 94 transitions, 297 flow [2025-02-08 08:38:34,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:34,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:34,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:34,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:38:34,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:34,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:34,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1664715566, now seen corresponding path program 1 times [2025-02-08 08:38:34,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:34,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477184067] [2025-02-08 08:38:34,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:34,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:34,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:38:34,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:38:34,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:34,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:34,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:34,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477184067] [2025-02-08 08:38:34,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477184067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:34,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:34,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:34,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324274779] [2025-02-08 08:38:34,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:34,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:38:34,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:34,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:38:34,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:38:34,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-02-08 08:38:34,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 94 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-02-08 08:38:34,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:34,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-02-08 08:38:34,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:36,379 INFO L124 PetriNetUnfolderBase]: 19160/28502 cut-off events. [2025-02-08 08:38:36,379 INFO L125 PetriNetUnfolderBase]: For 4797/4961 co-relation queries the response was YES. [2025-02-08 08:38:36,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60781 conditions, 28502 events. 19160/28502 cut-off events. For 4797/4961 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 195085 event pairs, 7868 based on Foata normal form. 482/19472 useless extension candidates. Maximal degree in co-relation 13814. Up to 12927 conditions per place. [2025-02-08 08:38:36,553 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 114 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2025-02-08 08:38:36,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 134 transitions, 637 flow [2025-02-08 08:38:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:38:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:38:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-02-08 08:38:36,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2025-02-08 08:38:36,554 INFO L175 Difference]: Start difference. First operand has 76 places, 94 transitions, 297 flow. Second operand 3 states and 180 transitions. [2025-02-08 08:38:36,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 134 transitions, 637 flow [2025-02-08 08:38:36,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 134 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:36,563 INFO L231 Difference]: Finished difference. Result has 77 places, 95 transitions, 305 flow [2025-02-08 08:38:36,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=77, PETRI_TRANSITIONS=95} [2025-02-08 08:38:36,563 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 0 predicate places. [2025-02-08 08:38:36,564 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 95 transitions, 305 flow [2025-02-08 08:38:36,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-02-08 08:38:36,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:36,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:36,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:38:36,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:36,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:36,565 INFO L85 PathProgramCache]: Analyzing trace with hash -66572991, now seen corresponding path program 1 times [2025-02-08 08:38:36,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:36,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723917507] [2025-02-08 08:38:36,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:36,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:36,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:38:36,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:38:36,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:36,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:36,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:36,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:36,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723917507] [2025-02-08 08:38:36,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723917507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:36,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:36,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:36,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76016823] [2025-02-08 08:38:36,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:36,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:38:36,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:36,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:38:36,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:38:36,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-02-08 08:38:36,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 95 transitions, 305 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-02-08 08:38:36,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:36,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-02-08 08:38:36,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:37,912 INFO L124 PetriNetUnfolderBase]: 23773/34280 cut-off events. [2025-02-08 08:38:37,912 INFO L125 PetriNetUnfolderBase]: For 4415/4829 co-relation queries the response was YES. [2025-02-08 08:38:37,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73091 conditions, 34280 events. 23773/34280 cut-off events. For 4415/4829 co-relation queries the response was YES. Maximal size of possible extension queue 1501. Compared 225710 event pairs, 11883 based on Foata normal form. 0/23397 useless extension candidates. Maximal degree in co-relation 22472. Up to 20213 conditions per place. [2025-02-08 08:38:38,268 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 111 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2025-02-08 08:38:38,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 130 transitions, 626 flow [2025-02-08 08:38:38,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:38:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:38:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2025-02-08 08:38:38,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-02-08 08:38:38,269 INFO L175 Difference]: Start difference. First operand has 77 places, 95 transitions, 305 flow. Second operand 3 states and 168 transitions. [2025-02-08 08:38:38,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 130 transitions, 626 flow [2025-02-08 08:38:38,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 130 transitions, 624 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:38:38,274 INFO L231 Difference]: Finished difference. Result has 80 places, 95 transitions, 321 flow [2025-02-08 08:38:38,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=80, PETRI_TRANSITIONS=95} [2025-02-08 08:38:38,275 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-02-08 08:38:38,275 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 95 transitions, 321 flow [2025-02-08 08:38:38,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-02-08 08:38:38,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:38,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:38,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:38:38,276 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:38,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:38,276 INFO L85 PathProgramCache]: Analyzing trace with hash 944123106, now seen corresponding path program 1 times [2025-02-08 08:38:38,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:38,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419152071] [2025-02-08 08:38:38,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:38,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:38,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:38:38,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:38:38,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:38,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:38,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:38,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419152071] [2025-02-08 08:38:38,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419152071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:38,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:38,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:38,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808433729] [2025-02-08 08:38:38,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:38,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:38,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:38,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:38,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:38,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-02-08 08:38:38,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 95 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-02-08 08:38:38,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:38,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-02-08 08:38:38,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:39,808 INFO L124 PetriNetUnfolderBase]: 21344/31728 cut-off events. [2025-02-08 08:38:39,809 INFO L125 PetriNetUnfolderBase]: For 9203/9905 co-relation queries the response was YES. [2025-02-08 08:38:39,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70215 conditions, 31728 events. 21344/31728 cut-off events. For 9203/9905 co-relation queries the response was YES. Maximal size of possible extension queue 1388. Compared 213946 event pairs, 16426 based on Foata normal form. 112/21807 useless extension candidates. Maximal degree in co-relation 42151. Up to 26830 conditions per place. [2025-02-08 08:38:39,946 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 116 selfloop transitions, 3 changer transitions 0/138 dead transitions. [2025-02-08 08:38:39,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 138 transitions, 689 flow [2025-02-08 08:38:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2025-02-08 08:38:39,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5710227272727273 [2025-02-08 08:38:39,947 INFO L175 Difference]: Start difference. First operand has 80 places, 95 transitions, 321 flow. Second operand 4 states and 201 transitions. [2025-02-08 08:38:39,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 138 transitions, 689 flow [2025-02-08 08:38:39,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 138 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:39,957 INFO L231 Difference]: Finished difference. Result has 82 places, 95 transitions, 326 flow [2025-02-08 08:38:39,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=326, PETRI_PLACES=82, PETRI_TRANSITIONS=95} [2025-02-08 08:38:39,958 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2025-02-08 08:38:39,958 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 95 transitions, 326 flow [2025-02-08 08:38:39,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-02-08 08:38:39,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:39,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:39,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:38:39,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:39,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:39,959 INFO L85 PathProgramCache]: Analyzing trace with hash -796952767, now seen corresponding path program 1 times [2025-02-08 08:38:39,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:39,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388721076] [2025-02-08 08:38:39,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:39,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:39,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:38:39,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:38:39,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:39,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:39,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:39,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388721076] [2025-02-08 08:38:39,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388721076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:39,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:39,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876076495] [2025-02-08 08:38:39,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:39,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:38:39,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:39,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:38:39,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:38:39,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-02-08 08:38:39,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 95 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-02-08 08:38:39,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:39,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-02-08 08:38:39,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:43,282 INFO L124 PetriNetUnfolderBase]: 37224/53380 cut-off events. [2025-02-08 08:38:43,283 INFO L125 PetriNetUnfolderBase]: For 12542/13726 co-relation queries the response was YES. [2025-02-08 08:38:43,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119854 conditions, 53380 events. 37224/53380 cut-off events. For 12542/13726 co-relation queries the response was YES. Maximal size of possible extension queue 2197. Compared 357361 event pairs, 21948 based on Foata normal form. 0/36566 useless extension candidates. Maximal degree in co-relation 117475. Up to 24986 conditions per place. [2025-02-08 08:38:43,551 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 111 selfloop transitions, 5 changer transitions 0/132 dead transitions. [2025-02-08 08:38:43,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 132 transitions, 667 flow [2025-02-08 08:38:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:38:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:38:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2025-02-08 08:38:43,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-02-08 08:38:43,553 INFO L175 Difference]: Start difference. First operand has 82 places, 95 transitions, 326 flow. Second operand 3 states and 168 transitions. [2025-02-08 08:38:43,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 132 transitions, 667 flow [2025-02-08 08:38:43,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 132 transitions, 663 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 08:38:43,560 INFO L231 Difference]: Finished difference. Result has 85 places, 96 transitions, 348 flow [2025-02-08 08:38:43,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=85, PETRI_TRANSITIONS=96} [2025-02-08 08:38:43,561 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2025-02-08 08:38:43,561 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 96 transitions, 348 flow [2025-02-08 08:38:43,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-02-08 08:38:43,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:43,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:43,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:38:43,562 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:43,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:43,562 INFO L85 PathProgramCache]: Analyzing trace with hash 35040960, now seen corresponding path program 1 times [2025-02-08 08:38:43,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:43,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85247099] [2025-02-08 08:38:43,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:43,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:43,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:38:43,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:38:43,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:43,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:38:43,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85247099] [2025-02-08 08:38:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85247099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:43,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:43,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:43,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051762347] [2025-02-08 08:38:43,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:43,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:43,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:43,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:43,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-02-08 08:38:43,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 96 transitions, 348 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-02-08 08:38:43,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:43,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-02-08 08:38:43,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:45,582 INFO L124 PetriNetUnfolderBase]: 24147/36411 cut-off events. [2025-02-08 08:38:45,583 INFO L125 PetriNetUnfolderBase]: For 14886/16370 co-relation queries the response was YES. [2025-02-08 08:38:45,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82513 conditions, 36411 events. 24147/36411 cut-off events. For 14886/16370 co-relation queries the response was YES. Maximal size of possible extension queue 1368. Compared 255874 event pairs, 19281 based on Foata normal form. 0/27002 useless extension candidates. Maximal degree in co-relation 43245. Up to 32005 conditions per place. [2025-02-08 08:38:45,866 INFO L140 encePairwiseOnDemand]: 81/88 looper letters, 65 selfloop transitions, 7 changer transitions 0/92 dead transitions. [2025-02-08 08:38:45,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 478 flow [2025-02-08 08:38:45,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:38:45,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:38:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-02-08 08:38:45,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-02-08 08:38:45,868 INFO L175 Difference]: Start difference. First operand has 85 places, 96 transitions, 348 flow. Second operand 5 states and 176 transitions. [2025-02-08 08:38:45,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 478 flow [2025-02-08 08:38:45,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 92 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:45,880 INFO L231 Difference]: Finished difference. Result has 83 places, 92 transitions, 338 flow [2025-02-08 08:38:45,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=338, PETRI_PLACES=83, PETRI_TRANSITIONS=92} [2025-02-08 08:38:45,881 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 6 predicate places. [2025-02-08 08:38:45,881 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 92 transitions, 338 flow [2025-02-08 08:38:45,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-02-08 08:38:45,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:45,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:45,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:38:45,882 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:45,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:45,886 INFO L85 PathProgramCache]: Analyzing trace with hash 35040961, now seen corresponding path program 1 times [2025-02-08 08:38:45,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:45,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535003507] [2025-02-08 08:38:45,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:45,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:45,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:38:45,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:38:45,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:45,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:46,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:46,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535003507] [2025-02-08 08:38:46,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535003507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:46,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:46,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:38:46,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593915061] [2025-02-08 08:38:46,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:46,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:38:46,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:46,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:38:46,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:38:46,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-02-08 08:38:46,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 92 transitions, 338 flow. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 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-02-08 08:38:46,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:46,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-02-08 08:38:46,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:48,197 INFO L124 PetriNetUnfolderBase]: 18930/28910 cut-off events. [2025-02-08 08:38:48,198 INFO L125 PetriNetUnfolderBase]: For 9063/10311 co-relation queries the response was YES. [2025-02-08 08:38:48,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63276 conditions, 28910 events. 18930/28910 cut-off events. For 9063/10311 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 197948 event pairs, 14916 based on Foata normal form. 1455/22670 useless extension candidates. Maximal degree in co-relation 61056. Up to 25035 conditions per place. [2025-02-08 08:38:48,313 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 64 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2025-02-08 08:38:48,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 88 transitions, 460 flow [2025-02-08 08:38:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-02-08 08:38:48,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2025-02-08 08:38:48,315 INFO L175 Difference]: Start difference. First operand has 83 places, 92 transitions, 338 flow. Second operand 4 states and 148 transitions. [2025-02-08 08:38:48,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 88 transitions, 460 flow [2025-02-08 08:38:48,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 88 transitions, 449 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:38:48,320 INFO L231 Difference]: Finished difference. Result has 79 places, 88 transitions, 321 flow [2025-02-08 08:38:48,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=79, PETRI_TRANSITIONS=88} [2025-02-08 08:38:48,321 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 2 predicate places. [2025-02-08 08:38:48,321 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 88 transitions, 321 flow [2025-02-08 08:38:48,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 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-02-08 08:38:48,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:48,321 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:48,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:38:48,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:48,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:48,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1210604700, now seen corresponding path program 1 times [2025-02-08 08:38:48,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:48,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748193947] [2025-02-08 08:38:48,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:48,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:48,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:38:48,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:38:48,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:48,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:38:48,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:48,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748193947] [2025-02-08 08:38:48,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748193947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:48,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:48,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:48,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694688420] [2025-02-08 08:38:48,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:48,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:38:48,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:48,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:38:48,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:38:48,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-02-08 08:38:48,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 88 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-02-08 08:38:48,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:48,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-02-08 08:38:48,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:50,608 INFO L124 PetriNetUnfolderBase]: 24426/36151 cut-off events. [2025-02-08 08:38:50,609 INFO L125 PetriNetUnfolderBase]: For 12968/15249 co-relation queries the response was YES. [2025-02-08 08:38:50,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81560 conditions, 36151 events. 24426/36151 cut-off events. For 12968/15249 co-relation queries the response was YES. Maximal size of possible extension queue 1042. Compared 232729 event pairs, 8589 based on Foata normal form. 732/28088 useless extension candidates. Maximal degree in co-relation 79396. Up to 23607 conditions per place. [2025-02-08 08:38:50,803 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 97 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2025-02-08 08:38:50,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 119 transitions, 612 flow [2025-02-08 08:38:50,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:38:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:38:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-02-08 08:38:50,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-02-08 08:38:50,805 INFO L175 Difference]: Start difference. First operand has 79 places, 88 transitions, 321 flow. Second operand 3 states and 162 transitions. [2025-02-08 08:38:50,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 119 transitions, 612 flow [2025-02-08 08:38:50,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 119 transitions, 607 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:50,812 INFO L231 Difference]: Finished difference. Result has 80 places, 89 transitions, 334 flow [2025-02-08 08:38:50,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=80, PETRI_TRANSITIONS=89} [2025-02-08 08:38:50,813 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-02-08 08:38:50,813 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 89 transitions, 334 flow [2025-02-08 08:38:50,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-02-08 08:38:50,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:50,813 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:50,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:38:50,813 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:50,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:50,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2051747336, now seen corresponding path program 1 times [2025-02-08 08:38:50,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:50,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23397808] [2025-02-08 08:38:50,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:50,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:50,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:38:50,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:38:50,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:50,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:38:50,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:50,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23397808] [2025-02-08 08:38:50,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23397808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:50,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:50,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:38:50,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168347415] [2025-02-08 08:38:50,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:50,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:50,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:50,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:50,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:50,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2025-02-08 08:38:50,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 89 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-02-08 08:38:50,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:50,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2025-02-08 08:38:50,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:52,758 INFO L124 PetriNetUnfolderBase]: 21304/31976 cut-off events. [2025-02-08 08:38:52,759 INFO L125 PetriNetUnfolderBase]: For 14538/16563 co-relation queries the response was YES. [2025-02-08 08:38:52,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73673 conditions, 31976 events. 21304/31976 cut-off events. For 14538/16563 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 209601 event pairs, 16751 based on Foata normal form. 0/25152 useless extension candidates. Maximal degree in co-relation 71508. Up to 28540 conditions per place. [2025-02-08 08:38:52,913 INFO L140 encePairwiseOnDemand]: 84/88 looper letters, 63 selfloop transitions, 4 changer transitions 0/87 dead transitions. [2025-02-08 08:38:52,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 87 transitions, 462 flow [2025-02-08 08:38:52,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:52,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-02-08 08:38:52,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-02-08 08:38:52,914 INFO L175 Difference]: Start difference. First operand has 80 places, 89 transitions, 334 flow. Second operand 4 states and 144 transitions. [2025-02-08 08:38:52,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 87 transitions, 462 flow [2025-02-08 08:38:52,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 87 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:38:52,921 INFO L231 Difference]: Finished difference. Result has 80 places, 87 transitions, 334 flow [2025-02-08 08:38:52,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=334, PETRI_PLACES=80, PETRI_TRANSITIONS=87} [2025-02-08 08:38:52,922 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-02-08 08:38:52,922 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 87 transitions, 334 flow [2025-02-08 08:38:52,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-02-08 08:38:52,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:52,922 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:52,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:38:52,923 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:52,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:52,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2051747337, now seen corresponding path program 1 times [2025-02-08 08:38:52,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:52,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989263664] [2025-02-08 08:38:52,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:52,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:52,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:38:52,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:38:52,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:52,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:38:53,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:53,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989263664] [2025-02-08 08:38:53,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989263664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:53,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:53,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:38:53,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603040527] [2025-02-08 08:38:53,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:53,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:38:53,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:53,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:38:53,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:38:53,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-02-08 08:38:53,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 87 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 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-02-08 08:38:53,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:53,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-02-08 08:38:53,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:55,623 INFO L124 PetriNetUnfolderBase]: 28158/42886 cut-off events. [2025-02-08 08:38:55,623 INFO L125 PetriNetUnfolderBase]: For 17787/20250 co-relation queries the response was YES. [2025-02-08 08:38:55,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97132 conditions, 42886 events. 28158/42886 cut-off events. For 17787/20250 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 291935 event pairs, 22671 based on Foata normal form. 340/33945 useless extension candidates. Maximal degree in co-relation 92907. Up to 28549 conditions per place. [2025-02-08 08:38:55,820 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 94 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2025-02-08 08:38:55,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 120 transitions, 638 flow [2025-02-08 08:38:55,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:38:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:38:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2025-02-08 08:38:55,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5397727272727273 [2025-02-08 08:38:55,821 INFO L175 Difference]: Start difference. First operand has 80 places, 87 transitions, 334 flow. Second operand 4 states and 190 transitions. [2025-02-08 08:38:55,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 120 transitions, 638 flow [2025-02-08 08:38:55,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 120 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:55,829 INFO L231 Difference]: Finished difference. Result has 82 places, 87 transitions, 350 flow [2025-02-08 08:38:55,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=350, PETRI_PLACES=82, PETRI_TRANSITIONS=87} [2025-02-08 08:38:55,829 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2025-02-08 08:38:55,829 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 87 transitions, 350 flow [2025-02-08 08:38:55,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 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-02-08 08:38:55,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:55,830 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:55,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:38:55,830 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:55,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:55,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1129337908, now seen corresponding path program 1 times [2025-02-08 08:38:55,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:55,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120366504] [2025-02-08 08:38:55,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:55,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:55,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:38:55,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:38:55,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:55,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:55,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:55,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120366504] [2025-02-08 08:38:55,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120366504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:55,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:55,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:38:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664603705] [2025-02-08 08:38:55,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:55,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:38:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:55,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:38:55,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:38:55,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-02-08 08:38:55,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 87 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-02-08 08:38:55,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:55,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-02-08 08:38:55,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:58,144 INFO L124 PetriNetUnfolderBase]: 28158/42874 cut-off events. [2025-02-08 08:38:58,145 INFO L125 PetriNetUnfolderBase]: For 18502/20965 co-relation queries the response was YES. [2025-02-08 08:38:58,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97845 conditions, 42874 events. 28158/42874 cut-off events. For 18502/20965 co-relation queries the response was YES. Maximal size of possible extension queue 1077. Compared 288565 event pairs, 9976 based on Foata normal form. 6/33599 useless extension candidates. Maximal degree in co-relation 93617. Up to 32505 conditions per place. [2025-02-08 08:38:58,415 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 78 selfloop transitions, 2 changer transitions 5/105 dead transitions. [2025-02-08 08:38:58,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 105 transitions, 567 flow [2025-02-08 08:38:58,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:38:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:38:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2025-02-08 08:38:58,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553030303030303 [2025-02-08 08:38:58,417 INFO L175 Difference]: Start difference. First operand has 82 places, 87 transitions, 350 flow. Second operand 3 states and 146 transitions. [2025-02-08 08:38:58,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 105 transitions, 567 flow [2025-02-08 08:38:58,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 105 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:58,427 INFO L231 Difference]: Finished difference. Result has 83 places, 87 transitions, 353 flow [2025-02-08 08:38:58,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=83, PETRI_TRANSITIONS=87} [2025-02-08 08:38:58,427 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 6 predicate places. [2025-02-08 08:38:58,428 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 87 transitions, 353 flow [2025-02-08 08:38:58,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-02-08 08:38:58,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:58,428 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:58,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:38:58,429 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:38:58,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:58,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1351249922, now seen corresponding path program 1 times [2025-02-08 08:38:58,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:58,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721427041] [2025-02-08 08:38:58,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:58,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:58,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:38:58,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:38:58,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:58,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:58,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:38:58,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:58,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721427041] [2025-02-08 08:38:58,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721427041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:58,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:58,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:38:58,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218922461] [2025-02-08 08:38:58,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:58,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:58,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:58,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:58,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:38:59,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2025-02-08 08:38:59,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 87 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-02-08 08:38:59,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:59,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2025-02-08 08:38:59,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:39:01,068 INFO L124 PetriNetUnfolderBase]: 24047/36894 cut-off events. [2025-02-08 08:39:01,068 INFO L125 PetriNetUnfolderBase]: For 19074/21307 co-relation queries the response was YES. [2025-02-08 08:39:01,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84377 conditions, 36894 events. 24047/36894 cut-off events. For 19074/21307 co-relation queries the response was YES. Maximal size of possible extension queue 983. Compared 252181 event pairs, 19339 based on Foata normal form. 1264/29818 useless extension candidates. Maximal degree in co-relation 84325. Up to 32428 conditions per place. [2025-02-08 08:39:01,221 INFO L140 encePairwiseOnDemand]: 84/88 looper letters, 59 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2025-02-08 08:39:01,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 85 transitions, 475 flow [2025-02-08 08:39:01,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:39:01,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:39:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2025-02-08 08:39:01,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-02-08 08:39:01,222 INFO L175 Difference]: Start difference. First operand has 83 places, 87 transitions, 353 flow. Second operand 4 states and 154 transitions. [2025-02-08 08:39:01,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 85 transitions, 475 flow [2025-02-08 08:39:01,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 85 transitions, 471 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:39:01,231 INFO L231 Difference]: Finished difference. Result has 81 places, 85 transitions, 353 flow [2025-02-08 08:39:01,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=353, PETRI_PLACES=81, PETRI_TRANSITIONS=85} [2025-02-08 08:39:01,231 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-02-08 08:39:01,231 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 85 transitions, 353 flow [2025-02-08 08:39:01,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-02-08 08:39:01,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:39:01,232 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:39:01,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:39:01,232 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-02-08 08:39:01,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:39:01,232 INFO L85 PathProgramCache]: Analyzing trace with hash 339264493, now seen corresponding path program 1 times [2025-02-08 08:39:01,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:39:01,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628481717] [2025-02-08 08:39:01,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:39:01,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:39:01,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:39:01,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:39:01,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:39:01,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:39:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:39:01,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:39:01,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628481717] [2025-02-08 08:39:01,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628481717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:39:01,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:39:01,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:39:01,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998218204] [2025-02-08 08:39:01,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:39:01,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:39:01,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:39:01,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:39:01,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:39:01,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 88 [2025-02-08 08:39:01,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 85 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:39:01,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:39:01,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 88 [2025-02-08 08:39:01,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand