./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:12:39,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:12:39,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:12:39,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:12:39,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:12:39,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:12:39,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:12:39,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:12:39,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:12:39,656 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:12:39,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:12:39,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:12:39,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:12:39,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:12:39,658 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:12:39,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:12:39,658 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:12:39,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:12:39,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:12:39,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:12:39,658 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:12:39,658 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:12:39,659 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:12:39,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:12:39,659 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:12:39,659 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:12:39,659 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:12:39,659 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:12:39,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:12:39,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:12:39,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:12:39,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:12:39,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:12:39,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:12:39,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:12:39,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:12:39,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:12:39,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:12:39,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:12:39,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:12:39,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:12:39,661 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:12:39,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:12:39,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:12:39,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:12:39,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:12:39,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:12:39,661 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 [2025-01-10 01:12:39,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:12:39,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:12:39,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:12:39,891 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:12:39,891 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:12:39,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2025-01-10 01:12:41,052 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49c9d237d/7011a8d3415741e7a4b7bf0e2ee54b06/FLAGb7d2d31b6 [2025-01-10 01:12:41,356 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:12:41,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2025-01-10 01:12:41,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49c9d237d/7011a8d3415741e7a4b7bf0e2ee54b06/FLAGb7d2d31b6 [2025-01-10 01:12:41,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49c9d237d/7011a8d3415741e7a4b7bf0e2ee54b06 [2025-01-10 01:12:41,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:12:41,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:12:41,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:12:41,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:12:41,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:12:41,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:12:41" (1/1) ... [2025-01-10 01:12:41,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ba6db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41, skipping insertion in model container [2025-01-10 01:12:41,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:12:41" (1/1) ... [2025-01-10 01:12:41,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:12:41,547 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:12:41,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:12:41,562 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:12:41,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:12:41,588 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:12:41,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41 WrapperNode [2025-01-10 01:12:41,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:12:41,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:12:41,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:12:41,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:12:41,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41" (1/1) ... [2025-01-10 01:12:41,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41" (1/1) ... [2025-01-10 01:12:41,626 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 141 [2025-01-10 01:12:41,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:12:41,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:12:41,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:12:41,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:12:41,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41" (1/1) ... [2025-01-10 01:12:41,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41" (1/1) ... [2025-01-10 01:12:41,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41" (1/1) ... [2025-01-10 01:12:41,650 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:12:41,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41" (1/1) ... [2025-01-10 01:12:41,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41" (1/1) ... [2025-01-10 01:12:41,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41" (1/1) ... [2025-01-10 01:12:41,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41" (1/1) ... [2025-01-10 01:12:41,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41" (1/1) ... [2025-01-10 01:12:41,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41" (1/1) ... [2025-01-10 01:12:41,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41" (1/1) ... [2025-01-10 01:12:41,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:12:41,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:12:41,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:12:41,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:12:41,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41" (1/1) ... [2025-01-10 01:12:41,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:12:41,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:41,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:12:41,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:12:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:12:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:12:41,721 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:12:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:12:41,721 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:12:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:12:41,721 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:12:41,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:12:41,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:12:41,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:12:41,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:12:41,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:12:41,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:12:41,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:12:41,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:12:41,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:12:41,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:12:41,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:12:41,724 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:12:41,806 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:12:41,807 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:12:42,015 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:12:42,015 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:12:42,174 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:12:42,175 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:12:42,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:12:42 BoogieIcfgContainer [2025-01-10 01:12:42,176 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:12:42,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:12:42,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:12:42,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:12:42,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:12:41" (1/3) ... [2025-01-10 01:12:42,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65483212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:12:42, skipping insertion in model container [2025-01-10 01:12:42,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:12:41" (2/3) ... [2025-01-10 01:12:42,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65483212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:12:42, skipping insertion in model container [2025-01-10 01:12:42,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:12:42" (3/3) ... [2025-01-10 01:12:42,183 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2025-01-10 01:12:42,195 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:12:42,196 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive.wvr.c that has 4 procedures, 45 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-01-10 01:12:42,196 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:12:42,251 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:12:42,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 117 flow [2025-01-10 01:12:42,310 INFO L124 PetriNetUnfolderBase]: 4/45 cut-off events. [2025-01-10 01:12:42,313 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:12:42,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 4/45 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 103 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-01-10 01:12:42,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 48 transitions, 117 flow [2025-01-10 01:12:42,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 44 transitions, 106 flow [2025-01-10 01:12:42,329 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:12:42,340 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;@332e374a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:12:42,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-01-10 01:12:42,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:12:42,346 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:12:42,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:12:42,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:42,347 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:12:42,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:42,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:42,377 INFO L85 PathProgramCache]: Analyzing trace with hash 433045, now seen corresponding path program 1 times [2025-01-10 01:12:42,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:42,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491336904] [2025-01-10 01:12:42,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:42,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:42,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:12:42,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:12:42,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:42,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:42,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:42,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491336904] [2025-01-10 01:12:42,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491336904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:42,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:42,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:12:42,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591500073] [2025-01-10 01:12:42,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:42,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:12:42,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:42,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:12:42,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:12:42,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:12:42,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:42,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:42,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:12:42,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:42,792 INFO L124 PetriNetUnfolderBase]: 535/975 cut-off events. [2025-01-10 01:12:42,793 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-01-10 01:12:42,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1931 conditions, 975 events. 535/975 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6790 event pairs, 491 based on Foata normal form. 1/627 useless extension candidates. Maximal degree in co-relation 1792. Up to 826 conditions per place. [2025-01-10 01:12:42,810 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 25 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2025-01-10 01:12:42,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 154 flow [2025-01-10 01:12:42,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:12:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:12:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-01-10 01:12:42,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2025-01-10 01:12:42,823 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 106 flow. Second operand 3 states and 83 transitions. [2025-01-10 01:12:42,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 154 flow [2025-01-10 01:12:42,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 142 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:12:42,832 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 92 flow [2025-01-10 01:12:42,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2025-01-10 01:12:42,838 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2025-01-10 01:12:42,841 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 92 flow [2025-01-10 01:12:42,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:42,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:42,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:12:42,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:12:42,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:42,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash 433046, now seen corresponding path program 1 times [2025-01-10 01:12:42,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:42,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618212926] [2025-01-10 01:12:42,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:42,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:42,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:12:42,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:12:42,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:42,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:43,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:43,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618212926] [2025-01-10 01:12:43,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618212926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:43,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:43,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:12:43,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630852813] [2025-01-10 01:12:43,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:43,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:43,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:43,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:43,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:43,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:12:43,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:43,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:43,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:12:43,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:43,271 INFO L124 PetriNetUnfolderBase]: 535/974 cut-off events. [2025-01-10 01:12:43,272 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:12:43,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1858 conditions, 974 events. 535/974 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6780 event pairs, 491 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 1845. Up to 826 conditions per place. [2025-01-10 01:12:43,277 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 23 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-01-10 01:12:43,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 144 flow [2025-01-10 01:12:43,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-01-10 01:12:43,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-01-10 01:12:43,281 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 92 flow. Second operand 4 states and 100 transitions. [2025-01-10 01:12:43,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 144 flow [2025-01-10 01:12:43,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:43,282 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 94 flow [2025-01-10 01:12:43,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2025-01-10 01:12:43,284 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2025-01-10 01:12:43,284 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 94 flow [2025-01-10 01:12:43,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:43,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:43,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:43,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:12:43,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:43,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:43,285 INFO L85 PathProgramCache]: Analyzing trace with hash 562288212, now seen corresponding path program 1 times [2025-01-10 01:12:43,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:43,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557783674] [2025-01-10 01:12:43,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:43,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:43,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:12:43,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:12:43,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:43,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:43,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:43,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557783674] [2025-01-10 01:12:43,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557783674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:43,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:43,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:12:43,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686571684] [2025-01-10 01:12:43,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:43,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:12:43,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:43,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:12:43,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:12:43,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-01-10 01:12:43,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:43,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:43,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-01-10 01:12:43,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:43,502 INFO L124 PetriNetUnfolderBase]: 787/1327 cut-off events. [2025-01-10 01:12:43,502 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 01:12:43,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2524 conditions, 1327 events. 787/1327 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7114 event pairs, 266 based on Foata normal form. 46/932 useless extension candidates. Maximal degree in co-relation 2509. Up to 856 conditions per place. [2025-01-10 01:12:43,509 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 40 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2025-01-10 01:12:43,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 216 flow [2025-01-10 01:12:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:12:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:12:43,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-01-10 01:12:43,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7152777777777778 [2025-01-10 01:12:43,511 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 94 flow. Second operand 3 states and 103 transitions. [2025-01-10 01:12:43,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 216 flow [2025-01-10 01:12:43,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 208 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:12:43,513 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 109 flow [2025-01-10 01:12:43,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2025-01-10 01:12:43,514 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2025-01-10 01:12:43,514 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 109 flow [2025-01-10 01:12:43,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:43,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:43,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:43,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:12:43,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:43,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:43,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1994616877, now seen corresponding path program 1 times [2025-01-10 01:12:43,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:43,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192504139] [2025-01-10 01:12:43,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:43,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:43,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:12:43,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:12:43,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:43,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:43,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:43,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192504139] [2025-01-10 01:12:43,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192504139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:43,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:43,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:12:43,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865823993] [2025-01-10 01:12:43,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:43,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:43,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:43,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:43,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:43,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-01-10 01:12:43,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:43,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:43,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-01-10 01:12:43,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:43,756 INFO L124 PetriNetUnfolderBase]: 487/853 cut-off events. [2025-01-10 01:12:43,757 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-01-10 01:12:43,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 853 events. 487/853 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4349 event pairs, 330 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 842. Up to 711 conditions per place. [2025-01-10 01:12:43,761 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 24 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-01-10 01:12:43,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 153 flow [2025-01-10 01:12:43,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-01-10 01:12:43,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.515625 [2025-01-10 01:12:43,764 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 109 flow. Second operand 4 states and 99 transitions. [2025-01-10 01:12:43,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 153 flow [2025-01-10 01:12:43,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:12:43,766 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 102 flow [2025-01-10 01:12:43,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-01-10 01:12:43,766 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -8 predicate places. [2025-01-10 01:12:43,767 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 102 flow [2025-01-10 01:12:43,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:43,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:43,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:43,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:12:43,768 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:43,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:43,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1994616878, now seen corresponding path program 1 times [2025-01-10 01:12:43,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:43,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416367245] [2025-01-10 01:12:43,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:43,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:43,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:12:43,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:12:43,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:43,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:43,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:43,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416367245] [2025-01-10 01:12:43,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416367245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:43,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:43,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:12:43,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128213379] [2025-01-10 01:12:43,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:43,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:43,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:43,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:43,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:43,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-01-10 01:12:43,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:43,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:43,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-01-10 01:12:43,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:44,004 INFO L124 PetriNetUnfolderBase]: 540/979 cut-off events. [2025-01-10 01:12:44,005 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-01-10 01:12:44,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2050 conditions, 979 events. 540/979 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5233 event pairs, 383 based on Foata normal form. 0/818 useless extension candidates. Maximal degree in co-relation 1794. Up to 715 conditions per place. [2025-01-10 01:12:44,011 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 39 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-01-10 01:12:44,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 226 flow [2025-01-10 01:12:44,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:44,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-01-10 01:12:44,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.609375 [2025-01-10 01:12:44,013 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 102 flow. Second operand 4 states and 117 transitions. [2025-01-10 01:12:44,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 226 flow [2025-01-10 01:12:44,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:12:44,015 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 120 flow [2025-01-10 01:12:44,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2025-01-10 01:12:44,016 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-01-10 01:12:44,017 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 120 flow [2025-01-10 01:12:44,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:44,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:44,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:44,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:12:44,018 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:44,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:44,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1228577939, now seen corresponding path program 1 times [2025-01-10 01:12:44,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:44,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234896153] [2025-01-10 01:12:44,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:44,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:44,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:12:44,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:12:44,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:44,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:44,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:44,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234896153] [2025-01-10 01:12:44,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234896153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:44,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:44,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:12:44,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131987705] [2025-01-10 01:12:44,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:44,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:12:44,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:44,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:12:44,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:12:44,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-01-10 01:12:44,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 120 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:44,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:44,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-01-10 01:12:44,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:44,473 INFO L124 PetriNetUnfolderBase]: 312/645 cut-off events. [2025-01-10 01:12:44,474 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-01-10 01:12:44,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 645 events. 312/645 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3432 event pairs, 167 based on Foata normal form. 68/645 useless extension candidates. Maximal degree in co-relation 1066. Up to 388 conditions per place. [2025-01-10 01:12:44,477 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 24 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2025-01-10 01:12:44,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 194 flow [2025-01-10 01:12:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:12:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:12:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-01-10 01:12:44,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5291666666666667 [2025-01-10 01:12:44,479 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 120 flow. Second operand 5 states and 127 transitions. [2025-01-10 01:12:44,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 194 flow [2025-01-10 01:12:44,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:12:44,480 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 126 flow [2025-01-10 01:12:44,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2025-01-10 01:12:44,482 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-01-10 01:12:44,483 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 126 flow [2025-01-10 01:12:44,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:44,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:44,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:44,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:12:44,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:44,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:44,484 INFO L85 PathProgramCache]: Analyzing trace with hash -452882292, now seen corresponding path program 1 times [2025-01-10 01:12:44,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:44,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484418822] [2025-01-10 01:12:44,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:44,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:44,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:12:44,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:12:44,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:44,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:44,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:44,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484418822] [2025-01-10 01:12:44,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484418822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:44,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:44,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:12:44,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471083583] [2025-01-10 01:12:44,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:44,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:44,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:44,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:44,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:44,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-10 01:12:44,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:44,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:44,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-10 01:12:44,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:44,697 INFO L124 PetriNetUnfolderBase]: 485/830 cut-off events. [2025-01-10 01:12:44,697 INFO L125 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2025-01-10 01:12:44,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 830 events. 485/830 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3838 event pairs, 57 based on Foata normal form. 44/857 useless extension candidates. Maximal degree in co-relation 1570. Up to 495 conditions per place. [2025-01-10 01:12:44,700 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 48 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2025-01-10 01:12:44,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 322 flow [2025-01-10 01:12:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-01-10 01:12:44,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5677083333333334 [2025-01-10 01:12:44,701 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 126 flow. Second operand 4 states and 109 transitions. [2025-01-10 01:12:44,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 322 flow [2025-01-10 01:12:44,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 286 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:12:44,703 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 131 flow [2025-01-10 01:12:44,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2025-01-10 01:12:44,703 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2025-01-10 01:12:44,703 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 131 flow [2025-01-10 01:12:44,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:44,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:44,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:44,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:12:44,704 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:44,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:44,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2141171344, now seen corresponding path program 2 times [2025-01-10 01:12:44,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:44,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033506308] [2025-01-10 01:12:44,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:12:44,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:44,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:12:44,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:12:44,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:44,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:44,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:44,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033506308] [2025-01-10 01:12:44,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033506308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:44,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:44,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:12:44,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023927143] [2025-01-10 01:12:44,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:44,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:44,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:44,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:44,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:44,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-10 01:12:44,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:44,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:44,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-10 01:12:44,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:44,956 INFO L124 PetriNetUnfolderBase]: 472/801 cut-off events. [2025-01-10 01:12:44,956 INFO L125 PetriNetUnfolderBase]: For 264/302 co-relation queries the response was YES. [2025-01-10 01:12:44,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1929 conditions, 801 events. 472/801 cut-off events. For 264/302 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3242 event pairs, 88 based on Foata normal form. 54/847 useless extension candidates. Maximal degree in co-relation 1523. Up to 586 conditions per place. [2025-01-10 01:12:44,959 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 38 selfloop transitions, 6 changer transitions 0/55 dead transitions. [2025-01-10 01:12:44,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 268 flow [2025-01-10 01:12:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-01-10 01:12:44,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5260416666666666 [2025-01-10 01:12:44,961 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 131 flow. Second operand 4 states and 101 transitions. [2025-01-10 01:12:44,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 268 flow [2025-01-10 01:12:44,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:12:44,962 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 161 flow [2025-01-10 01:12:44,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2025-01-10 01:12:44,963 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2025-01-10 01:12:44,963 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 161 flow [2025-01-10 01:12:44,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:44,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:44,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:44,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:12:44,963 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:44,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash 552085888, now seen corresponding path program 3 times [2025-01-10 01:12:44,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:44,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234052344] [2025-01-10 01:12:44,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:12:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:44,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:12:44,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:12:44,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:12:44,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:45,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:45,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234052344] [2025-01-10 01:12:45,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234052344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:45,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:45,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:12:45,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172297127] [2025-01-10 01:12:45,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:45,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:12:45,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:45,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:12:45,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:12:45,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-10 01:12:45,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:45,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:45,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-10 01:12:45,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:45,212 INFO L124 PetriNetUnfolderBase]: 548/974 cut-off events. [2025-01-10 01:12:45,212 INFO L125 PetriNetUnfolderBase]: For 518/528 co-relation queries the response was YES. [2025-01-10 01:12:45,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2466 conditions, 974 events. 548/974 cut-off events. For 518/528 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4646 event pairs, 132 based on Foata normal form. 58/1019 useless extension candidates. Maximal degree in co-relation 1887. Up to 525 conditions per place. [2025-01-10 01:12:45,216 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 56 selfloop transitions, 7 changer transitions 0/74 dead transitions. [2025-01-10 01:12:45,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 387 flow [2025-01-10 01:12:45,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:12:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:12:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2025-01-10 01:12:45,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-01-10 01:12:45,217 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 161 flow. Second operand 5 states and 132 transitions. [2025-01-10 01:12:45,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 387 flow [2025-01-10 01:12:45,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 382 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:12:45,218 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 179 flow [2025-01-10 01:12:45,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2025-01-10 01:12:45,219 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2025-01-10 01:12:45,219 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 179 flow [2025-01-10 01:12:45,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:45,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:45,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:45,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:12:45,220 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:45,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2060648564, now seen corresponding path program 4 times [2025-01-10 01:12:45,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:45,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926650890] [2025-01-10 01:12:45,220 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:12:45,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:45,227 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:12:45,231 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:12:45,232 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:12:45,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:45,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:45,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926650890] [2025-01-10 01:12:45,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926650890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:45,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:45,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:12:45,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676275892] [2025-01-10 01:12:45,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:45,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:45,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:45,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:45,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:45,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-10 01:12:45,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:45,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:45,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-10 01:12:45,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:45,466 INFO L124 PetriNetUnfolderBase]: 694/1285 cut-off events. [2025-01-10 01:12:45,467 INFO L125 PetriNetUnfolderBase]: For 1210/1260 co-relation queries the response was YES. [2025-01-10 01:12:45,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3248 conditions, 1285 events. 694/1285 cut-off events. For 1210/1260 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6914 event pairs, 182 based on Foata normal form. 96/1295 useless extension candidates. Maximal degree in co-relation 2720. Up to 630 conditions per place. [2025-01-10 01:12:45,475 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 48 selfloop transitions, 7 changer transitions 0/67 dead transitions. [2025-01-10 01:12:45,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 67 transitions, 365 flow [2025-01-10 01:12:45,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:12:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:12:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-01-10 01:12:45,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-01-10 01:12:45,477 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 179 flow. Second operand 5 states and 126 transitions. [2025-01-10 01:12:45,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 67 transitions, 365 flow [2025-01-10 01:12:45,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 354 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:12:45,479 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 191 flow [2025-01-10 01:12:45,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2025-01-10 01:12:45,480 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2025-01-10 01:12:45,480 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 191 flow [2025-01-10 01:12:45,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:45,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:45,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:45,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:12:45,480 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:45,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:45,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1710597084, now seen corresponding path program 5 times [2025-01-10 01:12:45,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:45,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732728253] [2025-01-10 01:12:45,481 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:12:45,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:45,488 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:12:45,493 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:12:45,493 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:45,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:45,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:45,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732728253] [2025-01-10 01:12:45,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732728253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:45,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:45,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:12:45,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527787702] [2025-01-10 01:12:45,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:45,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:12:45,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:45,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:12:45,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:12:45,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-10 01:12:45,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:45,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:45,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-10 01:12:45,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:45,805 INFO L124 PetriNetUnfolderBase]: 941/1633 cut-off events. [2025-01-10 01:12:45,806 INFO L125 PetriNetUnfolderBase]: For 1462/1478 co-relation queries the response was YES. [2025-01-10 01:12:45,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4305 conditions, 1633 events. 941/1633 cut-off events. For 1462/1478 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8572 event pairs, 188 based on Foata normal form. 101/1668 useless extension candidates. Maximal degree in co-relation 3845. Up to 437 conditions per place. [2025-01-10 01:12:45,811 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 48 selfloop transitions, 4 changer transitions 14/77 dead transitions. [2025-01-10 01:12:45,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 439 flow [2025-01-10 01:12:45,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:12:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:12:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-01-10 01:12:45,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-01-10 01:12:45,813 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 191 flow. Second operand 5 states and 136 transitions. [2025-01-10 01:12:45,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 439 flow [2025-01-10 01:12:45,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 427 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:12:45,815 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 165 flow [2025-01-10 01:12:45,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2025-01-10 01:12:45,816 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2025-01-10 01:12:45,816 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 165 flow [2025-01-10 01:12:45,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:45,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:45,816 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] [2025-01-10 01:12:45,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:12:45,816 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:45,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1945375836, now seen corresponding path program 1 times [2025-01-10 01:12:45,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:45,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913094972] [2025-01-10 01:12:45,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:45,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:45,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 01:12:45,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:12:45,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:45,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:46,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:46,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913094972] [2025-01-10 01:12:46,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913094972] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:46,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717534466] [2025-01-10 01:12:46,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:46,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:46,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:46,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:46,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:12:46,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 01:12:46,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:12:46,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:46,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:46,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 01:12:46,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:46,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2025-01-10 01:12:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:46,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:47,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2025-01-10 01:12:47,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:12:47,328 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 78 treesize of output 68 [2025-01-10 01:12:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:47,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717534466] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:47,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:47,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2025-01-10 01:12:47,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598029106] [2025-01-10 01:12:47,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:47,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-10 01:12:47,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:47,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-10 01:12:47,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2025-01-10 01:12:47,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-01-10 01:12:47,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 165 flow. Second operand has 29 states, 29 states have (on average 12.689655172413794) internal successors, (368), 29 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:47,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:47,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-01-10 01:12:47,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:50,523 INFO L124 PetriNetUnfolderBase]: 6900/10218 cut-off events. [2025-01-10 01:12:50,524 INFO L125 PetriNetUnfolderBase]: For 11054/11054 co-relation queries the response was YES. [2025-01-10 01:12:50,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28309 conditions, 10218 events. 6900/10218 cut-off events. For 11054/11054 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 55416 event pairs, 635 based on Foata normal form. 440/10153 useless extension candidates. Maximal degree in co-relation 15777. Up to 2221 conditions per place. [2025-01-10 01:12:50,562 INFO L140 encePairwiseOnDemand]: 31/48 looper letters, 339 selfloop transitions, 123 changer transitions 34/500 dead transitions. [2025-01-10 01:12:50,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 500 transitions, 2754 flow [2025-01-10 01:12:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-10 01:12:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-01-10 01:12:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 1062 transitions. [2025-01-10 01:12:50,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3881578947368421 [2025-01-10 01:12:50,566 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 165 flow. Second operand 57 states and 1062 transitions. [2025-01-10 01:12:50,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 500 transitions, 2754 flow [2025-01-10 01:12:50,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 500 transitions, 2562 flow, removed 27 selfloop flow, removed 10 redundant places. [2025-01-10 01:12:50,580 INFO L231 Difference]: Finished difference. Result has 136 places, 174 transitions, 1222 flow [2025-01-10 01:12:50,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=1222, PETRI_PLACES=136, PETRI_TRANSITIONS=174} [2025-01-10 01:12:50,580 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 86 predicate places. [2025-01-10 01:12:50,581 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 174 transitions, 1222 flow [2025-01-10 01:12:50,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 12.689655172413794) internal successors, (368), 29 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:50,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:50,581 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] [2025-01-10 01:12:50,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:12:50,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 01:12:50,785 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:50,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash -226937823, now seen corresponding path program 1 times [2025-01-10 01:12:50,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:50,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324549965] [2025-01-10 01:12:50,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:50,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:50,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:12:50,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:12:50,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:50,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:12:50,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:50,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324549965] [2025-01-10 01:12:50,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324549965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:50,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:50,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:12:50,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653435465] [2025-01-10 01:12:50,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:50,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:12:50,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:50,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:12:50,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:12:50,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2025-01-10 01:12:50,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 174 transitions, 1222 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:50,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:50,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2025-01-10 01:12:50,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:51,140 INFO L124 PetriNetUnfolderBase]: 1768/3058 cut-off events. [2025-01-10 01:12:51,141 INFO L125 PetriNetUnfolderBase]: For 30096/30229 co-relation queries the response was YES. [2025-01-10 01:12:51,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14487 conditions, 3058 events. 1768/3058 cut-off events. For 30096/30229 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17342 event pairs, 718 based on Foata normal form. 87/2982 useless extension candidates. Maximal degree in co-relation 11311. Up to 2207 conditions per place. [2025-01-10 01:12:51,161 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 131 selfloop transitions, 4 changer transitions 0/184 dead transitions. [2025-01-10 01:12:51,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 184 transitions, 1606 flow [2025-01-10 01:12:51,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:12:51,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:12:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-01-10 01:12:51,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2025-01-10 01:12:51,162 INFO L175 Difference]: Start difference. First operand has 136 places, 174 transitions, 1222 flow. Second operand 3 states and 85 transitions. [2025-01-10 01:12:51,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 184 transitions, 1606 flow [2025-01-10 01:12:51,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 184 transitions, 1389 flow, removed 89 selfloop flow, removed 8 redundant places. [2025-01-10 01:12:51,209 INFO L231 Difference]: Finished difference. Result has 131 places, 165 transitions, 1008 flow [2025-01-10 01:12:51,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1008, PETRI_PLACES=131, PETRI_TRANSITIONS=165} [2025-01-10 01:12:51,210 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 81 predicate places. [2025-01-10 01:12:51,210 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 165 transitions, 1008 flow [2025-01-10 01:12:51,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:51,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:51,211 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2025-01-10 01:12:51,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:12:51,211 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:51,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:51,211 INFO L85 PathProgramCache]: Analyzing trace with hash 658858324, now seen corresponding path program 2 times [2025-01-10 01:12:51,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:51,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912773605] [2025-01-10 01:12:51,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:12:51,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:51,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:12:51,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:12:51,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:12:51,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:12:51,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:51,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912773605] [2025-01-10 01:12:51,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912773605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:51,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:51,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:12:51,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725205709] [2025-01-10 01:12:51,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:51,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:51,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:51,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:51,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:51,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-01-10 01:12:51,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 165 transitions, 1008 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:51,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:51,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-01-10 01:12:51,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:51,695 INFO L124 PetriNetUnfolderBase]: 2072/3851 cut-off events. [2025-01-10 01:12:51,695 INFO L125 PetriNetUnfolderBase]: For 34038/34293 co-relation queries the response was YES. [2025-01-10 01:12:51,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17608 conditions, 3851 events. 2072/3851 cut-off events. For 34038/34293 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 24308 event pairs, 474 based on Foata normal form. 271/3799 useless extension candidates. Maximal degree in co-relation 11997. Up to 1551 conditions per place. [2025-01-10 01:12:51,725 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 112 selfloop transitions, 47 changer transitions 0/225 dead transitions. [2025-01-10 01:12:51,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 225 transitions, 1746 flow [2025-01-10 01:12:51,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2025-01-10 01:12:51,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-01-10 01:12:51,726 INFO L175 Difference]: Start difference. First operand has 131 places, 165 transitions, 1008 flow. Second operand 4 states and 123 transitions. [2025-01-10 01:12:51,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 225 transitions, 1746 flow [2025-01-10 01:12:51,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 225 transitions, 1736 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-10 01:12:51,751 INFO L231 Difference]: Finished difference. Result has 135 places, 203 transitions, 1519 flow [2025-01-10 01:12:51,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1519, PETRI_PLACES=135, PETRI_TRANSITIONS=203} [2025-01-10 01:12:51,751 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 85 predicate places. [2025-01-10 01:12:51,751 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 203 transitions, 1519 flow [2025-01-10 01:12:51,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:51,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:51,752 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 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-01-10 01:12:51,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:12:51,752 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:51,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash -622546905, now seen corresponding path program 3 times [2025-01-10 01:12:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:51,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148783440] [2025-01-10 01:12:51,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:12:51,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:51,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-01-10 01:12:51,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 38 statements. [2025-01-10 01:12:51,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:12:51,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:12:51,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:51,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148783440] [2025-01-10 01:12:51,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148783440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:51,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:51,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:12:51,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279698053] [2025-01-10 01:12:51,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:51,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:12:51,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:51,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:12:51,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:12:51,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-10 01:12:51,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 203 transitions, 1519 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:51,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:51,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-10 01:12:51,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:52,742 INFO L124 PetriNetUnfolderBase]: 4346/7561 cut-off events. [2025-01-10 01:12:52,742 INFO L125 PetriNetUnfolderBase]: For 78184/78268 co-relation queries the response was YES. [2025-01-10 01:12:52,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38240 conditions, 7561 events. 4346/7561 cut-off events. For 78184/78268 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 50188 event pairs, 779 based on Foata normal form. 248/7356 useless extension candidates. Maximal degree in co-relation 28920. Up to 2420 conditions per place. [2025-01-10 01:12:52,780 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 174 selfloop transitions, 49 changer transitions 54/314 dead transitions. [2025-01-10 01:12:52,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 314 transitions, 3135 flow [2025-01-10 01:12:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:12:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:12:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2025-01-10 01:12:52,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-01-10 01:12:52,781 INFO L175 Difference]: Start difference. First operand has 135 places, 203 transitions, 1519 flow. Second operand 8 states and 200 transitions. [2025-01-10 01:12:52,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 314 transitions, 3135 flow [2025-01-10 01:12:52,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 314 transitions, 3067 flow, removed 34 selfloop flow, removed 0 redundant places. [2025-01-10 01:12:52,834 INFO L231 Difference]: Finished difference. Result has 144 places, 212 transitions, 1749 flow [2025-01-10 01:12:52,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1749, PETRI_PLACES=144, PETRI_TRANSITIONS=212} [2025-01-10 01:12:52,835 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 94 predicate places. [2025-01-10 01:12:52,835 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 212 transitions, 1749 flow [2025-01-10 01:12:52,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:52,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:52,835 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:12:52,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:12:52,835 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:52,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:52,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1951299326, now seen corresponding path program 4 times [2025-01-10 01:12:52,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:52,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951007277] [2025-01-10 01:12:52,836 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:12:52,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:52,841 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-01-10 01:12:52,861 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:12:52,862 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:12:52,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:12:52,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:52,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951007277] [2025-01-10 01:12:52,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951007277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:12:52,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:12:52,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:12:52,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570830590] [2025-01-10 01:12:52,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:12:52,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:12:52,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:52,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:12:52,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:12:52,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-01-10 01:12:52,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 212 transitions, 1749 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:52,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:52,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-01-10 01:12:52,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:12:53,509 INFO L124 PetriNetUnfolderBase]: 3332/5927 cut-off events. [2025-01-10 01:12:53,510 INFO L125 PetriNetUnfolderBase]: For 61045/61405 co-relation queries the response was YES. [2025-01-10 01:12:53,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30102 conditions, 5927 events. 3332/5927 cut-off events. For 61045/61405 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 37439 event pairs, 605 based on Foata normal form. 529/6203 useless extension candidates. Maximal degree in co-relation 26843. Up to 2545 conditions per place. [2025-01-10 01:12:53,546 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 148 selfloop transitions, 6 changer transitions 3/197 dead transitions. [2025-01-10 01:12:53,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 197 transitions, 2072 flow [2025-01-10 01:12:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:12:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:12:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-01-10 01:12:53,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546875 [2025-01-10 01:12:53,547 INFO L175 Difference]: Start difference. First operand has 144 places, 212 transitions, 1749 flow. Second operand 4 states and 105 transitions. [2025-01-10 01:12:53,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 197 transitions, 2072 flow [2025-01-10 01:12:53,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 197 transitions, 1931 flow, removed 40 selfloop flow, removed 11 redundant places. [2025-01-10 01:12:53,593 INFO L231 Difference]: Finished difference. Result has 128 places, 162 transitions, 1335 flow [2025-01-10 01:12:53,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1335, PETRI_PLACES=128, PETRI_TRANSITIONS=162} [2025-01-10 01:12:53,595 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 78 predicate places. [2025-01-10 01:12:53,595 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 162 transitions, 1335 flow [2025-01-10 01:12:53,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:53,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:12:53,595 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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] [2025-01-10 01:12:53,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:12:53,595 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:12:53,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:12:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1461220020, now seen corresponding path program 1 times [2025-01-10 01:12:53,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:12:53,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442699575] [2025-01-10 01:12:53,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:12:53,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:12:53,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:12:53,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:53,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:54,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:12:54,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442699575] [2025-01-10 01:12:54,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442699575] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:12:54,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051888482] [2025-01-10 01:12:54,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:12:54,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:12:54,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:12:54,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:12:54,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:12:54,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:12:54,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:12:54,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:12:54,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:12:54,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-10 01:12:54,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:12:55,176 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-01-10 01:12:55,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 20 [2025-01-10 01:12:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:55,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:12:55,571 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2025-01-10 01:12:55,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 52 [2025-01-10 01:12:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:12:56,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051888482] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:12:56,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:12:56,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-01-10 01:12:56,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947617121] [2025-01-10 01:12:56,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:12:56,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-10 01:12:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:12:56,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-10 01:12:56,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2025-01-10 01:12:56,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-01-10 01:12:56,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 162 transitions, 1335 flow. Second operand has 37 states, 37 states have (on average 13.756756756756756) internal successors, (509), 37 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:12:56,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:12:56,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-01-10 01:12:56,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:13,447 INFO L124 PetriNetUnfolderBase]: 44961/71264 cut-off events. [2025-01-10 01:13:13,447 INFO L125 PetriNetUnfolderBase]: For 420589/420775 co-relation queries the response was YES. [2025-01-10 01:13:14,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308905 conditions, 71264 events. 44961/71264 cut-off events. For 420589/420775 co-relation queries the response was YES. Maximal size of possible extension queue 1598. Compared 538826 event pairs, 2414 based on Foata normal form. 3548/74408 useless extension candidates. Maximal degree in co-relation 227877. Up to 10151 conditions per place. [2025-01-10 01:13:14,223 INFO L140 encePairwiseOnDemand]: 31/48 looper letters, 1436 selfloop transitions, 728 changer transitions 380/2551 dead transitions. [2025-01-10 01:13:14,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 2551 transitions, 23959 flow [2025-01-10 01:13:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2025-01-10 01:13:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2025-01-10 01:13:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 3165 transitions. [2025-01-10 01:13:14,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43379934210526316 [2025-01-10 01:13:14,237 INFO L175 Difference]: Start difference. First operand has 128 places, 162 transitions, 1335 flow. Second operand 152 states and 3165 transitions. [2025-01-10 01:13:14,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 2551 transitions, 23959 flow [2025-01-10 01:13:14,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 2551 transitions, 23637 flow, removed 158 selfloop flow, removed 1 redundant places. [2025-01-10 01:13:14,645 INFO L231 Difference]: Finished difference. Result has 350 places, 953 transitions, 11890 flow [2025-01-10 01:13:14,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=152, PETRI_FLOW=11890, PETRI_PLACES=350, PETRI_TRANSITIONS=953} [2025-01-10 01:13:14,649 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 300 predicate places. [2025-01-10 01:13:14,649 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 953 transitions, 11890 flow [2025-01-10 01:13:14,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 13.756756756756756) internal successors, (509), 37 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:14,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:14,650 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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] [2025-01-10 01:13:14,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:13:14,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:13:14,851 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-01-10 01:13:14,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:14,851 INFO L85 PathProgramCache]: Analyzing trace with hash -605607088, now seen corresponding path program 2 times [2025-01-10 01:13:14,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:14,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168027993] [2025-01-10 01:13:14,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:14,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:14,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-10 01:13:14,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:13:14,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:14,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:15,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:15,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168027993] [2025-01-10 01:13:15,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168027993] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:13:15,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505749034] [2025-01-10 01:13:15,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:15,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:13:15,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:15,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:13:15,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:13:15,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-10 01:13:15,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:13:15,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:13:15,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:15,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 01:13:15,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:13:15,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2025-01-10 01:13:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:16,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:13:17,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 104 [2025-01-10 01:13:17,267 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-01-10 01:13:17,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 196 [2025-01-10 01:13:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:13:18,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505749034] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:13:18,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:13:18,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 42 [2025-01-10 01:13:18,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034097039] [2025-01-10 01:13:18,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:13:18,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-10 01:13:18,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:18,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-10 01:13:18,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2025-01-10 01:13:18,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-01-10 01:13:18,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 953 transitions, 11890 flow. Second operand has 43 states, 43 states have (on average 15.13953488372093) internal successors, (651), 43 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:13:18,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:18,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-01-10 01:13:18,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:50,782 INFO L124 PetriNetUnfolderBase]: 61321/102977 cut-off events. [2025-01-10 01:13:50,782 INFO L125 PetriNetUnfolderBase]: For 5253587/5254113 co-relation queries the response was YES. [2025-01-10 01:13:52,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718089 conditions, 102977 events. 61321/102977 cut-off events. For 5253587/5254113 co-relation queries the response was YES. Maximal size of possible extension queue 2246. Compared 891173 event pairs, 7170 based on Foata normal form. 2354/105044 useless extension candidates. Maximal degree in co-relation 709536. Up to 16837 conditions per place. [2025-01-10 01:13:52,725 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 1827 selfloop transitions, 625 changer transitions 982/3469 dead transitions. [2025-01-10 01:13:52,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 3469 transitions, 51194 flow [2025-01-10 01:13:52,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-01-10 01:13:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2025-01-10 01:13:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 2047 transitions. [2025-01-10 01:13:52,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43076599326599324 [2025-01-10 01:13:52,731 INFO L175 Difference]: Start difference. First operand has 350 places, 953 transitions, 11890 flow. Second operand 99 states and 2047 transitions. [2025-01-10 01:13:52,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 3469 transitions, 51194 flow