./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:14:14,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:14:14,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:14:14,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:14:14,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:14:14,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:14:14,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:14:14,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:14:14,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:14:14,506 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:14:14,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:14:14,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:14:14,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:14:14,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:14:14,507 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:14:14,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:14:14,508 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:14:14,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:14:14,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:14:14,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:14:14,508 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:14:14,508 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:14:14,508 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:14:14,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:14:14,508 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:14:14,508 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:14:14,509 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:14:14,509 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:14:14,509 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:14:14,509 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:14:14,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:14:14,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:14:14,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:14:14,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:14:14,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:14:14,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:14:14,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:14:14,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:14:14,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:14:14,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:14:14,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:14:14,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:14:14,510 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac [2025-03-04 10:14:14,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:14:14,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:14:14,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:14:14,741 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:14:14,741 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:14:14,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-03-04 10:14:15,877 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d841fbb7/cfb8ae0e12174baaa749bb58e3a9c686/FLAG75dc331ca [2025-03-04 10:14:16,145 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:14:16,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-03-04 10:14:16,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d841fbb7/cfb8ae0e12174baaa749bb58e3a9c686/FLAG75dc331ca [2025-03-04 10:14:16,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d841fbb7/cfb8ae0e12174baaa749bb58e3a9c686 [2025-03-04 10:14:16,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:14:16,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:14:16,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:14:16,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:14:16,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:14:16,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10595b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16, skipping insertion in model container [2025-03-04 10:14:16,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:14:16,357 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:14:16,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:14:16,370 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:14:16,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:14:16,408 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:14:16,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16 WrapperNode [2025-03-04 10:14:16,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:14:16,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:14:16,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:14:16,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:14:16,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,456 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 239 [2025-03-04 10:14:16,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:14:16,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:14:16,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:14:16,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:14:16,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,483 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 10:14:16,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,490 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:14:16,496 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:14:16,496 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:14:16,496 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:14:16,500 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:14:16,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:16,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:14:16,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:14:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:14:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:14:16,546 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:14:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:14:16,547 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:14:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:14:16,547 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:14:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:14:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:14:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:14:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:14:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:14:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:14:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:14:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:14:16,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:14:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:14:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:14:16,548 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:14:16,640 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:14:16,643 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:14:17,008 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:14:17,008 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:14:17,260 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:14:17,260 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:14:17,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:14:17 BoogieIcfgContainer [2025-03-04 10:14:17,261 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:14:17,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:14:17,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:14:17,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:14:17,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:14:16" (1/3) ... [2025-03-04 10:14:17,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7beef743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:14:17, skipping insertion in model container [2025-03-04 10:14:17,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (2/3) ... [2025-03-04 10:14:17,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7beef743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:14:17, skipping insertion in model container [2025-03-04 10:14:17,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:14:17" (3/3) ... [2025-03-04 10:14:17,269 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-03-04 10:14:17,281 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:14:17,282 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-3-nl.wvr.c that has 4 procedures, 54 locations, 1 initial locations, 5 loop locations, and 16 error locations. [2025-03-04 10:14:17,282 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:14:17,337 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:14:17,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 60 transitions, 141 flow [2025-03-04 10:14:17,397 INFO L124 PetriNetUnfolderBase]: 7/57 cut-off events. [2025-03-04 10:14:17,399 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:14:17,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 57 events. 7/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-03-04 10:14:17,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 60 transitions, 141 flow [2025-03-04 10:14:17,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 56 transitions, 130 flow [2025-03-04 10:14:17,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:14:17,423 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;@68abc90e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:14:17,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-04 10:14:17,426 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:14:17,427 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:14:17,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:14:17,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:17,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:14:17,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:17,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:17,432 INFO L85 PathProgramCache]: Analyzing trace with hash 670549, now seen corresponding path program 1 times [2025-03-04 10:14:17,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:17,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763851179] [2025-03-04 10:14:17,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:17,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:17,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:14:17,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:14:17,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:17,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:17,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:17,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763851179] [2025-03-04 10:14:17,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763851179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:17,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:17,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:14:17,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018296285] [2025-03-04 10:14:17,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:17,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:14:17,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:17,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:14:17,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:14:17,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:14:17,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:17,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:17,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:14:17,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:18,329 INFO L124 PetriNetUnfolderBase]: 3952/5920 cut-off events. [2025-03-04 10:14:18,330 INFO L125 PetriNetUnfolderBase]: For 289/289 co-relation queries the response was YES. [2025-03-04 10:14:18,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11621 conditions, 5920 events. 3952/5920 cut-off events. For 289/289 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 32790 event pairs, 3528 based on Foata normal form. 1/3860 useless extension candidates. Maximal degree in co-relation 11101. Up to 5391 conditions per place. [2025-03-04 10:14:18,384 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 40 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-03-04 10:14:18,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 202 flow [2025-03-04 10:14:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:14:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:14:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-04 10:14:18,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2025-03-04 10:14:18,400 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 130 flow. Second operand 3 states and 83 transitions. [2025-03-04 10:14:18,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 202 flow [2025-03-04 10:14:18,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 190 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:14:18,412 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 110 flow [2025-03-04 10:14:18,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2025-03-04 10:14:18,418 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2025-03-04 10:14:18,419 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 110 flow [2025-03-04 10:14:18,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:18,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:18,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:14:18,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:14:18,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:18,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:18,422 INFO L85 PathProgramCache]: Analyzing trace with hash 670550, now seen corresponding path program 1 times [2025-03-04 10:14:18,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:18,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970604617] [2025-03-04 10:14:18,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:18,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:18,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:14:18,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:14:18,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:18,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:18,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:18,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970604617] [2025-03-04 10:14:18,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970604617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:18,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:18,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:14:18,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360891919] [2025-03-04 10:14:18,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:18,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:14:18,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:18,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:14:18,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:14:18,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:14:18,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:18,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:18,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:14:18,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:19,158 INFO L124 PetriNetUnfolderBase]: 3953/5923 cut-off events. [2025-03-04 10:14:19,158 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-04 10:14:19,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11440 conditions, 5923 events. 3953/5923 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 32817 event pairs, 3528 based on Foata normal form. 0/3860 useless extension candidates. Maximal degree in co-relation 11411. Up to 5400 conditions per place. [2025-03-04 10:14:19,191 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 43 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2025-03-04 10:14:19,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 210 flow [2025-03-04 10:14:19,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:14:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:14:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-03-04 10:14:19,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-04 10:14:19,194 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 110 flow. Second operand 4 states and 96 transitions. [2025-03-04 10:14:19,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 210 flow [2025-03-04 10:14:19,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:19,197 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 133 flow [2025-03-04 10:14:19,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2025-03-04 10:14:19,198 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2025-03-04 10:14:19,198 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 133 flow [2025-03-04 10:14:19,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:19,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:19,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:14:19,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:14:19,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:19,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:19,199 INFO L85 PathProgramCache]: Analyzing trace with hash 20788875, now seen corresponding path program 1 times [2025-03-04 10:14:19,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:19,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974874389] [2025-03-04 10:14:19,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:19,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:14:19,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:14:19,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:19,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:19,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:19,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974874389] [2025-03-04 10:14:19,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974874389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:19,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:19,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:14:19,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158663176] [2025-03-04 10:14:19,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:19,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:14:19,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:19,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:14:19,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:14:19,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:14:19,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:19,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:19,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:14:19,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:19,801 INFO L124 PetriNetUnfolderBase]: 3954/5926 cut-off events. [2025-03-04 10:14:19,801 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-04 10:14:19,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11457 conditions, 5926 events. 3954/5926 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 32812 event pairs, 3528 based on Foata normal form. 0/3862 useless extension candidates. Maximal degree in co-relation 11432. Up to 5399 conditions per place. [2025-03-04 10:14:19,828 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 43 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2025-03-04 10:14:19,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 239 flow [2025-03-04 10:14:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:14:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:14:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-04 10:14:19,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37 [2025-03-04 10:14:19,830 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 133 flow. Second operand 5 states and 111 transitions. [2025-03-04 10:14:19,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 239 flow [2025-03-04 10:14:19,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:14:19,831 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 167 flow [2025-03-04 10:14:19,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2025-03-04 10:14:19,832 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-03-04 10:14:19,832 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 167 flow [2025-03-04 10:14:19,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:19,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:19,832 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:14:19,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:14:19,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:19,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:19,833 INFO L85 PathProgramCache]: Analyzing trace with hash 644419464, now seen corresponding path program 1 times [2025-03-04 10:14:19,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:19,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673507065] [2025-03-04 10:14:19,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:19,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:19,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:14:19,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:14:19,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:19,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:20,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:20,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:20,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673507065] [2025-03-04 10:14:20,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673507065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:20,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294750373] [2025-03-04 10:14:20,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:20,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:20,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:20,009 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:20,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:14:20,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:14:20,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:14:20,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:20,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:20,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:14:20,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:20,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:14:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:20,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:20,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294750373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:20,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:20,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:14:20,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133038014] [2025-03-04 10:14:20,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:20,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:20,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:20,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:20,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:20,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:14:20,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 167 flow. Second operand has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:20,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:20,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:14:20,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:20,923 INFO L124 PetriNetUnfolderBase]: 3955/5928 cut-off events. [2025-03-04 10:14:20,923 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-04 10:14:20,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11480 conditions, 5928 events. 3955/5928 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 32803 event pairs, 3528 based on Foata normal form. 0/3867 useless extension candidates. Maximal degree in co-relation 11442. Up to 5400 conditions per place. [2025-03-04 10:14:20,954 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 42 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2025-03-04 10:14:20,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 58 transitions, 282 flow [2025-03-04 10:14:20,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:14:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:14:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2025-03-04 10:14:20,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30625 [2025-03-04 10:14:20,956 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 167 flow. Second operand 8 states and 147 transitions. [2025-03-04 10:14:20,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 58 transitions, 282 flow [2025-03-04 10:14:20,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:14:20,957 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 197 flow [2025-03-04 10:14:20,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=197, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2025-03-04 10:14:20,958 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2025-03-04 10:14:20,959 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 197 flow [2025-03-04 10:14:20,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:20,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:20,959 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 10:14:20,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:21,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:21,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:21,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:21,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1496705940, now seen corresponding path program 1 times [2025-03-04 10:14:21,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:21,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519162298] [2025-03-04 10:14:21,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:21,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:21,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:14:21,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:14:21,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:21,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:21,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:21,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519162298] [2025-03-04 10:14:21,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519162298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:21,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031453475] [2025-03-04 10:14:21,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:21,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:21,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:21,359 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:21,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:14:21,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:14:21,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:14:21,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:21,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:21,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:14:21,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:21,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:14:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:21,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:21,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031453475] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:21,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:21,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:14:21,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674709862] [2025-03-04 10:14:21,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:21,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:14:21,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:21,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:14:21,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:14:21,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:14:21,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 197 flow. Second operand has 13 states, 13 states have (on average 13.307692307692308) internal successors, (173), 13 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:21,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:21,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:14:21,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:22,392 INFO L124 PetriNetUnfolderBase]: 3955/5927 cut-off events. [2025-03-04 10:14:22,392 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-04 10:14:22,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11487 conditions, 5927 events. 3955/5927 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 32866 event pairs, 3528 based on Foata normal form. 0/3867 useless extension candidates. Maximal degree in co-relation 11441. Up to 5391 conditions per place. [2025-03-04 10:14:22,419 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 36 selfloop transitions, 15 changer transitions 0/57 dead transitions. [2025-03-04 10:14:22,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 57 transitions, 295 flow [2025-03-04 10:14:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:14:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:14:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2025-03-04 10:14:22,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2025-03-04 10:14:22,421 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 197 flow. Second operand 7 states and 133 transitions. [2025-03-04 10:14:22,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 57 transitions, 295 flow [2025-03-04 10:14:22,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 248 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-04 10:14:22,422 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 176 flow [2025-03-04 10:14:22,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2025-03-04 10:14:22,423 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2025-03-04 10:14:22,423 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 176 flow [2025-03-04 10:14:22,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.307692307692308) internal successors, (173), 13 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:22,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:22,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:22,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:22,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:22,624 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:22,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:22,624 INFO L85 PathProgramCache]: Analyzing trace with hash 850045723, now seen corresponding path program 1 times [2025-03-04 10:14:22,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:22,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904007284] [2025-03-04 10:14:22,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:22,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:22,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:14:22,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:14:22,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:22,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:22,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:22,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904007284] [2025-03-04 10:14:22,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904007284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:22,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:22,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:14:22,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969437345] [2025-03-04 10:14:22,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:22,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:14:22,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:22,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:14:22,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:14:22,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:14:22,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:22,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:22,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:14:22,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:23,058 INFO L124 PetriNetUnfolderBase]: 4115/6207 cut-off events. [2025-03-04 10:14:23,058 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-04 10:14:23,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12034 conditions, 6207 events. 4115/6207 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 34472 event pairs, 3675 based on Foata normal form. 115/4226 useless extension candidates. Maximal degree in co-relation 11435. Up to 5403 conditions per place. [2025-03-04 10:14:23,096 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 66 selfloop transitions, 5 changer transitions 1/78 dead transitions. [2025-03-04 10:14:23,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 391 flow [2025-03-04 10:14:23,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:14:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:14:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2025-03-04 10:14:23,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-04 10:14:23,098 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 176 flow. Second operand 5 states and 145 transitions. [2025-03-04 10:14:23,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 391 flow [2025-03-04 10:14:23,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 350 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:23,100 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 194 flow [2025-03-04 10:14:23,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2025-03-04 10:14:23,101 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2025-03-04 10:14:23,101 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 194 flow [2025-03-04 10:14:23,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:23,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:23,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:23,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:14:23,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:23,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1472194995, now seen corresponding path program 1 times [2025-03-04 10:14:23,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:23,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344053275] [2025-03-04 10:14:23,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:23,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:23,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:14:23,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:14:23,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:23,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:23,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:23,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344053275] [2025-03-04 10:14:23,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344053275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:23,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:23,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:14:23,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947583921] [2025-03-04 10:14:23,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:23,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:14:23,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:23,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:14:23,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:14:23,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:14:23,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:23,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:23,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:14:23,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:23,474 INFO L124 PetriNetUnfolderBase]: 3026/4591 cut-off events. [2025-03-04 10:14:23,475 INFO L125 PetriNetUnfolderBase]: For 415/415 co-relation queries the response was YES. [2025-03-04 10:14:23,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9751 conditions, 4591 events. 3026/4591 cut-off events. For 415/415 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 24054 event pairs, 2670 based on Foata normal form. 0/3305 useless extension candidates. Maximal degree in co-relation 9177. Up to 4162 conditions per place. [2025-03-04 10:14:23,494 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 43 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2025-03-04 10:14:23,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 56 transitions, 282 flow [2025-03-04 10:14:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:14:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:14:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2025-03-04 10:14:23,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34 [2025-03-04 10:14:23,496 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 194 flow. Second operand 5 states and 102 transitions. [2025-03-04 10:14:23,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 56 transitions, 282 flow [2025-03-04 10:14:23,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:23,497 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 191 flow [2025-03-04 10:14:23,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-03-04 10:14:23,498 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2025-03-04 10:14:23,498 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 191 flow [2025-03-04 10:14:23,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:23,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:23,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:23,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:14:23,499 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:23,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:23,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1472194994, now seen corresponding path program 1 times [2025-03-04 10:14:23,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:23,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938309155] [2025-03-04 10:14:23,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:23,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:23,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:14:23,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:14:23,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:23,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:14:23,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938309155] [2025-03-04 10:14:23,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938309155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039578460] [2025-03-04 10:14:23,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:23,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:23,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:23,674 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:23,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:14:23,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:14:23,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:14:23,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:23,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:23,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:14:23,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:23,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:14:23,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:14:23,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 10:14:23,804 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:14:23,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:14:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:14:23,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:14:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039578460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:23,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:14:23,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-03-04 10:14:23,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798185812] [2025-03-04 10:14:23,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:23,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:14:23,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:23,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:14:23,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:14:23,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:14:23,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:23,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:23,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:14:23,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:24,021 INFO L124 PetriNetUnfolderBase]: 2129/3275 cut-off events. [2025-03-04 10:14:24,021 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2025-03-04 10:14:24,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6656 conditions, 3275 events. 2129/3275 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16007 event pairs, 1813 based on Foata normal form. 0/2642 useless extension candidates. Maximal degree in co-relation 6038. Up to 2905 conditions per place. [2025-03-04 10:14:24,030 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 43 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2025-03-04 10:14:24,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 273 flow [2025-03-04 10:14:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:14:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:14:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-04 10:14:24,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3625 [2025-03-04 10:14:24,031 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 191 flow. Second operand 4 states and 87 transitions. [2025-03-04 10:14:24,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 273 flow [2025-03-04 10:14:24,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:14:24,032 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 176 flow [2025-03-04 10:14:24,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2025-03-04 10:14:24,033 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2025-03-04 10:14:24,033 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 176 flow [2025-03-04 10:14:24,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:24,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:24,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:24,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:14:24,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:24,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:24,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:24,234 INFO L85 PathProgramCache]: Analyzing trace with hash -558181929, now seen corresponding path program 1 times [2025-03-04 10:14:24,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:24,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838449339] [2025-03-04 10:14:24,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:24,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:14:24,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:14:24,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:24,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:24,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:24,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838449339] [2025-03-04 10:14:24,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838449339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:24,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:24,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:14:24,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428682045] [2025-03-04 10:14:24,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:24,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:14:24,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:24,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:14:24,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:14:24,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:14:24,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:24,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:24,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:14:24,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:24,414 INFO L124 PetriNetUnfolderBase]: 1935/2979 cut-off events. [2025-03-04 10:14:24,414 INFO L125 PetriNetUnfolderBase]: For 416/416 co-relation queries the response was YES. [2025-03-04 10:14:24,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6244 conditions, 2979 events. 1935/2979 cut-off events. For 416/416 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14241 event pairs, 695 based on Foata normal form. 77/2497 useless extension candidates. Maximal degree in co-relation 5992. Up to 2082 conditions per place. [2025-03-04 10:14:24,424 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 57 selfloop transitions, 2 changer transitions 3/68 dead transitions. [2025-03-04 10:14:24,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 338 flow [2025-03-04 10:14:24,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:14:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:14:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-04 10:14:24,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 10:14:24,426 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 176 flow. Second operand 3 states and 96 transitions. [2025-03-04 10:14:24,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 338 flow [2025-03-04 10:14:24,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:24,427 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 165 flow [2025-03-04 10:14:24,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2025-03-04 10:14:24,427 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-03-04 10:14:24,428 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 165 flow [2025-03-04 10:14:24,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:24,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:24,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:24,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:14:24,428 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:24,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:24,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1771972020, now seen corresponding path program 1 times [2025-03-04 10:14:24,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:24,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653881013] [2025-03-04 10:14:24,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:24,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:24,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:14:24,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:14:24,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:24,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:24,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:24,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653881013] [2025-03-04 10:14:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653881013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:24,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:24,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:14:24,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698237911] [2025-03-04 10:14:24,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:24,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:14:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:24,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:14:24,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:14:24,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:14:24,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:24,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:24,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:14:24,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:24,601 INFO L124 PetriNetUnfolderBase]: 1664/2560 cut-off events. [2025-03-04 10:14:24,601 INFO L125 PetriNetUnfolderBase]: For 502/502 co-relation queries the response was YES. [2025-03-04 10:14:24,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5765 conditions, 2560 events. 1664/2560 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11740 event pairs, 717 based on Foata normal form. 18/2225 useless extension candidates. Maximal degree in co-relation 5729. Up to 2249 conditions per place. [2025-03-04 10:14:24,609 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 52 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2025-03-04 10:14:24,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 301 flow [2025-03-04 10:14:24,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:14:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:14:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-04 10:14:24,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2025-03-04 10:14:24,610 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 165 flow. Second operand 3 states and 89 transitions. [2025-03-04 10:14:24,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 301 flow [2025-03-04 10:14:24,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 295 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:24,612 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 182 flow [2025-03-04 10:14:24,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2025-03-04 10:14:24,612 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2025-03-04 10:14:24,612 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 182 flow [2025-03-04 10:14:24,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:24,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:24,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:24,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:14:24,613 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:24,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:24,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1018152558, now seen corresponding path program 1 times [2025-03-04 10:14:24,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:24,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738479845] [2025-03-04 10:14:24,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:24,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:24,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:14:24,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:14:24,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:24,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:24,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:14:24,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738479845] [2025-03-04 10:14:24,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738479845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:24,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:24,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:14:24,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926857167] [2025-03-04 10:14:24,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:24,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:14:24,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:24,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:14:24,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:14:24,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:14:24,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:24,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:24,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:14:24,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:24,846 INFO L124 PetriNetUnfolderBase]: 1905/2949 cut-off events. [2025-03-04 10:14:24,846 INFO L125 PetriNetUnfolderBase]: For 1505/1505 co-relation queries the response was YES. [2025-03-04 10:14:24,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7200 conditions, 2949 events. 1905/2949 cut-off events. For 1505/1505 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13506 event pairs, 1453 based on Foata normal form. 64/2659 useless extension candidates. Maximal degree in co-relation 7163. Up to 2349 conditions per place. [2025-03-04 10:14:24,855 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 43 selfloop transitions, 3 changer transitions 19/71 dead transitions. [2025-03-04 10:14:24,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 374 flow [2025-03-04 10:14:24,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:14:24,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:14:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-04 10:14:24,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-03-04 10:14:24,856 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 182 flow. Second operand 4 states and 114 transitions. [2025-03-04 10:14:24,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 374 flow [2025-03-04 10:14:24,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 349 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:24,858 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 176 flow [2025-03-04 10:14:24,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2025-03-04 10:14:24,858 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 1 predicate places. [2025-03-04 10:14:24,858 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 176 flow [2025-03-04 10:14:24,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:24,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:24,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:24,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:14:24,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:24,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:24,859 INFO L85 PathProgramCache]: Analyzing trace with hash 924549831, now seen corresponding path program 1 times [2025-03-04 10:14:24,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:24,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535144462] [2025-03-04 10:14:24,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:24,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:24,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:14:24,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:14:24,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:24,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:14:25,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:25,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535144462] [2025-03-04 10:14:25,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535144462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:25,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494726801] [2025-03-04 10:14:25,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:25,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:25,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:25,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:25,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:14:25,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:14:25,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:14:25,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:25,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:25,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:14:25,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:14:25,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:14:25,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494726801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:25,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:14:25,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-04 10:14:25,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606726011] [2025-03-04 10:14:25,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:25,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:14:25,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:25,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:14:25,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:14:25,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:14:25,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:25,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:25,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:14:25,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:25,305 INFO L124 PetriNetUnfolderBase]: 1255/1957 cut-off events. [2025-03-04 10:14:25,306 INFO L125 PetriNetUnfolderBase]: For 488/488 co-relation queries the response was YES. [2025-03-04 10:14:25,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 1957 events. 1255/1957 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8568 event pairs, 929 based on Foata normal form. 0/1814 useless extension candidates. Maximal degree in co-relation 4473. Up to 1766 conditions per place. [2025-03-04 10:14:25,311 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 41 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2025-03-04 10:14:25,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 50 transitions, 256 flow [2025-03-04 10:14:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:14:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:14:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-03-04 10:14:25,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2025-03-04 10:14:25,313 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 176 flow. Second operand 4 states and 92 transitions. [2025-03-04 10:14:25,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 50 transitions, 256 flow [2025-03-04 10:14:25,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 249 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:25,314 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 167 flow [2025-03-04 10:14:25,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2025-03-04 10:14:25,315 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2025-03-04 10:14:25,315 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 167 flow [2025-03-04 10:14:25,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:25,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:25,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:25,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:25,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:25,516 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:25,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash 924549830, now seen corresponding path program 1 times [2025-03-04 10:14:25,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:25,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249682414] [2025-03-04 10:14:25,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:25,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:25,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:14:25,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:14:25,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:25,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:25,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:14:25,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:25,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249682414] [2025-03-04 10:14:25,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249682414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:25,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:25,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:14:25,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538764371] [2025-03-04 10:14:25,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:25,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:14:25,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:25,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:14:25,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:14:25,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:14:25,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:25,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:25,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:14:25,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:25,671 INFO L124 PetriNetUnfolderBase]: 901/1439 cut-off events. [2025-03-04 10:14:25,671 INFO L125 PetriNetUnfolderBase]: For 315/315 co-relation queries the response was YES. [2025-03-04 10:14:25,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3204 conditions, 1439 events. 901/1439 cut-off events. For 315/315 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6066 event pairs, 653 based on Foata normal form. 97/1461 useless extension candidates. Maximal degree in co-relation 3164. Up to 1270 conditions per place. [2025-03-04 10:14:25,676 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 40 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2025-03-04 10:14:25,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 245 flow [2025-03-04 10:14:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:14:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:14:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-03-04 10:14:25,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2025-03-04 10:14:25,677 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 167 flow. Second operand 4 states and 82 transitions. [2025-03-04 10:14:25,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 245 flow [2025-03-04 10:14:25,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:25,678 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 160 flow [2025-03-04 10:14:25,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2025-03-04 10:14:25,679 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2025-03-04 10:14:25,679 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 160 flow [2025-03-04 10:14:25,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:25,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:25,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:25,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:14:25,679 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:25,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:25,680 INFO L85 PathProgramCache]: Analyzing trace with hash 173188446, now seen corresponding path program 1 times [2025-03-04 10:14:25,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:25,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981795422] [2025-03-04 10:14:25,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:25,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:25,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:14:25,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:25,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:25,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:26,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:26,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981795422] [2025-03-04 10:14:26,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981795422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:26,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:26,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:26,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372870115] [2025-03-04 10:14:26,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:26,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:26,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:26,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:26,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:26,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:26,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 160 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:26,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:26,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:26,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:26,729 INFO L124 PetriNetUnfolderBase]: 1303/2122 cut-off events. [2025-03-04 10:14:26,729 INFO L125 PetriNetUnfolderBase]: For 456/456 co-relation queries the response was YES. [2025-03-04 10:14:26,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4706 conditions, 2122 events. 1303/2122 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10368 event pairs, 135 based on Foata normal form. 1/2069 useless extension candidates. Maximal degree in co-relation 4667. Up to 1406 conditions per place. [2025-03-04 10:14:26,737 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 106 selfloop transitions, 25 changer transitions 3/139 dead transitions. [2025-03-04 10:14:26,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 139 transitions, 675 flow [2025-03-04 10:14:26,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:14:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:14:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 283 transitions. [2025-03-04 10:14:26,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39305555555555555 [2025-03-04 10:14:26,740 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 160 flow. Second operand 12 states and 283 transitions. [2025-03-04 10:14:26,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 139 transitions, 675 flow [2025-03-04 10:14:26,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 139 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:26,743 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 293 flow [2025-03-04 10:14:26,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=293, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2025-03-04 10:14:26,744 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2025-03-04 10:14:26,744 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 293 flow [2025-03-04 10:14:26,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:26,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:26,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:26,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:14:26,745 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:26,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:26,745 INFO L85 PathProgramCache]: Analyzing trace with hash -56616962, now seen corresponding path program 2 times [2025-03-04 10:14:26,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:26,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47678755] [2025-03-04 10:14:26,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:26,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:26,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:14:26,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:26,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:26,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:27,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:27,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47678755] [2025-03-04 10:14:27,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47678755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:27,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:27,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:27,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782993964] [2025-03-04 10:14:27,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:27,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:27,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:27,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:27,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:27,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:27,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 293 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:27,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:27,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:27,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:27,787 INFO L124 PetriNetUnfolderBase]: 1470/2398 cut-off events. [2025-03-04 10:14:27,787 INFO L125 PetriNetUnfolderBase]: For 1566/1566 co-relation queries the response was YES. [2025-03-04 10:14:27,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6578 conditions, 2398 events. 1470/2398 cut-off events. For 1566/1566 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11955 event pairs, 357 based on Foata normal form. 1/2333 useless extension candidates. Maximal degree in co-relation 6534. Up to 1747 conditions per place. [2025-03-04 10:14:27,796 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 105 selfloop transitions, 33 changer transitions 3/146 dead transitions. [2025-03-04 10:14:27,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 146 transitions, 862 flow [2025-03-04 10:14:27,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:27,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:27,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 259 transitions. [2025-03-04 10:14:27,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3924242424242424 [2025-03-04 10:14:27,798 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 293 flow. Second operand 11 states and 259 transitions. [2025-03-04 10:14:27,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 146 transitions, 862 flow [2025-03-04 10:14:27,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 146 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:27,801 INFO L231 Difference]: Finished difference. Result has 86 places, 91 transitions, 517 flow [2025-03-04 10:14:27,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=517, PETRI_PLACES=86, PETRI_TRANSITIONS=91} [2025-03-04 10:14:27,802 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 27 predicate places. [2025-03-04 10:14:27,802 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 517 flow [2025-03-04 10:14:27,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:27,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:27,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:27,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:14:27,803 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:27,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:27,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1354919364, now seen corresponding path program 3 times [2025-03-04 10:14:27,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:27,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993890608] [2025-03-04 10:14:27,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:14:27,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:27,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:14:27,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-03-04 10:14:27,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:14:27,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:28,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:28,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993890608] [2025-03-04 10:14:28,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993890608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:28,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:28,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:28,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530569539] [2025-03-04 10:14:28,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:28,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:28,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:28,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:28,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:28,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:28,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 517 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:28,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:28,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:28,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:28,806 INFO L124 PetriNetUnfolderBase]: 1577/2602 cut-off events. [2025-03-04 10:14:28,806 INFO L125 PetriNetUnfolderBase]: For 3141/3141 co-relation queries the response was YES. [2025-03-04 10:14:28,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7943 conditions, 2602 events. 1577/2602 cut-off events. For 3141/3141 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 13430 event pairs, 306 based on Foata normal form. 1/2537 useless extension candidates. Maximal degree in co-relation 7891. Up to 1798 conditions per place. [2025-03-04 10:14:28,815 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 118 selfloop transitions, 39 changer transitions 3/165 dead transitions. [2025-03-04 10:14:28,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 165 transitions, 1120 flow [2025-03-04 10:14:28,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:14:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:14:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 283 transitions. [2025-03-04 10:14:28,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39305555555555555 [2025-03-04 10:14:28,817 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 517 flow. Second operand 12 states and 283 transitions. [2025-03-04 10:14:28,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 165 transitions, 1120 flow [2025-03-04 10:14:28,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 165 transitions, 1102 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-04 10:14:28,822 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 642 flow [2025-03-04 10:14:28,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=642, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2025-03-04 10:14:28,822 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 40 predicate places. [2025-03-04 10:14:28,823 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 642 flow [2025-03-04 10:14:28,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:28,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:28,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:28,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:14:28,823 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:28,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1639452504, now seen corresponding path program 4 times [2025-03-04 10:14:28,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:28,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157345074] [2025-03-04 10:14:28,824 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:14:28,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:28,830 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:14:28,852 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:28,852 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:14:28,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:29,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:29,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157345074] [2025-03-04 10:14:29,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157345074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:29,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:29,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:29,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210206870] [2025-03-04 10:14:29,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:29,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:29,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:29,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:29,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:29,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:14:29,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 642 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:29,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:29,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:14:29,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:29,846 INFO L124 PetriNetUnfolderBase]: 1942/3180 cut-off events. [2025-03-04 10:14:29,847 INFO L125 PetriNetUnfolderBase]: For 6254/6254 co-relation queries the response was YES. [2025-03-04 10:14:29,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10331 conditions, 3180 events. 1942/3180 cut-off events. For 6254/6254 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17108 event pairs, 450 based on Foata normal form. 1/3088 useless extension candidates. Maximal degree in co-relation 10275. Up to 2176 conditions per place. [2025-03-04 10:14:29,864 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 128 selfloop transitions, 43 changer transitions 3/178 dead transitions. [2025-03-04 10:14:29,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 178 transitions, 1335 flow [2025-03-04 10:14:29,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:14:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:14:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 277 transitions. [2025-03-04 10:14:29,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38472222222222224 [2025-03-04 10:14:29,867 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 642 flow. Second operand 12 states and 277 transitions. [2025-03-04 10:14:29,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 178 transitions, 1335 flow [2025-03-04 10:14:29,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 178 transitions, 1265 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-03-04 10:14:29,877 INFO L231 Difference]: Finished difference. Result has 106 places, 106 transitions, 754 flow [2025-03-04 10:14:29,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=754, PETRI_PLACES=106, PETRI_TRANSITIONS=106} [2025-03-04 10:14:29,877 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 47 predicate places. [2025-03-04 10:14:29,877 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 106 transitions, 754 flow [2025-03-04 10:14:29,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:29,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:29,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:29,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:14:29,878 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:29,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:29,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1818237882, now seen corresponding path program 5 times [2025-03-04 10:14:29,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:29,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52945714] [2025-03-04 10:14:29,879 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:14:29,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:29,887 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:14:29,911 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:29,912 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:14:29,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:30,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:30,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52945714] [2025-03-04 10:14:30,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52945714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:30,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:30,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:30,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043949667] [2025-03-04 10:14:30,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:30,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:30,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:30,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:30,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:30,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:30,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 754 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:30,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:30,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:30,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:30,853 INFO L124 PetriNetUnfolderBase]: 1744/2908 cut-off events. [2025-03-04 10:14:30,853 INFO L125 PetriNetUnfolderBase]: For 7313/7313 co-relation queries the response was YES. [2025-03-04 10:14:30,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10081 conditions, 2908 events. 1744/2908 cut-off events. For 7313/7313 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15775 event pairs, 410 based on Foata normal form. 1/2825 useless extension candidates. Maximal degree in co-relation 10021. Up to 2171 conditions per place. [2025-03-04 10:14:30,867 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 123 selfloop transitions, 38 changer transitions 3/169 dead transitions. [2025-03-04 10:14:30,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 169 transitions, 1340 flow [2025-03-04 10:14:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:14:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:14:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 274 transitions. [2025-03-04 10:14:30,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38055555555555554 [2025-03-04 10:14:30,869 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 754 flow. Second operand 12 states and 274 transitions. [2025-03-04 10:14:30,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 169 transitions, 1340 flow [2025-03-04 10:14:30,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 169 transitions, 1252 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-03-04 10:14:30,878 INFO L231 Difference]: Finished difference. Result has 113 places, 109 transitions, 775 flow [2025-03-04 10:14:30,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=775, PETRI_PLACES=113, PETRI_TRANSITIONS=109} [2025-03-04 10:14:30,879 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 54 predicate places. [2025-03-04 10:14:30,879 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 109 transitions, 775 flow [2025-03-04 10:14:30,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:30,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:30,879 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:30,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:14:30,880 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:30,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:30,881 INFO L85 PathProgramCache]: Analyzing trace with hash 917378694, now seen corresponding path program 6 times [2025-03-04 10:14:30,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:30,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811855595] [2025-03-04 10:14:30,881 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:14:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:30,888 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:14:30,907 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:30,907 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:14:30,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:31,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:31,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811855595] [2025-03-04 10:14:31,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811855595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:31,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:31,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:31,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410592836] [2025-03-04 10:14:31,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:31,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:31,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:31,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:31,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:31,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:31,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 109 transitions, 775 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:31,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:31,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:31,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:31,949 INFO L124 PetriNetUnfolderBase]: 1866/3130 cut-off events. [2025-03-04 10:14:31,949 INFO L125 PetriNetUnfolderBase]: For 8038/8038 co-relation queries the response was YES. [2025-03-04 10:14:31,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10874 conditions, 3130 events. 1866/3130 cut-off events. For 8038/8038 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 17354 event pairs, 597 based on Foata normal form. 1/3040 useless extension candidates. Maximal degree in co-relation 10811. Up to 2438 conditions per place. [2025-03-04 10:14:31,965 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 130 selfloop transitions, 36 changer transitions 3/174 dead transitions. [2025-03-04 10:14:31,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 174 transitions, 1468 flow [2025-03-04 10:14:31,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 258 transitions. [2025-03-04 10:14:31,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2025-03-04 10:14:31,969 INFO L175 Difference]: Start difference. First operand has 113 places, 109 transitions, 775 flow. Second operand 11 states and 258 transitions. [2025-03-04 10:14:31,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 174 transitions, 1468 flow [2025-03-04 10:14:31,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 174 transitions, 1382 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-03-04 10:14:31,984 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 922 flow [2025-03-04 10:14:31,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=922, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2025-03-04 10:14:31,984 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 60 predicate places. [2025-03-04 10:14:31,985 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 922 flow [2025-03-04 10:14:31,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:31,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:31,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:31,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:14:31,985 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:31,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:31,986 INFO L85 PathProgramCache]: Analyzing trace with hash -571622078, now seen corresponding path program 7 times [2025-03-04 10:14:31,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:31,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376986179] [2025-03-04 10:14:31,986 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:14:31,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:31,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:14:32,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:32,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:32,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:32,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:32,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376986179] [2025-03-04 10:14:32,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376986179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:32,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:32,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:32,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484809125] [2025-03-04 10:14:32,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:32,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:32,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:32,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:32,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:32,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:32,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 922 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:32,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:32,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:32,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:32,919 INFO L124 PetriNetUnfolderBase]: 2006/3370 cut-off events. [2025-03-04 10:14:32,920 INFO L125 PetriNetUnfolderBase]: For 13299/13299 co-relation queries the response was YES. [2025-03-04 10:14:32,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12455 conditions, 3370 events. 2006/3370 cut-off events. For 13299/13299 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19274 event pairs, 582 based on Foata normal form. 1/3273 useless extension candidates. Maximal degree in co-relation 12387. Up to 2643 conditions per place. [2025-03-04 10:14:32,950 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 139 selfloop transitions, 36 changer transitions 3/183 dead transitions. [2025-03-04 10:14:32,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 183 transitions, 1651 flow [2025-03-04 10:14:32,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 255 transitions. [2025-03-04 10:14:32,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2025-03-04 10:14:32,952 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 922 flow. Second operand 11 states and 255 transitions. [2025-03-04 10:14:32,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 183 transitions, 1651 flow [2025-03-04 10:14:32,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 183 transitions, 1564 flow, removed 36 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:32,973 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 1068 flow [2025-03-04 10:14:32,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1068, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2025-03-04 10:14:32,974 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 72 predicate places. [2025-03-04 10:14:32,974 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 1068 flow [2025-03-04 10:14:32,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:32,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:32,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:32,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:14:32,975 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:32,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:32,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2085198884, now seen corresponding path program 8 times [2025-03-04 10:14:32,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:32,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127422157] [2025-03-04 10:14:32,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:32,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:32,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:14:32,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:32,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:32,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:33,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:33,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127422157] [2025-03-04 10:14:33,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127422157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:33,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:33,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:33,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960762350] [2025-03-04 10:14:33,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:33,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:33,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:33,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:33,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:33,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:33,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 1068 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:33,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:33,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:33,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:33,969 INFO L124 PetriNetUnfolderBase]: 2138/3597 cut-off events. [2025-03-04 10:14:33,969 INFO L125 PetriNetUnfolderBase]: For 21163/21163 co-relation queries the response was YES. [2025-03-04 10:14:33,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14201 conditions, 3597 events. 2138/3597 cut-off events. For 21163/21163 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 20876 event pairs, 659 based on Foata normal form. 1/3504 useless extension candidates. Maximal degree in co-relation 14128. Up to 2847 conditions per place. [2025-03-04 10:14:33,991 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 150 selfloop transitions, 36 changer transitions 3/194 dead transitions. [2025-03-04 10:14:33,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 194 transitions, 1851 flow [2025-03-04 10:14:33,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 257 transitions. [2025-03-04 10:14:33,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3893939393939394 [2025-03-04 10:14:33,993 INFO L175 Difference]: Start difference. First operand has 131 places, 129 transitions, 1068 flow. Second operand 11 states and 257 transitions. [2025-03-04 10:14:33,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 194 transitions, 1851 flow [2025-03-04 10:14:34,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 194 transitions, 1723 flow, removed 47 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:34,034 INFO L231 Difference]: Finished difference. Result has 139 places, 138 transitions, 1154 flow [2025-03-04 10:14:34,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1154, PETRI_PLACES=139, PETRI_TRANSITIONS=138} [2025-03-04 10:14:34,034 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 80 predicate places. [2025-03-04 10:14:34,035 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 138 transitions, 1154 flow [2025-03-04 10:14:34,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:34,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:34,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:34,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:14:34,035 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:34,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:34,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1683240630, now seen corresponding path program 9 times [2025-03-04 10:14:34,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:34,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523876805] [2025-03-04 10:14:34,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:14:34,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:34,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:14:34,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-03-04 10:14:34,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:14:34,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:34,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:34,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523876805] [2025-03-04 10:14:34,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523876805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:34,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:34,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:34,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446295647] [2025-03-04 10:14:34,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:34,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:34,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:34,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:34,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:34,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:34,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 138 transitions, 1154 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:34,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:34,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:34,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:35,060 INFO L124 PetriNetUnfolderBase]: 2325/3905 cut-off events. [2025-03-04 10:14:35,060 INFO L125 PetriNetUnfolderBase]: For 27883/27883 co-relation queries the response was YES. [2025-03-04 10:14:35,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16122 conditions, 3905 events. 2325/3905 cut-off events. For 27883/27883 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 23299 event pairs, 707 based on Foata normal form. 1/3800 useless extension candidates. Maximal degree in co-relation 16045. Up to 3059 conditions per place. [2025-03-04 10:14:35,085 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 164 selfloop transitions, 39 changer transitions 3/211 dead transitions. [2025-03-04 10:14:35,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 211 transitions, 2046 flow [2025-03-04 10:14:35,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 268 transitions. [2025-03-04 10:14:35,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2025-03-04 10:14:35,086 INFO L175 Difference]: Start difference. First operand has 139 places, 138 transitions, 1154 flow. Second operand 11 states and 268 transitions. [2025-03-04 10:14:35,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 211 transitions, 2046 flow [2025-03-04 10:14:35,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 211 transitions, 1916 flow, removed 48 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:35,121 INFO L231 Difference]: Finished difference. Result has 148 places, 147 transitions, 1291 flow [2025-03-04 10:14:35,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1291, PETRI_PLACES=148, PETRI_TRANSITIONS=147} [2025-03-04 10:14:35,122 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 89 predicate places. [2025-03-04 10:14:35,122 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 147 transitions, 1291 flow [2025-03-04 10:14:35,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:35,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:35,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:35,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:14:35,123 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:35,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:35,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1803085242, now seen corresponding path program 10 times [2025-03-04 10:14:35,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:35,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452672822] [2025-03-04 10:14:35,123 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:14:35,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:35,128 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:14:35,142 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:35,143 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:14:35,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:35,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:35,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452672822] [2025-03-04 10:14:35,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452672822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:35,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:35,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:35,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012962564] [2025-03-04 10:14:35,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:35,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:35,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:35,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:35,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:35,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:14:35,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 147 transitions, 1291 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:35,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:35,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:14:35,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:36,029 INFO L124 PetriNetUnfolderBase]: 2584/4285 cut-off events. [2025-03-04 10:14:36,029 INFO L125 PetriNetUnfolderBase]: For 34680/34680 co-relation queries the response was YES. [2025-03-04 10:14:36,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18014 conditions, 4285 events. 2584/4285 cut-off events. For 34680/34680 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 25503 event pairs, 907 based on Foata normal form. 1/4176 useless extension candidates. Maximal degree in co-relation 17932. Up to 3571 conditions per place. [2025-03-04 10:14:36,058 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 156 selfloop transitions, 36 changer transitions 4/200 dead transitions. [2025-03-04 10:14:36,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 200 transitions, 1983 flow [2025-03-04 10:14:36,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:36,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 238 transitions. [2025-03-04 10:14:36,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3606060606060606 [2025-03-04 10:14:36,059 INFO L175 Difference]: Start difference. First operand has 148 places, 147 transitions, 1291 flow. Second operand 11 states and 238 transitions. [2025-03-04 10:14:36,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 200 transitions, 1983 flow [2025-03-04 10:14:36,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 200 transitions, 1843 flow, removed 52 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:36,099 INFO L231 Difference]: Finished difference. Result has 156 places, 153 transitions, 1320 flow [2025-03-04 10:14:36,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1320, PETRI_PLACES=156, PETRI_TRANSITIONS=153} [2025-03-04 10:14:36,100 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 97 predicate places. [2025-03-04 10:14:36,100 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 1320 flow [2025-03-04 10:14:36,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:36,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:36,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:36,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:14:36,100 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:36,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:36,101 INFO L85 PathProgramCache]: Analyzing trace with hash -2060528892, now seen corresponding path program 11 times [2025-03-04 10:14:36,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:36,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096732403] [2025-03-04 10:14:36,101 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:14:36,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:36,109 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:14:36,124 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:36,124 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:14:36,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:36,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:36,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096732403] [2025-03-04 10:14:36,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096732403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:36,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:36,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:36,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779843584] [2025-03-04 10:14:36,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:36,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:36,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:36,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:36,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:36,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:36,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 1320 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:36,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:36,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:36,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:37,060 INFO L124 PetriNetUnfolderBase]: 2537/4257 cut-off events. [2025-03-04 10:14:37,061 INFO L125 PetriNetUnfolderBase]: For 33946/33946 co-relation queries the response was YES. [2025-03-04 10:14:37,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17996 conditions, 4257 events. 2537/4257 cut-off events. For 33946/33946 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 25860 event pairs, 841 based on Foata normal form. 1/4158 useless extension candidates. Maximal degree in co-relation 17909. Up to 3353 conditions per place. [2025-03-04 10:14:37,097 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 165 selfloop transitions, 42 changer transitions 3/215 dead transitions. [2025-03-04 10:14:37,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 215 transitions, 2188 flow [2025-03-04 10:14:37,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 258 transitions. [2025-03-04 10:14:37,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2025-03-04 10:14:37,099 INFO L175 Difference]: Start difference. First operand has 156 places, 153 transitions, 1320 flow. Second operand 11 states and 258 transitions. [2025-03-04 10:14:37,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 215 transitions, 2188 flow [2025-03-04 10:14:37,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 215 transitions, 2078 flow, removed 35 selfloop flow, removed 6 redundant places. [2025-03-04 10:14:37,165 INFO L231 Difference]: Finished difference. Result has 163 places, 160 transitions, 1485 flow [2025-03-04 10:14:37,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1485, PETRI_PLACES=163, PETRI_TRANSITIONS=160} [2025-03-04 10:14:37,165 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 104 predicate places. [2025-03-04 10:14:37,165 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 160 transitions, 1485 flow [2025-03-04 10:14:37,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:37,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:37,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:37,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 10:14:37,165 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:37,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:37,166 INFO L85 PathProgramCache]: Analyzing trace with hash 406063840, now seen corresponding path program 12 times [2025-03-04 10:14:37,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:37,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131768663] [2025-03-04 10:14:37,166 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:14:37,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:37,171 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:14:37,186 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:37,186 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:14:37,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:37,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:37,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131768663] [2025-03-04 10:14:37,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131768663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:37,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:37,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:37,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840030915] [2025-03-04 10:14:37,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:37,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:37,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:37,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:37,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:37,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:37,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 160 transitions, 1485 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:37,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:37,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:37,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:38,081 INFO L124 PetriNetUnfolderBase]: 2537/4255 cut-off events. [2025-03-04 10:14:38,081 INFO L125 PetriNetUnfolderBase]: For 40317/40317 co-relation queries the response was YES. [2025-03-04 10:14:38,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18622 conditions, 4255 events. 2537/4255 cut-off events. For 40317/40317 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 25852 event pairs, 851 based on Foata normal form. 1/4156 useless extension candidates. Maximal degree in co-relation 18531. Up to 3391 conditions per place. [2025-03-04 10:14:38,113 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 173 selfloop transitions, 41 changer transitions 5/224 dead transitions. [2025-03-04 10:14:38,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 224 transitions, 2273 flow [2025-03-04 10:14:38,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 266 transitions. [2025-03-04 10:14:38,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2025-03-04 10:14:38,114 INFO L175 Difference]: Start difference. First operand has 163 places, 160 transitions, 1485 flow. Second operand 11 states and 266 transitions. [2025-03-04 10:14:38,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 224 transitions, 2273 flow [2025-03-04 10:14:38,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 224 transitions, 2105 flow, removed 64 selfloop flow, removed 6 redundant places. [2025-03-04 10:14:38,167 INFO L231 Difference]: Finished difference. Result has 169 places, 164 transitions, 1450 flow [2025-03-04 10:14:38,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1450, PETRI_PLACES=169, PETRI_TRANSITIONS=164} [2025-03-04 10:14:38,167 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 110 predicate places. [2025-03-04 10:14:38,167 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 164 transitions, 1450 flow [2025-03-04 10:14:38,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:38,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:38,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:38,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 10:14:38,168 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:38,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:38,168 INFO L85 PathProgramCache]: Analyzing trace with hash 222633420, now seen corresponding path program 13 times [2025-03-04 10:14:38,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:38,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694136832] [2025-03-04 10:14:38,168 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:14:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:38,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:14:38,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:38,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:38,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:38,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:38,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694136832] [2025-03-04 10:14:38,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694136832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:38,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:38,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:38,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973209758] [2025-03-04 10:14:38,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:38,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:38,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:38,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:38,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:38,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:38,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 164 transitions, 1450 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:38,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:38,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:38,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:39,092 INFO L124 PetriNetUnfolderBase]: 2573/4322 cut-off events. [2025-03-04 10:14:39,092 INFO L125 PetriNetUnfolderBase]: For 35434/35434 co-relation queries the response was YES. [2025-03-04 10:14:39,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18298 conditions, 4322 events. 2573/4322 cut-off events. For 35434/35434 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 26412 event pairs, 939 based on Foata normal form. 1/4224 useless extension candidates. Maximal degree in co-relation 18204. Up to 3642 conditions per place. [2025-03-04 10:14:39,133 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 168 selfloop transitions, 37 changer transitions 3/213 dead transitions. [2025-03-04 10:14:39,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 213 transitions, 2132 flow [2025-03-04 10:14:39,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 247 transitions. [2025-03-04 10:14:39,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37424242424242427 [2025-03-04 10:14:39,134 INFO L175 Difference]: Start difference. First operand has 169 places, 164 transitions, 1450 flow. Second operand 11 states and 247 transitions. [2025-03-04 10:14:39,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 213 transitions, 2132 flow [2025-03-04 10:14:39,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 213 transitions, 2025 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-03-04 10:14:39,187 INFO L231 Difference]: Finished difference. Result has 174 places, 167 transitions, 1467 flow [2025-03-04 10:14:39,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1467, PETRI_PLACES=174, PETRI_TRANSITIONS=167} [2025-03-04 10:14:39,187 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 115 predicate places. [2025-03-04 10:14:39,187 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 167 transitions, 1467 flow [2025-03-04 10:14:39,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:39,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:39,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:39,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 10:14:39,188 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:39,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:39,188 INFO L85 PathProgramCache]: Analyzing trace with hash 109296388, now seen corresponding path program 14 times [2025-03-04 10:14:39,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:39,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918009325] [2025-03-04 10:14:39,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:39,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:14:39,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:39,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:39,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:39,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:39,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918009325] [2025-03-04 10:14:39,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918009325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:39,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:39,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:39,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835401101] [2025-03-04 10:14:39,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:39,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:39,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:39,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:39,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:39,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:39,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 167 transitions, 1467 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:39,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:39,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:39,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:40,022 INFO L124 PetriNetUnfolderBase]: 2594/4368 cut-off events. [2025-03-04 10:14:40,022 INFO L125 PetriNetUnfolderBase]: For 35527/35527 co-relation queries the response was YES. [2025-03-04 10:14:40,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18372 conditions, 4368 events. 2594/4368 cut-off events. For 35527/35527 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 26900 event pairs, 866 based on Foata normal form. 1/4263 useless extension candidates. Maximal degree in co-relation 18275. Up to 3424 conditions per place. [2025-03-04 10:14:40,057 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 175 selfloop transitions, 46 changer transitions 5/231 dead transitions. [2025-03-04 10:14:40,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 231 transitions, 2265 flow [2025-03-04 10:14:40,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 265 transitions. [2025-03-04 10:14:40,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2025-03-04 10:14:40,058 INFO L175 Difference]: Start difference. First operand has 174 places, 167 transitions, 1467 flow. Second operand 11 states and 265 transitions. [2025-03-04 10:14:40,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 231 transitions, 2265 flow [2025-03-04 10:14:40,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 231 transitions, 2161 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-03-04 10:14:40,169 INFO L231 Difference]: Finished difference. Result has 179 places, 173 transitions, 1562 flow [2025-03-04 10:14:40,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1562, PETRI_PLACES=179, PETRI_TRANSITIONS=173} [2025-03-04 10:14:40,170 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 120 predicate places. [2025-03-04 10:14:40,170 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 173 transitions, 1562 flow [2025-03-04 10:14:40,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:40,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:40,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:40,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 10:14:40,170 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:40,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:40,171 INFO L85 PathProgramCache]: Analyzing trace with hash -650892984, now seen corresponding path program 15 times [2025-03-04 10:14:40,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:40,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288395245] [2025-03-04 10:14:40,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:14:40,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:40,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:14:40,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-03-04 10:14:40,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:14:40,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:40,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:40,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288395245] [2025-03-04 10:14:40,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288395245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:40,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:40,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:40,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212055134] [2025-03-04 10:14:40,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:40,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:40,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:40,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:40,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:40,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:40,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 173 transitions, 1562 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:40,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:40,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:40,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:41,167 INFO L124 PetriNetUnfolderBase]: 2594/4362 cut-off events. [2025-03-04 10:14:41,167 INFO L125 PetriNetUnfolderBase]: For 37310/37310 co-relation queries the response was YES. [2025-03-04 10:14:41,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18650 conditions, 4362 events. 2594/4362 cut-off events. For 37310/37310 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 26784 event pairs, 960 based on Foata normal form. 1/4259 useless extension candidates. Maximal degree in co-relation 18550. Up to 3688 conditions per place. [2025-03-04 10:14:41,194 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 176 selfloop transitions, 35 changer transitions 3/219 dead transitions. [2025-03-04 10:14:41,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 219 transitions, 2228 flow [2025-03-04 10:14:41,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 244 transitions. [2025-03-04 10:14:41,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3696969696969697 [2025-03-04 10:14:41,195 INFO L175 Difference]: Start difference. First operand has 179 places, 173 transitions, 1562 flow. Second operand 11 states and 244 transitions. [2025-03-04 10:14:41,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 219 transitions, 2228 flow [2025-03-04 10:14:41,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 219 transitions, 2101 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-03-04 10:14:41,249 INFO L231 Difference]: Finished difference. Result has 184 places, 175 transitions, 1529 flow [2025-03-04 10:14:41,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1529, PETRI_PLACES=184, PETRI_TRANSITIONS=175} [2025-03-04 10:14:41,250 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 125 predicate places. [2025-03-04 10:14:41,250 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 175 transitions, 1529 flow [2025-03-04 10:14:41,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:41,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:41,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:41,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 10:14:41,254 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:41,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:41,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2103728354, now seen corresponding path program 16 times [2025-03-04 10:14:41,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:41,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449019329] [2025-03-04 10:14:41,254 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:14:41,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:41,262 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:14:41,273 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:41,273 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:14:41,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:41,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:41,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449019329] [2025-03-04 10:14:41,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449019329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:41,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:41,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:41,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289597015] [2025-03-04 10:14:41,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:41,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:41,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:41,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:41,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:41,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:14:41,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 175 transitions, 1529 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:41,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:41,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:14:41,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:42,294 INFO L124 PetriNetUnfolderBase]: 3035/5061 cut-off events. [2025-03-04 10:14:42,294 INFO L125 PetriNetUnfolderBase]: For 52405/52437 co-relation queries the response was YES. [2025-03-04 10:14:42,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22460 conditions, 5061 events. 3035/5061 cut-off events. For 52405/52437 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 32111 event pairs, 992 based on Foata normal form. 1/4939 useless extension candidates. Maximal degree in co-relation 22357. Up to 3967 conditions per place. [2025-03-04 10:14:42,333 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 205 selfloop transitions, 44 changer transitions 3/256 dead transitions. [2025-03-04 10:14:42,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 256 transitions, 2684 flow [2025-03-04 10:14:42,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:14:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:14:42,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 275 transitions. [2025-03-04 10:14:42,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2025-03-04 10:14:42,334 INFO L175 Difference]: Start difference. First operand has 184 places, 175 transitions, 1529 flow. Second operand 12 states and 275 transitions. [2025-03-04 10:14:42,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 256 transitions, 2684 flow [2025-03-04 10:14:42,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 256 transitions, 2616 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-04 10:14:42,435 INFO L231 Difference]: Finished difference. Result has 191 places, 187 transitions, 1824 flow [2025-03-04 10:14:42,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1824, PETRI_PLACES=191, PETRI_TRANSITIONS=187} [2025-03-04 10:14:42,436 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 132 predicate places. [2025-03-04 10:14:42,436 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 187 transitions, 1824 flow [2025-03-04 10:14:42,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:42,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:42,437 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:42,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 10:14:42,437 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:42,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:42,437 INFO L85 PathProgramCache]: Analyzing trace with hash -463582376, now seen corresponding path program 17 times [2025-03-04 10:14:42,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:42,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266288473] [2025-03-04 10:14:42,437 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:14:42,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:42,442 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:14:42,451 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:42,451 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:14:42,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:42,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:42,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:42,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266288473] [2025-03-04 10:14:42,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266288473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:42,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:42,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:42,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618848823] [2025-03-04 10:14:42,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:42,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:42,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:42,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:42,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:42,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:42,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 187 transitions, 1824 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:42,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:42,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:42,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:43,466 INFO L124 PetriNetUnfolderBase]: 3034/5112 cut-off events. [2025-03-04 10:14:43,466 INFO L125 PetriNetUnfolderBase]: For 65097/65097 co-relation queries the response was YES. [2025-03-04 10:14:43,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24169 conditions, 5112 events. 3034/5112 cut-off events. For 65097/65097 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 32887 event pairs, 984 based on Foata normal form. 1/5003 useless extension candidates. Maximal degree in co-relation 24062. Up to 3910 conditions per place. [2025-03-04 10:14:43,508 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 201 selfloop transitions, 54 changer transitions 3/263 dead transitions. [2025-03-04 10:14:43,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 263 transitions, 3039 flow [2025-03-04 10:14:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:14:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:14:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 284 transitions. [2025-03-04 10:14:43,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2025-03-04 10:14:43,509 INFO L175 Difference]: Start difference. First operand has 191 places, 187 transitions, 1824 flow. Second operand 12 states and 284 transitions. [2025-03-04 10:14:43,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 263 transitions, 3039 flow [2025-03-04 10:14:43,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 263 transitions, 2783 flow, removed 111 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:43,611 INFO L231 Difference]: Finished difference. Result has 201 places, 198 transitions, 1991 flow [2025-03-04 10:14:43,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1991, PETRI_PLACES=201, PETRI_TRANSITIONS=198} [2025-03-04 10:14:43,612 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 142 predicate places. [2025-03-04 10:14:43,612 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 198 transitions, 1991 flow [2025-03-04 10:14:43,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:43,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:43,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:43,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 10:14:43,612 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:43,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash -716735442, now seen corresponding path program 18 times [2025-03-04 10:14:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:43,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449355493] [2025-03-04 10:14:43,613 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:14:43,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:43,617 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:14:43,629 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:43,629 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:14:43,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:43,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:43,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449355493] [2025-03-04 10:14:43,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449355493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:43,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:43,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:43,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925164148] [2025-03-04 10:14:43,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:43,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:43,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:43,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:43,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:43,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:43,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 198 transitions, 1991 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:43,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:43,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:43,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:44,707 INFO L124 PetriNetUnfolderBase]: 3130/5276 cut-off events. [2025-03-04 10:14:44,707 INFO L125 PetriNetUnfolderBase]: For 76386/76386 co-relation queries the response was YES. [2025-03-04 10:14:44,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25564 conditions, 5276 events. 3130/5276 cut-off events. For 76386/76386 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 34247 event pairs, 1104 based on Foata normal form. 1/5167 useless extension candidates. Maximal degree in co-relation 25452. Up to 4182 conditions per place. [2025-03-04 10:14:44,745 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 210 selfloop transitions, 49 changer transitions 3/267 dead transitions. [2025-03-04 10:14:44,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 267 transitions, 3085 flow [2025-03-04 10:14:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:14:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:14:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 281 transitions. [2025-03-04 10:14:44,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3902777777777778 [2025-03-04 10:14:44,746 INFO L175 Difference]: Start difference. First operand has 201 places, 198 transitions, 1991 flow. Second operand 12 states and 281 transitions. [2025-03-04 10:14:44,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 267 transitions, 3085 flow [2025-03-04 10:14:44,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 267 transitions, 2870 flow, removed 83 selfloop flow, removed 7 redundant places. [2025-03-04 10:14:44,910 INFO L231 Difference]: Finished difference. Result has 208 places, 204 transitions, 2048 flow [2025-03-04 10:14:44,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2048, PETRI_PLACES=208, PETRI_TRANSITIONS=204} [2025-03-04 10:14:44,911 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 149 predicate places. [2025-03-04 10:14:44,911 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 204 transitions, 2048 flow [2025-03-04 10:14:44,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:44,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:44,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:44,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 10:14:44,911 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:44,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash -746241490, now seen corresponding path program 19 times [2025-03-04 10:14:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:44,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391362081] [2025-03-04 10:14:44,912 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:14:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:44,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:14:44,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:44,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:44,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:45,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:45,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391362081] [2025-03-04 10:14:45,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391362081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:45,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:45,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:45,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17330869] [2025-03-04 10:14:45,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:45,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:45,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:45,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:45,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:45,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:45,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 204 transitions, 2048 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:45,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:45,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:45,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:46,031 INFO L124 PetriNetUnfolderBase]: 3132/5300 cut-off events. [2025-03-04 10:14:46,031 INFO L125 PetriNetUnfolderBase]: For 76035/76035 co-relation queries the response was YES. [2025-03-04 10:14:46,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25458 conditions, 5300 events. 3132/5300 cut-off events. For 76035/76035 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 34848 event pairs, 1030 based on Foata normal form. 1/5184 useless extension candidates. Maximal degree in co-relation 25343. Up to 4259 conditions per place. [2025-03-04 10:14:46,084 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 207 selfloop transitions, 51 changer transitions 4/267 dead transitions. [2025-03-04 10:14:46,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 267 transitions, 3012 flow [2025-03-04 10:14:46,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:14:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:14:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 278 transitions. [2025-03-04 10:14:46,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3861111111111111 [2025-03-04 10:14:46,085 INFO L175 Difference]: Start difference. First operand has 208 places, 204 transitions, 2048 flow. Second operand 12 states and 278 transitions. [2025-03-04 10:14:46,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 267 transitions, 3012 flow [2025-03-04 10:14:46,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 267 transitions, 2847 flow, removed 57 selfloop flow, removed 8 redundant places. [2025-03-04 10:14:46,259 INFO L231 Difference]: Finished difference. Result has 213 places, 208 transitions, 2063 flow [2025-03-04 10:14:46,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2063, PETRI_PLACES=213, PETRI_TRANSITIONS=208} [2025-03-04 10:14:46,259 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 154 predicate places. [2025-03-04 10:14:46,259 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 208 transitions, 2063 flow [2025-03-04 10:14:46,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:46,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:46,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:46,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 10:14:46,260 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:46,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:46,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1191601460, now seen corresponding path program 20 times [2025-03-04 10:14:46,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:46,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469380959] [2025-03-04 10:14:46,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:46,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:46,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:14:46,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:46,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:46,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:46,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:46,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:46,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469380959] [2025-03-04 10:14:46,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469380959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:46,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:46,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:46,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777505303] [2025-03-04 10:14:46,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:46,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:46,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:46,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:46,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:46,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:46,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 208 transitions, 2063 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:46,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:46,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:46,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:47,525 INFO L124 PetriNetUnfolderBase]: 3357/5667 cut-off events. [2025-03-04 10:14:47,525 INFO L125 PetriNetUnfolderBase]: For 88289/88289 co-relation queries the response was YES. [2025-03-04 10:14:47,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28297 conditions, 5667 events. 3357/5667 cut-off events. For 88289/88289 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 37699 event pairs, 1313 based on Foata normal form. 1/5537 useless extension candidates. Maximal degree in co-relation 28180. Up to 4708 conditions per place. [2025-03-04 10:14:47,587 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 237 selfloop transitions, 39 changer transitions 3/284 dead transitions. [2025-03-04 10:14:47,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 284 transitions, 3402 flow [2025-03-04 10:14:47,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 271 transitions. [2025-03-04 10:14:47,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4106060606060606 [2025-03-04 10:14:47,588 INFO L175 Difference]: Start difference. First operand has 213 places, 208 transitions, 2063 flow. Second operand 11 states and 271 transitions. [2025-03-04 10:14:47,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 284 transitions, 3402 flow [2025-03-04 10:14:47,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 284 transitions, 3238 flow, removed 31 selfloop flow, removed 10 redundant places. [2025-03-04 10:14:47,761 INFO L231 Difference]: Finished difference. Result has 218 places, 220 transitions, 2331 flow [2025-03-04 10:14:47,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1911, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2331, PETRI_PLACES=218, PETRI_TRANSITIONS=220} [2025-03-04 10:14:47,761 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 159 predicate places. [2025-03-04 10:14:47,761 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 220 transitions, 2331 flow [2025-03-04 10:14:47,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:47,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:47,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:47,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 10:14:47,762 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:47,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:47,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1230925262, now seen corresponding path program 21 times [2025-03-04 10:14:47,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:47,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817238818] [2025-03-04 10:14:47,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:14:47,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:47,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:14:47,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-03-04 10:14:47,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:14:47,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:48,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:48,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817238818] [2025-03-04 10:14:48,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817238818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:48,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:48,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:48,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491664958] [2025-03-04 10:14:48,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:48,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:48,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:48,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:48,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:48,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:48,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 220 transitions, 2331 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:48,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:48,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:48,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:48,825 INFO L124 PetriNetUnfolderBase]: 3418/5761 cut-off events. [2025-03-04 10:14:48,825 INFO L125 PetriNetUnfolderBase]: For 98808/98808 co-relation queries the response was YES. [2025-03-04 10:14:48,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29262 conditions, 5761 events. 3418/5761 cut-off events. For 98808/98808 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 38268 event pairs, 1449 based on Foata normal form. 1/5640 useless extension candidates. Maximal degree in co-relation 29141. Up to 4978 conditions per place. [2025-03-04 10:14:48,875 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 227 selfloop transitions, 36 changer transitions 4/272 dead transitions. [2025-03-04 10:14:48,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 272 transitions, 3311 flow [2025-03-04 10:14:48,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 250 transitions. [2025-03-04 10:14:48,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2025-03-04 10:14:48,876 INFO L175 Difference]: Start difference. First operand has 218 places, 220 transitions, 2331 flow. Second operand 11 states and 250 transitions. [2025-03-04 10:14:48,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 272 transitions, 3311 flow [2025-03-04 10:14:49,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 272 transitions, 3061 flow, removed 109 selfloop flow, removed 4 redundant places. [2025-03-04 10:14:49,017 INFO L231 Difference]: Finished difference. Result has 227 places, 226 transitions, 2314 flow [2025-03-04 10:14:49,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2101, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2314, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2025-03-04 10:14:49,017 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 168 predicate places. [2025-03-04 10:14:49,017 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 2314 flow [2025-03-04 10:14:49,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:49,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:49,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:49,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 10:14:49,018 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:49,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:49,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1488368912, now seen corresponding path program 22 times [2025-03-04 10:14:49,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:49,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089012214] [2025-03-04 10:14:49,018 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:14:49,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:49,023 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:14:49,032 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:49,032 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:14:49,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:49,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:49,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089012214] [2025-03-04 10:14:49,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089012214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:49,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:49,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:49,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491060170] [2025-03-04 10:14:49,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:49,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:49,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:49,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:49,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:49,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:14:49,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 2314 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:49,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:49,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:14:49,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:50,191 INFO L124 PetriNetUnfolderBase]: 3773/6306 cut-off events. [2025-03-04 10:14:50,191 INFO L125 PetriNetUnfolderBase]: For 94681/94681 co-relation queries the response was YES. [2025-03-04 10:14:50,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31155 conditions, 6306 events. 3773/6306 cut-off events. For 94681/94681 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 42076 event pairs, 1544 based on Foata normal form. 1/6178 useless extension candidates. Maximal degree in co-relation 31029. Up to 5247 conditions per place. [2025-03-04 10:14:50,251 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 247 selfloop transitions, 44 changer transitions 3/298 dead transitions. [2025-03-04 10:14:50,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 298 transitions, 3614 flow [2025-03-04 10:14:50,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:50,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 261 transitions. [2025-03-04 10:14:50,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39545454545454545 [2025-03-04 10:14:50,252 INFO L175 Difference]: Start difference. First operand has 227 places, 226 transitions, 2314 flow. Second operand 11 states and 261 transitions. [2025-03-04 10:14:50,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 298 transitions, 3614 flow [2025-03-04 10:14:50,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 298 transitions, 3462 flow, removed 56 selfloop flow, removed 6 redundant places. [2025-03-04 10:14:50,454 INFO L231 Difference]: Finished difference. Result has 235 places, 235 transitions, 2576 flow [2025-03-04 10:14:50,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2576, PETRI_PLACES=235, PETRI_TRANSITIONS=235} [2025-03-04 10:14:50,455 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 176 predicate places. [2025-03-04 10:14:50,455 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 235 transitions, 2576 flow [2025-03-04 10:14:50,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:50,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:50,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:50,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 10:14:50,455 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:50,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:50,456 INFO L85 PathProgramCache]: Analyzing trace with hash -976715780, now seen corresponding path program 23 times [2025-03-04 10:14:50,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:50,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864951028] [2025-03-04 10:14:50,456 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:14:50,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:50,460 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:14:50,467 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:50,467 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:14:50,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:50,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:50,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864951028] [2025-03-04 10:14:50,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864951028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:50,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:50,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:50,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116526798] [2025-03-04 10:14:50,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:50,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:50,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:50,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:50,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:50,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:50,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 235 transitions, 2576 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:50,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:50,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:50,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:51,842 INFO L124 PetriNetUnfolderBase]: 3688/6244 cut-off events. [2025-03-04 10:14:51,843 INFO L125 PetriNetUnfolderBase]: For 111580/111580 co-relation queries the response was YES. [2025-03-04 10:14:51,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32084 conditions, 6244 events. 3688/6244 cut-off events. For 111580/111580 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 42504 event pairs, 1563 based on Foata normal form. 1/6114 useless extension candidates. Maximal degree in co-relation 31953. Up to 5343 conditions per place. [2025-03-04 10:14:51,901 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 256 selfloop transitions, 35 changer transitions 3/299 dead transitions. [2025-03-04 10:14:51,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 299 transitions, 3886 flow [2025-03-04 10:14:51,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 260 transitions. [2025-03-04 10:14:51,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-03-04 10:14:51,903 INFO L175 Difference]: Start difference. First operand has 235 places, 235 transitions, 2576 flow. Second operand 11 states and 260 transitions. [2025-03-04 10:14:51,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 299 transitions, 3886 flow [2025-03-04 10:14:52,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 299 transitions, 3640 flow, removed 104 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:52,189 INFO L231 Difference]: Finished difference. Result has 244 places, 242 transitions, 2674 flow [2025-03-04 10:14:52,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2336, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2674, PETRI_PLACES=244, PETRI_TRANSITIONS=242} [2025-03-04 10:14:52,190 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 185 predicate places. [2025-03-04 10:14:52,190 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 242 transitions, 2674 flow [2025-03-04 10:14:52,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:52,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:52,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:52,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 10:14:52,190 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:52,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash -73876678, now seen corresponding path program 24 times [2025-03-04 10:14:52,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:52,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294116377] [2025-03-04 10:14:52,191 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:14:52,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:52,195 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:14:52,204 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:52,204 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:14:52,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:52,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:52,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294116377] [2025-03-04 10:14:52,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294116377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:52,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:52,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:52,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279408856] [2025-03-04 10:14:52,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:52,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:52,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:52,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:52,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:52,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:52,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 242 transitions, 2674 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:52,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:52,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:52,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:53,525 INFO L124 PetriNetUnfolderBase]: 3814/6477 cut-off events. [2025-03-04 10:14:53,525 INFO L125 PetriNetUnfolderBase]: For 125485/125485 co-relation queries the response was YES. [2025-03-04 10:14:53,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33375 conditions, 6477 events. 3814/6477 cut-off events. For 125485/125485 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 44507 event pairs, 1624 based on Foata normal form. 1/6338 useless extension candidates. Maximal degree in co-relation 33238. Up to 5524 conditions per place. [2025-03-04 10:14:53,580 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 266 selfloop transitions, 37 changer transitions 3/311 dead transitions. [2025-03-04 10:14:53,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 311 transitions, 4000 flow [2025-03-04 10:14:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 263 transitions. [2025-03-04 10:14:53,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3984848484848485 [2025-03-04 10:14:53,581 INFO L175 Difference]: Start difference. First operand has 244 places, 242 transitions, 2674 flow. Second operand 11 states and 263 transitions. [2025-03-04 10:14:53,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 311 transitions, 4000 flow [2025-03-04 10:14:53,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 311 transitions, 3766 flow, removed 100 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:53,851 INFO L231 Difference]: Finished difference. Result has 253 places, 250 transitions, 2781 flow [2025-03-04 10:14:53,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2440, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2781, PETRI_PLACES=253, PETRI_TRANSITIONS=250} [2025-03-04 10:14:53,851 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 194 predicate places. [2025-03-04 10:14:53,851 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 250 transitions, 2781 flow [2025-03-04 10:14:53,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:53,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:53,852 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:53,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 10:14:53,852 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:53,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:53,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1440115714, now seen corresponding path program 25 times [2025-03-04 10:14:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:53,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452665936] [2025-03-04 10:14:53,853 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:14:53,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:53,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:14:53,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:53,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:53,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:54,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:54,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452665936] [2025-03-04 10:14:54,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452665936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:54,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:54,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:54,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850564757] [2025-03-04 10:14:54,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:54,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:54,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:54,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:54,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:54,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:54,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 250 transitions, 2781 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:54,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:54,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:54,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:55,023 INFO L124 PetriNetUnfolderBase]: 3814/6469 cut-off events. [2025-03-04 10:14:55,024 INFO L125 PetriNetUnfolderBase]: For 124296/124296 co-relation queries the response was YES. [2025-03-04 10:14:55,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33174 conditions, 6469 events. 3814/6469 cut-off events. For 124296/124296 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 44438 event pairs, 1658 based on Foata normal form. 1/6334 useless extension candidates. Maximal degree in co-relation 33032. Up to 5632 conditions per place. [2025-03-04 10:14:55,087 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 260 selfloop transitions, 34 changer transitions 3/302 dead transitions. [2025-03-04 10:14:55,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 302 transitions, 3834 flow [2025-03-04 10:14:55,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 251 transitions. [2025-03-04 10:14:55,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3803030303030303 [2025-03-04 10:14:55,088 INFO L175 Difference]: Start difference. First operand has 253 places, 250 transitions, 2781 flow. Second operand 11 states and 251 transitions. [2025-03-04 10:14:55,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 302 transitions, 3834 flow [2025-03-04 10:14:55,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 302 transitions, 3644 flow, removed 83 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:55,271 INFO L231 Difference]: Finished difference. Result has 260 places, 253 transitions, 2724 flow [2025-03-04 10:14:55,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2591, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2724, PETRI_PLACES=260, PETRI_TRANSITIONS=253} [2025-03-04 10:14:55,271 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 201 predicate places. [2025-03-04 10:14:55,272 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 253 transitions, 2724 flow [2025-03-04 10:14:55,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:55,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:55,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:55,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 10:14:55,272 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:55,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:55,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1637608432, now seen corresponding path program 26 times [2025-03-04 10:14:55,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:55,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682312162] [2025-03-04 10:14:55,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:55,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:55,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:14:55,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:55,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:55,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:55,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:55,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682312162] [2025-03-04 10:14:55,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682312162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:55,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:55,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:55,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414706680] [2025-03-04 10:14:55,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:55,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:55,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:55,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:55,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:55,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:55,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 253 transitions, 2724 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:55,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:55,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:55,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:56,860 INFO L124 PetriNetUnfolderBase]: 3931/6682 cut-off events. [2025-03-04 10:14:56,860 INFO L125 PetriNetUnfolderBase]: For 131480/131480 co-relation queries the response was YES. [2025-03-04 10:14:56,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34462 conditions, 6682 events. 3931/6682 cut-off events. For 131480/131480 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 46407 event pairs, 1716 based on Foata normal form. 1/6542 useless extension candidates. Maximal degree in co-relation 34317. Up to 5718 conditions per place. [2025-03-04 10:14:56,938 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 275 selfloop transitions, 38 changer transitions 3/321 dead transitions. [2025-03-04 10:14:56,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 321 transitions, 4097 flow [2025-03-04 10:14:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 263 transitions. [2025-03-04 10:14:56,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3984848484848485 [2025-03-04 10:14:56,939 INFO L175 Difference]: Start difference. First operand has 260 places, 253 transitions, 2724 flow. Second operand 11 states and 263 transitions. [2025-03-04 10:14:56,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 321 transitions, 4097 flow [2025-03-04 10:14:57,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 321 transitions, 3969 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-03-04 10:14:57,179 INFO L231 Difference]: Finished difference. Result has 266 places, 261 transitions, 2957 flow [2025-03-04 10:14:57,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2596, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2957, PETRI_PLACES=266, PETRI_TRANSITIONS=261} [2025-03-04 10:14:57,180 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 207 predicate places. [2025-03-04 10:14:57,180 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 261 transitions, 2957 flow [2025-03-04 10:14:57,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:57,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:57,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:57,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 10:14:57,180 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:57,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:57,181 INFO L85 PathProgramCache]: Analyzing trace with hash 445619794, now seen corresponding path program 27 times [2025-03-04 10:14:57,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:57,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389164060] [2025-03-04 10:14:57,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:14:57,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:57,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:14:57,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-03-04 10:14:57,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:14:57,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:57,438 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:57,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:57,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389164060] [2025-03-04 10:14:57,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389164060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:57,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:57,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:57,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272477802] [2025-03-04 10:14:57,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:57,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:57,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:57,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:57,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:57,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:14:57,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 261 transitions, 2957 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:57,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:57,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:14:57,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:58,429 INFO L124 PetriNetUnfolderBase]: 3931/6685 cut-off events. [2025-03-04 10:14:58,429 INFO L125 PetriNetUnfolderBase]: For 141358/141358 co-relation queries the response was YES. [2025-03-04 10:14:58,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34994 conditions, 6685 events. 3931/6685 cut-off events. For 141358/141358 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 46499 event pairs, 1695 based on Foata normal form. 1/6545 useless extension candidates. Maximal degree in co-relation 34845. Up to 5667 conditions per place. [2025-03-04 10:14:58,512 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 274 selfloop transitions, 41 changer transitions 5/325 dead transitions. [2025-03-04 10:14:58,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 325 transitions, 4109 flow [2025-03-04 10:14:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 269 transitions. [2025-03-04 10:14:58,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4075757575757576 [2025-03-04 10:14:58,514 INFO L175 Difference]: Start difference. First operand has 266 places, 261 transitions, 2957 flow. Second operand 11 states and 269 transitions. [2025-03-04 10:14:58,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 325 transitions, 4109 flow [2025-03-04 10:14:58,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 325 transitions, 3904 flow, removed 90 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:58,757 INFO L231 Difference]: Finished difference. Result has 273 places, 265 transitions, 2907 flow [2025-03-04 10:14:58,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2752, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2907, PETRI_PLACES=273, PETRI_TRANSITIONS=265} [2025-03-04 10:14:58,757 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 214 predicate places. [2025-03-04 10:14:58,757 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 265 transitions, 2907 flow [2025-03-04 10:14:58,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:58,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:58,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:58,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-04 10:14:58,758 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:14:58,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:58,758 INFO L85 PathProgramCache]: Analyzing trace with hash 681456368, now seen corresponding path program 28 times [2025-03-04 10:14:58,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:58,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417704301] [2025-03-04 10:14:58,759 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:14:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:58,764 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:14:58,774 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:14:58,774 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:14:58,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:14:58,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:58,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417704301] [2025-03-04 10:14:58,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417704301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:58,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:58,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:14:58,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633776646] [2025-03-04 10:14:58,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:58,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:58,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:58,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:58,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:59,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:14:59,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 265 transitions, 2907 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:59,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:59,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:14:59,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:59,950 INFO L124 PetriNetUnfolderBase]: 4129/6955 cut-off events. [2025-03-04 10:14:59,950 INFO L125 PetriNetUnfolderBase]: For 140415/140415 co-relation queries the response was YES. [2025-03-04 10:15:00,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35899 conditions, 6955 events. 4129/6955 cut-off events. For 140415/140415 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 48046 event pairs, 1762 based on Foata normal form. 1/6809 useless extension candidates. Maximal degree in co-relation 35747. Up to 5839 conditions per place. [2025-03-04 10:15:00,030 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 274 selfloop transitions, 46 changer transitions 5/329 dead transitions. [2025-03-04 10:15:00,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 329 transitions, 4017 flow [2025-03-04 10:15:00,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:15:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:15:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 260 transitions. [2025-03-04 10:15:00,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-03-04 10:15:00,031 INFO L175 Difference]: Start difference. First operand has 273 places, 265 transitions, 2907 flow. Second operand 11 states and 260 transitions. [2025-03-04 10:15:00,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 329 transitions, 4017 flow [2025-03-04 10:15:00,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 329 transitions, 3882 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-03-04 10:15:00,312 INFO L231 Difference]: Finished difference. Result has 278 places, 269 transitions, 2948 flow [2025-03-04 10:15:00,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2772, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2948, PETRI_PLACES=278, PETRI_TRANSITIONS=269} [2025-03-04 10:15:00,313 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 219 predicate places. [2025-03-04 10:15:00,313 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 269 transitions, 2948 flow [2025-03-04 10:15:00,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:00,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:00,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:00,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-04 10:15:00,313 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:00,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:00,314 INFO L85 PathProgramCache]: Analyzing trace with hash 794793400, now seen corresponding path program 29 times [2025-03-04 10:15:00,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:00,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602081014] [2025-03-04 10:15:00,314 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:15:00,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:00,318 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:15:00,324 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:15:00,324 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:15:00,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:00,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:00,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602081014] [2025-03-04 10:15:00,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602081014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:00,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:00,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:15:00,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294326412] [2025-03-04 10:15:00,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:00,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:15:00,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:00,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:15:00,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:00,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:15:00,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 269 transitions, 2948 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:00,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:00,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:15:00,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:01,523 INFO L124 PetriNetUnfolderBase]: 3967/6750 cut-off events. [2025-03-04 10:15:01,523 INFO L125 PetriNetUnfolderBase]: For 131448/131448 co-relation queries the response was YES. [2025-03-04 10:15:01,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34517 conditions, 6750 events. 3967/6750 cut-off events. For 131448/131448 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 47161 event pairs, 1783 based on Foata normal form. 1/6611 useless extension candidates. Maximal degree in co-relation 34362. Up to 5917 conditions per place. [2025-03-04 10:15:01,594 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 273 selfloop transitions, 37 changer transitions 3/318 dead transitions. [2025-03-04 10:15:01,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 318 transitions, 3984 flow [2025-03-04 10:15:01,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:15:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:15:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 250 transitions. [2025-03-04 10:15:01,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2025-03-04 10:15:01,595 INFO L175 Difference]: Start difference. First operand has 278 places, 269 transitions, 2948 flow. Second operand 11 states and 250 transitions. [2025-03-04 10:15:01,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 318 transitions, 3984 flow [2025-03-04 10:15:01,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 318 transitions, 3831 flow, removed 37 selfloop flow, removed 7 redundant places. [2025-03-04 10:15:01,889 INFO L231 Difference]: Finished difference. Result has 283 places, 272 transitions, 2943 flow [2025-03-04 10:15:01,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2795, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2943, PETRI_PLACES=283, PETRI_TRANSITIONS=272} [2025-03-04 10:15:01,889 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 224 predicate places. [2025-03-04 10:15:01,889 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 272 transitions, 2943 flow [2025-03-04 10:15:01,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:01,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:01,889 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:01,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-04 10:15:01,890 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:01,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash -599131172, now seen corresponding path program 30 times [2025-03-04 10:15:01,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:01,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167252397] [2025-03-04 10:15:01,890 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:15:01,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:01,894 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:15:01,902 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:15:01,902 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:15:01,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:02,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:02,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167252397] [2025-03-04 10:15:02,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167252397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:02,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:02,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:15:02,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170915042] [2025-03-04 10:15:02,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:02,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:15:02,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:02,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:15:02,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:02,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:15:02,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 272 transitions, 2943 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:02,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:02,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:15:02,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:03,160 INFO L124 PetriNetUnfolderBase]: 3967/6758 cut-off events. [2025-03-04 10:15:03,160 INFO L125 PetriNetUnfolderBase]: For 129225/129225 co-relation queries the response was YES. [2025-03-04 10:15:03,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34256 conditions, 6758 events. 3967/6758 cut-off events. For 129225/129225 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 47294 event pairs, 1790 based on Foata normal form. 1/6614 useless extension candidates. Maximal degree in co-relation 34098. Up to 5930 conditions per place. [2025-03-04 10:15:03,243 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 275 selfloop transitions, 35 changer transitions 3/318 dead transitions. [2025-03-04 10:15:03,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 318 transitions, 3929 flow [2025-03-04 10:15:03,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:15:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:15:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 247 transitions. [2025-03-04 10:15:03,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37424242424242427 [2025-03-04 10:15:03,244 INFO L175 Difference]: Start difference. First operand has 283 places, 272 transitions, 2943 flow. Second operand 11 states and 247 transitions. [2025-03-04 10:15:03,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 318 transitions, 3929 flow [2025-03-04 10:15:03,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 318 transitions, 3801 flow, removed 28 selfloop flow, removed 8 redundant places. [2025-03-04 10:15:03,581 INFO L231 Difference]: Finished difference. Result has 287 places, 274 transitions, 2911 flow [2025-03-04 10:15:03,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2817, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2911, PETRI_PLACES=287, PETRI_TRANSITIONS=274} [2025-03-04 10:15:03,582 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 228 predicate places. [2025-03-04 10:15:03,582 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 274 transitions, 2911 flow [2025-03-04 10:15:03,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:03,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:03,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:03,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-04 10:15:03,582 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:03,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:03,583 INFO L85 PathProgramCache]: Analyzing trace with hash 378259140, now seen corresponding path program 31 times [2025-03-04 10:15:03,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:03,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664025254] [2025-03-04 10:15:03,583 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:15:03,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:03,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:15:03,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:15:03,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:03,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:03,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:03,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664025254] [2025-03-04 10:15:03,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664025254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:03,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:03,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:15:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182763360] [2025-03-04 10:15:03,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:03,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:15:03,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:03,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:15:03,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:03,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:15:03,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 274 transitions, 2911 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:03,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:03,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:15:03,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:04,929 INFO L124 PetriNetUnfolderBase]: 4098/6980 cut-off events. [2025-03-04 10:15:04,929 INFO L125 PetriNetUnfolderBase]: For 146092/146092 co-relation queries the response was YES. [2025-03-04 10:15:04,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36222 conditions, 6980 events. 4098/6980 cut-off events. For 146092/146092 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 49227 event pairs, 1828 based on Foata normal form. 1/6828 useless extension candidates. Maximal degree in co-relation 36062. Up to 6043 conditions per place. [2025-03-04 10:15:05,011 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 291 selfloop transitions, 35 changer transitions 3/334 dead transitions. [2025-03-04 10:15:05,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 334 transitions, 4432 flow [2025-03-04 10:15:05,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:15:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:15:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 257 transitions. [2025-03-04 10:15:05,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3893939393939394 [2025-03-04 10:15:05,012 INFO L175 Difference]: Start difference. First operand has 287 places, 274 transitions, 2911 flow. Second operand 11 states and 257 transitions. [2025-03-04 10:15:05,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 334 transitions, 4432 flow [2025-03-04 10:15:05,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 334 transitions, 4364 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-04 10:15:05,369 INFO L231 Difference]: Finished difference. Result has 293 places, 283 transitions, 3338 flow [2025-03-04 10:15:05,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2843, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3338, PETRI_PLACES=293, PETRI_TRANSITIONS=283} [2025-03-04 10:15:05,370 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 234 predicate places. [2025-03-04 10:15:05,370 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 283 transitions, 3338 flow [2025-03-04 10:15:05,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:05,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:05,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:05,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-04 10:15:05,370 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:05,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:05,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1976757670, now seen corresponding path program 32 times [2025-03-04 10:15:05,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:05,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469841373] [2025-03-04 10:15:05,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:05,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:05,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:15:05,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:15:05,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:05,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:05,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:05,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469841373] [2025-03-04 10:15:05,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469841373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:05,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:05,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:15:05,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676119679] [2025-03-04 10:15:05,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:05,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:15:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:05,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:15:05,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:05,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:15:05,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 283 transitions, 3338 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:05,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:05,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:15:05,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:06,752 INFO L124 PetriNetUnfolderBase]: 4281/7285 cut-off events. [2025-03-04 10:15:06,752 INFO L125 PetriNetUnfolderBase]: For 199215/199215 co-relation queries the response was YES. [2025-03-04 10:15:06,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40369 conditions, 7285 events. 4281/7285 cut-off events. For 199215/199215 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 51875 event pairs, 1875 based on Foata normal form. 1/7121 useless extension candidates. Maximal degree in co-relation 40205. Up to 6232 conditions per place. [2025-03-04 10:15:06,832 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 309 selfloop transitions, 38 changer transitions 3/355 dead transitions. [2025-03-04 10:15:06,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 355 transitions, 4985 flow [2025-03-04 10:15:06,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:15:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:15:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 270 transitions. [2025-03-04 10:15:06,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-04 10:15:06,833 INFO L175 Difference]: Start difference. First operand has 293 places, 283 transitions, 3338 flow. Second operand 11 states and 270 transitions. [2025-03-04 10:15:06,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 355 transitions, 4985 flow [2025-03-04 10:15:07,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 355 transitions, 4635 flow, removed 159 selfloop flow, removed 5 redundant places. [2025-03-04 10:15:07,241 INFO L231 Difference]: Finished difference. Result has 303 places, 294 transitions, 3516 flow [2025-03-04 10:15:07,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2988, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3516, PETRI_PLACES=303, PETRI_TRANSITIONS=294} [2025-03-04 10:15:07,242 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 244 predicate places. [2025-03-04 10:15:07,242 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 294 transitions, 3516 flow [2025-03-04 10:15:07,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:07,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:07,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:07,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-04 10:15:07,242 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:07,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:07,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2016081472, now seen corresponding path program 33 times [2025-03-04 10:15:07,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:07,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385529542] [2025-03-04 10:15:07,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:15:07,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:07,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:15:07,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-03-04 10:15:07,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:15:07,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:07,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:07,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385529542] [2025-03-04 10:15:07,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385529542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:07,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:07,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:15:07,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19836604] [2025-03-04 10:15:07,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:07,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:15:07,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:07,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:15:07,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:07,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:15:07,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 294 transitions, 3516 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:07,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:07,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:15:07,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:08,497 INFO L124 PetriNetUnfolderBase]: 4342/7393 cut-off events. [2025-03-04 10:15:08,497 INFO L125 PetriNetUnfolderBase]: For 205495/205495 co-relation queries the response was YES. [2025-03-04 10:15:08,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40759 conditions, 7393 events. 4342/7393 cut-off events. For 205495/205495 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 52836 event pairs, 1979 based on Foata normal form. 1/7231 useless extension candidates. Maximal degree in co-relation 40589. Up to 6502 conditions per place. [2025-03-04 10:15:08,601 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 299 selfloop transitions, 35 changer transitions 4/343 dead transitions. [2025-03-04 10:15:08,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 343 transitions, 4688 flow [2025-03-04 10:15:08,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:15:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:15:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 249 transitions. [2025-03-04 10:15:08,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37727272727272726 [2025-03-04 10:15:08,602 INFO L175 Difference]: Start difference. First operand has 303 places, 294 transitions, 3516 flow. Second operand 11 states and 249 transitions. [2025-03-04 10:15:08,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 343 transitions, 4688 flow [2025-03-04 10:15:09,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 343 transitions, 4374 flow, removed 142 selfloop flow, removed 4 redundant places. [2025-03-04 10:15:09,145 INFO L231 Difference]: Finished difference. Result has 312 places, 300 transitions, 3465 flow [2025-03-04 10:15:09,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3202, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3465, PETRI_PLACES=312, PETRI_TRANSITIONS=300} [2025-03-04 10:15:09,146 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 253 predicate places. [2025-03-04 10:15:09,146 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 300 transitions, 3465 flow [2025-03-04 10:15:09,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:09,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:09,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:09,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-04 10:15:09,147 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:09,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:09,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2021442174, now seen corresponding path program 34 times [2025-03-04 10:15:09,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:09,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331332121] [2025-03-04 10:15:09,148 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:15:09,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:09,153 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:15:09,163 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:15:09,165 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:15:09,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:09,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:09,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331332121] [2025-03-04 10:15:09,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331332121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:09,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:09,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:15:09,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143662145] [2025-03-04 10:15:09,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:09,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:15:09,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:09,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:15:09,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:09,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:15:09,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 300 transitions, 3465 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:09,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:09,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:15:09,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:10,596 INFO L124 PetriNetUnfolderBase]: 4712/7952 cut-off events. [2025-03-04 10:15:10,596 INFO L125 PetriNetUnfolderBase]: For 220880/220880 co-relation queries the response was YES. [2025-03-04 10:15:10,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43542 conditions, 7952 events. 4712/7952 cut-off events. For 220880/220880 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 56874 event pairs, 2111 based on Foata normal form. 1/7789 useless extension candidates. Maximal degree in co-relation 43367. Up to 6771 conditions per place. [2025-03-04 10:15:10,693 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 320 selfloop transitions, 43 changer transitions 3/370 dead transitions. [2025-03-04 10:15:10,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 370 transitions, 5103 flow [2025-03-04 10:15:10,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:15:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:15:10,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 261 transitions. [2025-03-04 10:15:10,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39545454545454545 [2025-03-04 10:15:10,694 INFO L175 Difference]: Start difference. First operand has 312 places, 300 transitions, 3465 flow. Second operand 11 states and 261 transitions. [2025-03-04 10:15:10,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 370 transitions, 5103 flow [2025-03-04 10:15:11,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 370 transitions, 4879 flow, removed 93 selfloop flow, removed 6 redundant places. [2025-03-04 10:15:11,190 INFO L231 Difference]: Finished difference. Result has 320 places, 309 transitions, 3781 flow [2025-03-04 10:15:11,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3241, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3781, PETRI_PLACES=320, PETRI_TRANSITIONS=309} [2025-03-04 10:15:11,191 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 261 predicate places. [2025-03-04 10:15:11,191 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 309 transitions, 3781 flow [2025-03-04 10:15:11,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:11,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:11,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:11,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-04 10:15:11,191 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:11,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1022791270, now seen corresponding path program 35 times [2025-03-04 10:15:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:11,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193350393] [2025-03-04 10:15:11,192 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:15:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:11,196 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:15:11,202 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:15:11,202 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:15:11,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:11,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:11,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193350393] [2025-03-04 10:15:11,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193350393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:11,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:11,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:15:11,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173827594] [2025-03-04 10:15:11,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:11,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:15:11,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:11,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:15:11,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:11,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:15:11,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 309 transitions, 3781 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:11,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:11,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:15:11,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:12,606 INFO L124 PetriNetUnfolderBase]: 4577/7786 cut-off events. [2025-03-04 10:15:12,606 INFO L125 PetriNetUnfolderBase]: For 242483/242483 co-relation queries the response was YES. [2025-03-04 10:15:12,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43837 conditions, 7786 events. 4577/7786 cut-off events. For 242483/242483 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 56401 event pairs, 2107 based on Foata normal form. 1/7627 useless extension candidates. Maximal degree in co-relation 43657. Up to 6793 conditions per place. [2025-03-04 10:15:12,714 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 326 selfloop transitions, 34 changer transitions 3/368 dead transitions. [2025-03-04 10:15:12,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 368 transitions, 5248 flow [2025-03-04 10:15:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:15:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:15:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 259 transitions. [2025-03-04 10:15:12,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3924242424242424 [2025-03-04 10:15:12,715 INFO L175 Difference]: Start difference. First operand has 320 places, 309 transitions, 3781 flow. Second operand 11 states and 259 transitions. [2025-03-04 10:15:12,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 368 transitions, 5248 flow [2025-03-04 10:15:13,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 368 transitions, 4906 flow, removed 153 selfloop flow, removed 5 redundant places. [2025-03-04 10:15:13,535 INFO L231 Difference]: Finished difference. Result has 328 places, 314 transitions, 3759 flow [2025-03-04 10:15:13,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3443, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3759, PETRI_PLACES=328, PETRI_TRANSITIONS=314} [2025-03-04 10:15:13,536 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 269 predicate places. [2025-03-04 10:15:13,536 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 314 transitions, 3759 flow [2025-03-04 10:15:13,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:13,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:13,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:13,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-04 10:15:13,536 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:13,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:13,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2069695372, now seen corresponding path program 36 times [2025-03-04 10:15:13,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:13,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482458043] [2025-03-04 10:15:13,537 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:15:13,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:13,542 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:15:13,550 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:15:13,550 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:15:13,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:13,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:13,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482458043] [2025-03-04 10:15:13,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482458043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:13,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:13,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:15:13,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25805711] [2025-03-04 10:15:13,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:13,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:15:13,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:13,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:15:13,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:13,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:15:13,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 314 transitions, 3759 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:13,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:13,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:15:13,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:15,213 INFO L124 PetriNetUnfolderBase]: 4598/7814 cut-off events. [2025-03-04 10:15:15,213 INFO L125 PetriNetUnfolderBase]: For 231253/231253 co-relation queries the response was YES. [2025-03-04 10:15:15,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42927 conditions, 7814 events. 4598/7814 cut-off events. For 231253/231253 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 56604 event pairs, 2130 based on Foata normal form. 1/7658 useless extension candidates. Maximal degree in co-relation 42742. Up to 6789 conditions per place. [2025-03-04 10:15:15,298 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 327 selfloop transitions, 37 changer transitions 4/373 dead transitions. [2025-03-04 10:15:15,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 373 transitions, 5083 flow [2025-03-04 10:15:15,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:15:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:15:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 262 transitions. [2025-03-04 10:15:15,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.396969696969697 [2025-03-04 10:15:15,299 INFO L175 Difference]: Start difference. First operand has 328 places, 314 transitions, 3759 flow. Second operand 11 states and 262 transitions. [2025-03-04 10:15:15,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 373 transitions, 5083 flow [2025-03-04 10:15:15,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 373 transitions, 4830 flow, removed 109 selfloop flow, removed 6 redundant places. [2025-03-04 10:15:15,864 INFO L231 Difference]: Finished difference. Result has 335 places, 319 transitions, 3746 flow [2025-03-04 10:15:15,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3506, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3746, PETRI_PLACES=335, PETRI_TRANSITIONS=319} [2025-03-04 10:15:15,865 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 276 predicate places. [2025-03-04 10:15:15,865 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 319 transitions, 3746 flow [2025-03-04 10:15:15,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:15,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:15,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:15,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-04 10:15:15,865 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:15,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:15,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1872202654, now seen corresponding path program 37 times [2025-03-04 10:15:15,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:15,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790489983] [2025-03-04 10:15:15,866 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:15:15,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:15,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:15:15,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:15:15,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:15,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:16,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:16,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790489983] [2025-03-04 10:15:16,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790489983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:16,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:16,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:15:16,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173322226] [2025-03-04 10:15:16,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:16,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:15:16,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:16,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:15:16,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:16,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:15:16,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 319 transitions, 3746 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:16,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:16,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:15:16,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:17,454 INFO L124 PetriNetUnfolderBase]: 4661/7928 cut-off events. [2025-03-04 10:15:17,454 INFO L125 PetriNetUnfolderBase]: For 236274/236274 co-relation queries the response was YES. [2025-03-04 10:15:17,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43597 conditions, 7928 events. 4661/7928 cut-off events. For 236274/236274 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 57566 event pairs, 2191 based on Foata normal form. 1/7770 useless extension candidates. Maximal degree in co-relation 43408. Up to 6919 conditions per place. [2025-03-04 10:15:17,563 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 334 selfloop transitions, 35 changer transitions 3/377 dead transitions. [2025-03-04 10:15:17,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 377 transitions, 5250 flow [2025-03-04 10:15:17,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:15:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:15:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 259 transitions. [2025-03-04 10:15:17,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3924242424242424 [2025-03-04 10:15:17,564 INFO L175 Difference]: Start difference. First operand has 335 places, 319 transitions, 3746 flow. Second operand 11 states and 259 transitions. [2025-03-04 10:15:17,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 377 transitions, 5250 flow [2025-03-04 10:15:18,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 377 transitions, 5121 flow, removed 33 selfloop flow, removed 7 redundant places. [2025-03-04 10:15:18,341 INFO L231 Difference]: Finished difference. Result has 341 places, 324 transitions, 3951 flow [2025-03-04 10:15:18,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3617, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3951, PETRI_PLACES=341, PETRI_TRANSITIONS=324} [2025-03-04 10:15:18,342 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 282 predicate places. [2025-03-04 10:15:18,342 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 324 transitions, 3951 flow [2025-03-04 10:15:18,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:18,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:18,342 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:18,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-04 10:15:18,342 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:18,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:18,343 INFO L85 PathProgramCache]: Analyzing trace with hash -258137360, now seen corresponding path program 38 times [2025-03-04 10:15:18,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:18,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706217279] [2025-03-04 10:15:18,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:18,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:18,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:15:18,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:15:18,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:18,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:18,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:18,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706217279] [2025-03-04 10:15:18,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706217279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:18,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:18,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:15:18,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208026073] [2025-03-04 10:15:18,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:18,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:15:18,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:18,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:15:18,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:18,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:15:18,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 324 transitions, 3951 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:18,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:18,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:15:18,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:20,438 INFO L124 PetriNetUnfolderBase]: 4661/7931 cut-off events. [2025-03-04 10:15:20,438 INFO L125 PetriNetUnfolderBase]: For 247678/247678 co-relation queries the response was YES. [2025-03-04 10:15:20,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43905 conditions, 7931 events. 4661/7931 cut-off events. For 247678/247678 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 57698 event pairs, 2160 based on Foata normal form. 1/7773 useless extension candidates. Maximal degree in co-relation 43712. Up to 6837 conditions per place. [2025-03-04 10:15:20,515 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 335 selfloop transitions, 40 changer transitions 5/385 dead transitions. [2025-03-04 10:15:20,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 385 transitions, 5255 flow [2025-03-04 10:15:20,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:15:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:15:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 268 transitions. [2025-03-04 10:15:20,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2025-03-04 10:15:20,516 INFO L175 Difference]: Start difference. First operand has 341 places, 324 transitions, 3951 flow. Second operand 11 states and 268 transitions. [2025-03-04 10:15:20,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 385 transitions, 5255 flow [2025-03-04 10:15:21,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 385 transitions, 4983 flow, removed 118 selfloop flow, removed 6 redundant places. [2025-03-04 10:15:21,076 INFO L231 Difference]: Finished difference. Result has 347 places, 328 transitions, 3852 flow [2025-03-04 10:15:21,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3679, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3852, PETRI_PLACES=347, PETRI_TRANSITIONS=328} [2025-03-04 10:15:21,077 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 288 predicate places. [2025-03-04 10:15:21,077 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 328 transitions, 3852 flow [2025-03-04 10:15:21,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:21,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:21,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:21,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-04 10:15:21,077 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:21,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:21,078 INFO L85 PathProgramCache]: Analyzing trace with hash 9637190, now seen corresponding path program 39 times [2025-03-04 10:15:21,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:21,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355570882] [2025-03-04 10:15:21,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:15:21,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:21,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:15:21,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-03-04 10:15:21,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:15:21,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:21,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:21,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355570882] [2025-03-04 10:15:21,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355570882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:21,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:21,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:15:21,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595346482] [2025-03-04 10:15:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:21,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:15:21,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:21,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:15:21,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:21,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:15:21,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 328 transitions, 3852 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:21,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:21,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:15:21,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:22,612 INFO L124 PetriNetUnfolderBase]: 4697/7998 cut-off events. [2025-03-04 10:15:22,612 INFO L125 PetriNetUnfolderBase]: For 230994/230994 co-relation queries the response was YES. [2025-03-04 10:15:22,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43274 conditions, 7998 events. 4697/7998 cut-off events. For 230994/230994 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 58283 event pairs, 2248 based on Foata normal form. 1/7841 useless extension candidates. Maximal degree in co-relation 43078. Up to 7088 conditions per place. [2025-03-04 10:15:22,729 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 330 selfloop transitions, 36 changer transitions 3/374 dead transitions. [2025-03-04 10:15:22,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 374 transitions, 5012 flow [2025-03-04 10:15:22,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:15:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:15:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 249 transitions. [2025-03-04 10:15:22,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37727272727272726 [2025-03-04 10:15:22,730 INFO L175 Difference]: Start difference. First operand has 347 places, 328 transitions, 3852 flow. Second operand 11 states and 249 transitions. [2025-03-04 10:15:22,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 374 transitions, 5012 flow [2025-03-04 10:15:23,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 374 transitions, 4847 flow, removed 48 selfloop flow, removed 7 redundant places. [2025-03-04 10:15:23,200 INFO L231 Difference]: Finished difference. Result has 352 places, 331 transitions, 3851 flow [2025-03-04 10:15:23,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3687, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3851, PETRI_PLACES=352, PETRI_TRANSITIONS=331} [2025-03-04 10:15:23,201 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 293 predicate places. [2025-03-04 10:15:23,201 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 331 transitions, 3851 flow [2025-03-04 10:15:23,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:23,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:23,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:23,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-04 10:15:23,201 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:23,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:23,201 INFO L85 PathProgramCache]: Analyzing trace with hash -103699842, now seen corresponding path program 40 times [2025-03-04 10:15:23,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:23,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159400360] [2025-03-04 10:15:23,202 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:15:23,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:23,230 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:15:23,241 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:15:23,242 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:15:23,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:23,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:23,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159400360] [2025-03-04 10:15:23,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159400360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:23,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:23,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:15:23,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422582053] [2025-03-04 10:15:23,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:23,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:15:23,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:23,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:15:23,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:23,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:15:23,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 331 transitions, 3851 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:23,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:23,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:15:23,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:25,072 INFO L124 PetriNetUnfolderBase]: 4895/8291 cut-off events. [2025-03-04 10:15:25,072 INFO L125 PetriNetUnfolderBase]: For 241788/241788 co-relation queries the response was YES. [2025-03-04 10:15:25,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44650 conditions, 8291 events. 4895/8291 cut-off events. For 241788/241788 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 60110 event pairs, 2261 based on Foata normal form. 1/8122 useless extension candidates. Maximal degree in co-relation 44451. Up to 7078 conditions per place. [2025-03-04 10:15:25,182 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 339 selfloop transitions, 45 changer transitions 5/393 dead transitions. [2025-03-04 10:15:25,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 393 transitions, 5107 flow [2025-03-04 10:15:25,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:15:25,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:15:25,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 260 transitions. [2025-03-04 10:15:25,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-03-04 10:15:25,183 INFO L175 Difference]: Start difference. First operand has 352 places, 331 transitions, 3851 flow. Second operand 11 states and 260 transitions. [2025-03-04 10:15:25,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 393 transitions, 5107 flow [2025-03-04 10:15:26,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 393 transitions, 4943 flow, removed 48 selfloop flow, removed 8 redundant places. [2025-03-04 10:15:26,065 INFO L231 Difference]: Finished difference. Result has 356 places, 335 transitions, 3883 flow [2025-03-04 10:15:26,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3687, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3883, PETRI_PLACES=356, PETRI_TRANSITIONS=335} [2025-03-04 10:15:26,066 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 297 predicate places. [2025-03-04 10:15:26,066 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 335 transitions, 3883 flow [2025-03-04 10:15:26,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:26,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:26,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:26,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-04 10:15:26,066 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:26,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:26,067 INFO L85 PathProgramCache]: Analyzing trace with hash -863889214, now seen corresponding path program 41 times [2025-03-04 10:15:26,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:26,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279725941] [2025-03-04 10:15:26,067 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:15:26,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:26,072 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-03-04 10:15:26,081 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:15:26,082 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:15:26,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:26,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:26,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279725941] [2025-03-04 10:15:26,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279725941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:26,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:26,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:15:26,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621727197] [2025-03-04 10:15:26,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:26,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:15:26,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:26,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:15:26,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:26,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-04 10:15:26,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 335 transitions, 3883 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:26,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:26,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-04 10:15:26,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:27,953 INFO L124 PetriNetUnfolderBase]: 4697/8004 cut-off events. [2025-03-04 10:15:27,953 INFO L125 PetriNetUnfolderBase]: For 226452/226452 co-relation queries the response was YES. [2025-03-04 10:15:28,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42920 conditions, 8004 events. 4697/8004 cut-off events. For 226452/226452 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 58502 event pairs, 2255 based on Foata normal form. 1/7842 useless extension candidates. Maximal degree in co-relation 42719. Up to 7100 conditions per place. [2025-03-04 10:15:28,091 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 336 selfloop transitions, 34 changer transitions 3/378 dead transitions. [2025-03-04 10:15:28,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 378 transitions, 4981 flow [2025-03-04 10:15:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:15:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:15:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 246 transitions. [2025-03-04 10:15:28,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2025-03-04 10:15:28,092 INFO L175 Difference]: Start difference. First operand has 356 places, 335 transitions, 3883 flow. Second operand 11 states and 246 transitions. [2025-03-04 10:15:28,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 378 transitions, 4981 flow [2025-03-04 10:15:28,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 378 transitions, 4796 flow, removed 54 selfloop flow, removed 7 redundant places. [2025-03-04 10:15:28,636 INFO L231 Difference]: Finished difference. Result has 361 places, 337 transitions, 3790 flow [2025-03-04 10:15:28,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3698, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3790, PETRI_PLACES=361, PETRI_TRANSITIONS=337} [2025-03-04 10:15:28,636 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 302 predicate places. [2025-03-04 10:15:28,636 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 337 transitions, 3790 flow [2025-03-04 10:15:28,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:28,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:28,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:28,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-04 10:15:28,637 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:28,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:28,637 INFO L85 PathProgramCache]: Analyzing trace with hash 368198100, now seen corresponding path program 1 times [2025-03-04 10:15:28,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:28,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792789141] [2025-03-04 10:15:28,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:28,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:28,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:15:28,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:15:28,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:28,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:15:28,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:28,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792789141] [2025-03-04 10:15:28,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792789141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:28,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781012937] [2025-03-04 10:15:28,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:28,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:28,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:28,715 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:28,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:15:28,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:15:28,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:15:28,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:28,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:28,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:15:28,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:15:28,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:15:28,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781012937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:28,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:28,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:15:28,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003393582] [2025-03-04 10:15:28,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:28,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:15:28,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:28,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:15:28,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:15:28,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:15:28,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 337 transitions, 3790 flow. Second operand has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 12 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:28,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:28,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:15:28,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:30,917 INFO L124 PetriNetUnfolderBase]: 7963/14225 cut-off events. [2025-03-04 10:15:30,917 INFO L125 PetriNetUnfolderBase]: For 529393/529709 co-relation queries the response was YES. [2025-03-04 10:15:31,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77920 conditions, 14225 events. 7963/14225 cut-off events. For 529393/529709 co-relation queries the response was YES. Maximal size of possible extension queue 1252. Compared 120137 event pairs, 4826 based on Foata normal form. 292/14098 useless extension candidates. Maximal degree in co-relation 77474. Up to 6459 conditions per place. [2025-03-04 10:15:31,148 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 557 selfloop transitions, 14 changer transitions 12/627 dead transitions. [2025-03-04 10:15:31,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 627 transitions, 8374 flow [2025-03-04 10:15:31,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:15:31,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:15:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2025-03-04 10:15:31,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2025-03-04 10:15:31,149 INFO L175 Difference]: Start difference. First operand has 361 places, 337 transitions, 3790 flow. Second operand 8 states and 188 transitions. [2025-03-04 10:15:31,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 627 transitions, 8374 flow [2025-03-04 10:15:32,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 627 transitions, 8242 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-03-04 10:15:32,269 INFO L231 Difference]: Finished difference. Result has 363 places, 342 transitions, 3796 flow [2025-03-04 10:15:32,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3724, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3796, PETRI_PLACES=363, PETRI_TRANSITIONS=342} [2025-03-04 10:15:32,270 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 304 predicate places. [2025-03-04 10:15:32,270 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 342 transitions, 3796 flow [2025-03-04 10:15:32,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 12 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:32,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:32,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:32,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:15:32,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-03-04 10:15:32,470 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:32,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:32,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1061586760, now seen corresponding path program 1 times [2025-03-04 10:15:32,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:32,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870233613] [2025-03-04 10:15:32,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:32,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:32,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:15:32,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:15:32,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:32,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:32,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:32,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870233613] [2025-03-04 10:15:32,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870233613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:32,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:32,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:15:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582919827] [2025-03-04 10:15:32,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:32,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:15:32,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:32,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:15:32,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:15:32,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:15:32,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 342 transitions, 3796 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:32,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:32,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:15:32,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:34,715 INFO L124 PetriNetUnfolderBase]: 8560/15532 cut-off events. [2025-03-04 10:15:34,715 INFO L125 PetriNetUnfolderBase]: For 760890/763040 co-relation queries the response was YES. [2025-03-04 10:15:34,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89316 conditions, 15532 events. 8560/15532 cut-off events. For 760890/763040 co-relation queries the response was YES. Maximal size of possible extension queue 1340. Compared 135364 event pairs, 3192 based on Foata normal form. 894/16005 useless extension candidates. Maximal degree in co-relation 88704. Up to 6932 conditions per place. [2025-03-04 10:15:35,006 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 453 selfloop transitions, 34 changer transitions 0/531 dead transitions. [2025-03-04 10:15:35,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 531 transitions, 7176 flow [2025-03-04 10:15:35,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-03-04 10:15:35,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 10:15:35,007 INFO L175 Difference]: Start difference. First operand has 363 places, 342 transitions, 3796 flow. Second operand 4 states and 128 transitions. [2025-03-04 10:15:35,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 531 transitions, 7176 flow [2025-03-04 10:15:36,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 531 transitions, 7158 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 10:15:36,376 INFO L231 Difference]: Finished difference. Result has 365 places, 353 transitions, 4162 flow [2025-03-04 10:15:36,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3726, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4162, PETRI_PLACES=365, PETRI_TRANSITIONS=353} [2025-03-04 10:15:36,376 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 306 predicate places. [2025-03-04 10:15:36,376 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 353 transitions, 4162 flow [2025-03-04 10:15:36,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:36,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:36,376 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:36,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-04 10:15:36,377 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:36,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1676497732, now seen corresponding path program 1 times [2025-03-04 10:15:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:36,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663579113] [2025-03-04 10:15:36,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:36,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:36,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 10:15:36,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:15:36,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:36,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:15:36,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:36,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663579113] [2025-03-04 10:15:36,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663579113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:36,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630069060] [2025-03-04 10:15:36,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:36,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:36,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:36,448 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:36,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:15:36,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 10:15:36,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:15:36,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:36,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:36,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:15:36,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:15:36,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:15:36,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630069060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:36,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:36,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-04 10:15:36,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598417614] [2025-03-04 10:15:36,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:36,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:15:36,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:36,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:15:36,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:15:36,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:15:36,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 353 transitions, 4162 flow. Second operand has 13 states, 13 states have (on average 18.53846153846154) internal successors, (241), 13 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:36,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:36,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:15:36,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:38,385 INFO L124 PetriNetUnfolderBase]: 6082/11554 cut-off events. [2025-03-04 10:15:38,385 INFO L125 PetriNetUnfolderBase]: For 497550/498759 co-relation queries the response was YES. [2025-03-04 10:15:38,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67347 conditions, 11554 events. 6082/11554 cut-off events. For 497550/498759 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 100606 event pairs, 2870 based on Foata normal form. 442/11591 useless extension candidates. Maximal degree in co-relation 66912. Up to 7664 conditions per place. [2025-03-04 10:15:38,555 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 300 selfloop transitions, 11 changer transitions 131/486 dead transitions. [2025-03-04 10:15:38,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 486 transitions, 6629 flow [2025-03-04 10:15:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:15:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:15:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 227 transitions. [2025-03-04 10:15:38,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37833333333333335 [2025-03-04 10:15:38,556 INFO L175 Difference]: Start difference. First operand has 365 places, 353 transitions, 4162 flow. Second operand 10 states and 227 transitions. [2025-03-04 10:15:38,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 486 transitions, 6629 flow [2025-03-04 10:15:39,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 486 transitions, 6481 flow, removed 50 selfloop flow, removed 6 redundant places. [2025-03-04 10:15:39,485 INFO L231 Difference]: Finished difference. Result has 370 places, 347 transitions, 4036 flow [2025-03-04 10:15:39,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=4052, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4036, PETRI_PLACES=370, PETRI_TRANSITIONS=347} [2025-03-04 10:15:39,486 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 311 predicate places. [2025-03-04 10:15:39,486 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 347 transitions, 4036 flow [2025-03-04 10:15:39,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.53846153846154) internal successors, (241), 13 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:39,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:39,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:39,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:15:39,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:39,687 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:39,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:39,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1469552060, now seen corresponding path program 2 times [2025-03-04 10:15:39,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:39,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243627402] [2025-03-04 10:15:39,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:39,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:39,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:15:39,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:15:39,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:39,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:15:39,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:39,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243627402] [2025-03-04 10:15:39,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243627402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:39,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705444686] [2025-03-04 10:15:39,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:39,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:39,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:39,896 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:39,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:15:39,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:15:39,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:15:39,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:39,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:39,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:15:39,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:15:40,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:40,186 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:15:40,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-04 10:15:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:15:40,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705444686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:40,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:40,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-03-04 10:15:40,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666821421] [2025-03-04 10:15:40,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:40,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:15:40,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:40,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:15:40,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:15:40,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:15:40,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 347 transitions, 4036 flow. Second operand has 24 states, 24 states have (on average 15.791666666666666) internal successors, (379), 24 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:40,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:40,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:15:40,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand