./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i --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/pthread-deagle/circular_buffer_ok.i -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 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:15:06,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:15:06,926 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:15:06,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:15:06,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:15:06,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:15:06,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:15:06,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:15:06,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:15:06,952 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:15:06,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:15:06,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:15:06,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:15:06,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:15:06,953 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:15:06,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:15:06,953 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:15:06,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:15:06,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:15:06,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:15:06,953 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:15:06,953 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:15:06,953 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:15:06,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:15:06,953 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:15:06,954 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:15:06,954 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:15:06,954 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:15:06,954 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:15:06,954 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:15:06,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:15:06,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:15:06,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:15:06,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:15:06,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:15:06,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:15:06,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:15:06,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:15:06,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:15:06,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:15:06,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:15:06,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:15:06,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:15:06,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:15:06,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:15:06,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:15:06,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:15:06,956 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 -> 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 [2025-01-10 01:15:07,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:15:07,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:15:07,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:15:07,161 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:15:07,161 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:15:07,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-01-10 01:15:08,314 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bdc10ed2/ffa52bcce8ed4a7193156d99918b2742/FLAG47d205392 [2025-01-10 01:15:08,595 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:15:08,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-01-10 01:15:08,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bdc10ed2/ffa52bcce8ed4a7193156d99918b2742/FLAG47d205392 [2025-01-10 01:15:08,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bdc10ed2/ffa52bcce8ed4a7193156d99918b2742 [2025-01-10 01:15:08,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:15:08,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:15:08,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:15:08,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:15:08,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:15:08,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:15:08" (1/1) ... [2025-01-10 01:15:08,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b1e86a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:08, skipping insertion in model container [2025-01-10 01:15:08,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:15:08" (1/1) ... [2025-01-10 01:15:08,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:15:08,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:15:08,877 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:15:08,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:15:08,952 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:15:08,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:08 WrapperNode [2025-01-10 01:15:08,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:15:08,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:15:08,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:15:08,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:15:08,958 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:15:08" (1/1) ... [2025-01-10 01:15:08,966 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:15:08" (1/1) ... [2025-01-10 01:15:08,983 INFO L138 Inliner]: procedures = 168, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2025-01-10 01:15:08,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:15:08,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:15:08,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:15:08,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:15:08,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:08" (1/1) ... [2025-01-10 01:15:08,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:08" (1/1) ... [2025-01-10 01:15:08,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:08" (1/1) ... [2025-01-10 01:15:09,005 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2025-01-10 01:15:09,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:08" (1/1) ... [2025-01-10 01:15:09,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:08" (1/1) ... [2025-01-10 01:15:09,014 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:08" (1/1) ... [2025-01-10 01:15:09,015 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:08" (1/1) ... [2025-01-10 01:15:09,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:08" (1/1) ... [2025-01-10 01:15:09,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:08" (1/1) ... [2025-01-10 01:15:09,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:08" (1/1) ... [2025-01-10 01:15:09,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:15:09,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:15:09,022 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:15:09,022 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:15:09,023 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:08" (1/1) ... [2025-01-10 01:15:09,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:15:09,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:09,048 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:15:09,052 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:15:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:15:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:15:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:15:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 01:15:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-10 01:15:09,070 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-10 01:15:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-10 01:15:09,070 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-10 01:15:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:15:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:15:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:15:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 01:15:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 01:15:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:15:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 01:15:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 01:15:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 01:15:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-10 01:15:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:15:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:15:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:15:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 01:15:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 01:15:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:15:09,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:15:09,073 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:15:09,189 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:15:09,191 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:15:09,412 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:15:09,412 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:15:09,573 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:15:09,574 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:15:09,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:15:09 BoogieIcfgContainer [2025-01-10 01:15:09,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:15:09,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:15:09,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:15:09,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:15:09,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:15:08" (1/3) ... [2025-01-10 01:15:09,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4cdc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:15:09, skipping insertion in model container [2025-01-10 01:15:09,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:08" (2/3) ... [2025-01-10 01:15:09,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4cdc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:15:09, skipping insertion in model container [2025-01-10 01:15:09,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:15:09" (3/3) ... [2025-01-10 01:15:09,583 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2025-01-10 01:15:09,593 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:15:09,594 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_ok.i that has 3 procedures, 55 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-01-10 01:15:09,594 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:15:09,665 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:15:09,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 66 transitions, 146 flow [2025-01-10 01:15:09,721 INFO L124 PetriNetUnfolderBase]: 12/64 cut-off events. [2025-01-10 01:15:09,724 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:15:09,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 12/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 193 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2025-01-10 01:15:09,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 66 transitions, 146 flow [2025-01-10 01:15:09,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 63 transitions, 138 flow [2025-01-10 01:15:09,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:15:09,749 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;@479b29b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:15:09,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-10 01:15:09,757 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:15:09,759 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-01-10 01:15:09,759 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:15:09,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:09,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:09,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:09,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:09,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1613226539, now seen corresponding path program 1 times [2025-01-10 01:15:09,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:09,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764656846] [2025-01-10 01:15:09,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:09,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:09,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:15:09,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:15:09,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:09,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:10,042 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:15:10,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:10,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764656846] [2025-01-10 01:15:10,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764656846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:10,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:10,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:15:10,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555490130] [2025-01-10 01:15:10,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:10,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:10,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:10,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:10,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-01-10 01:15:10,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:10,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:10,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-01-10 01:15:10,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:10,313 INFO L124 PetriNetUnfolderBase]: 571/1094 cut-off events. [2025-01-10 01:15:10,313 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-01-10 01:15:10,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 1094 events. 571/1094 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6000 event pairs, 437 based on Foata normal form. 154/1136 useless extension candidates. Maximal degree in co-relation 1967. Up to 912 conditions per place. [2025-01-10 01:15:10,324 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 32 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2025-01-10 01:15:10,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 182 flow [2025-01-10 01:15:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-01-10 01:15:10,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2025-01-10 01:15:10,338 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 138 flow. Second operand 3 states and 104 transitions. [2025-01-10 01:15:10,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 182 flow [2025-01-10 01:15:10,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:15:10,347 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 110 flow [2025-01-10 01:15:10,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2025-01-10 01:15:10,351 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2025-01-10 01:15:10,352 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 110 flow [2025-01-10 01:15:10,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:10,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:10,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:10,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:15:10,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:10,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:10,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1613226540, now seen corresponding path program 1 times [2025-01-10 01:15:10,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:10,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384013956] [2025-01-10 01:15:10,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:10,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:10,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:15:10,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:15:10,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:10,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:10,618 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:15:10,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:10,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384013956] [2025-01-10 01:15:10,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384013956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:10,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:10,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:15:10,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442071780] [2025-01-10 01:15:10,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:10,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:10,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:10,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:10,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:10,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-01-10 01:15:10,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 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:15:10,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:10,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-01-10 01:15:10,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:10,899 INFO L124 PetriNetUnfolderBase]: 1024/1958 cut-off events. [2025-01-10 01:15:10,899 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:15:10,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3583 conditions, 1958 events. 1024/1958 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 11126 event pairs, 370 based on Foata normal form. 0/1779 useless extension candidates. Maximal degree in co-relation 3577. Up to 901 conditions per place. [2025-01-10 01:15:10,911 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 59 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2025-01-10 01:15:10,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 289 flow [2025-01-10 01:15:10,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-01-10 01:15:10,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-01-10 01:15:10,913 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 110 flow. Second operand 3 states and 129 transitions. [2025-01-10 01:15:10,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 289 flow [2025-01-10 01:15:10,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:15:10,915 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 123 flow [2025-01-10 01:15:10,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2025-01-10 01:15:10,918 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2025-01-10 01:15:10,918 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 123 flow [2025-01-10 01:15:10,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 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:15:10,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:10,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:10,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:15:10,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:10,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:10,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1051731161, now seen corresponding path program 1 times [2025-01-10 01:15:10,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:10,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665691298] [2025-01-10 01:15:10,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:10,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:10,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:15:10,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:15:10,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:10,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:11,103 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:15:11,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:11,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665691298] [2025-01-10 01:15:11,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665691298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:11,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:11,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:15:11,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398313436] [2025-01-10 01:15:11,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:11,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:15:11,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:11,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:15:11,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:15:11,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-01-10 01:15:11,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:15:11,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:11,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-01-10 01:15:11,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:11,311 INFO L124 PetriNetUnfolderBase]: 1068/1989 cut-off events. [2025-01-10 01:15:11,311 INFO L125 PetriNetUnfolderBase]: For 51/53 co-relation queries the response was YES. [2025-01-10 01:15:11,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3818 conditions, 1989 events. 1068/1989 cut-off events. For 51/53 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 11055 event pairs, 822 based on Foata normal form. 0/1808 useless extension candidates. Maximal degree in co-relation 3810. Up to 1678 conditions per place. [2025-01-10 01:15:11,325 INFO L140 encePairwiseOnDemand]: 64/66 looper letters, 34 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-01-10 01:15:11,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 187 flow [2025-01-10 01:15:11,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-01-10 01:15:11,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2025-01-10 01:15:11,327 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 123 flow. Second operand 3 states and 98 transitions. [2025-01-10 01:15:11,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 187 flow [2025-01-10 01:15:11,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 185 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:15:11,328 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 117 flow [2025-01-10 01:15:11,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2025-01-10 01:15:11,328 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2025-01-10 01:15:11,329 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 117 flow [2025-01-10 01:15:11,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:15:11,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:11,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:11,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:15:11,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:11,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:11,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1050775831, now seen corresponding path program 1 times [2025-01-10 01:15:11,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:11,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243493350] [2025-01-10 01:15:11,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:11,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:11,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:15:11,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:15:11,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:11,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:11,435 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:15:11,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:11,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243493350] [2025-01-10 01:15:11,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243493350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:11,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:11,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:15:11,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84432530] [2025-01-10 01:15:11,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:11,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:11,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:11,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:11,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:11,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-01-10 01:15:11,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:15:11,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:11,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-01-10 01:15:11,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:11,617 INFO L124 PetriNetUnfolderBase]: 739/1428 cut-off events. [2025-01-10 01:15:11,618 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-01-10 01:15:11,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2692 conditions, 1428 events. 739/1428 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7496 event pairs, 204 based on Foata normal form. 23/1363 useless extension candidates. Maximal degree in co-relation 2683. Up to 770 conditions per place. [2025-01-10 01:15:11,626 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 52 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-01-10 01:15:11,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 270 flow [2025-01-10 01:15:11,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-01-10 01:15:11,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6262626262626263 [2025-01-10 01:15:11,629 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 117 flow. Second operand 3 states and 124 transitions. [2025-01-10 01:15:11,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 270 flow [2025-01-10 01:15:11,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:15:11,632 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 124 flow [2025-01-10 01:15:11,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-01-10 01:15:11,633 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2025-01-10 01:15:11,633 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 124 flow [2025-01-10 01:15:11,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:15:11,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:11,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:11,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:15:11,634 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:11,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:11,634 INFO L85 PathProgramCache]: Analyzing trace with hash 780789282, now seen corresponding path program 1 times [2025-01-10 01:15:11,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:11,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214742191] [2025-01-10 01:15:11,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:11,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:11,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:15:11,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:15:11,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:11,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:11,667 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:15:11,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:11,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214742191] [2025-01-10 01:15:11,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214742191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:11,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:11,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075812643] [2025-01-10 01:15:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:11,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:11,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:11,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:11,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:11,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-01-10 01:15:11,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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:15:11,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:11,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-01-10 01:15:11,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:11,859 INFO L124 PetriNetUnfolderBase]: 1181/2256 cut-off events. [2025-01-10 01:15:11,859 INFO L125 PetriNetUnfolderBase]: For 224/242 co-relation queries the response was YES. [2025-01-10 01:15:11,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4406 conditions, 2256 events. 1181/2256 cut-off events. For 224/242 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 13604 event pairs, 565 based on Foata normal form. 24/2104 useless extension candidates. Maximal degree in co-relation 4395. Up to 1235 conditions per place. [2025-01-10 01:15:11,869 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 56 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-01-10 01:15:11,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 298 flow [2025-01-10 01:15:11,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-01-10 01:15:11,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6414141414141414 [2025-01-10 01:15:11,871 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 124 flow. Second operand 3 states and 127 transitions. [2025-01-10 01:15:11,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 298 flow [2025-01-10 01:15:11,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:11,873 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 132 flow [2025-01-10 01:15:11,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-01-10 01:15:11,874 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2025-01-10 01:15:11,874 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 132 flow [2025-01-10 01:15:11,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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:15:11,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:11,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:11,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:15:11,874 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:11,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:11,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1957891913, now seen corresponding path program 1 times [2025-01-10 01:15:11,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:11,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886149290] [2025-01-10 01:15:11,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:11,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:11,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:15:11,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:15:11,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:11,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:11,932 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:15:11,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:11,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886149290] [2025-01-10 01:15:11,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886149290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:11,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:11,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:15:11,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845303984] [2025-01-10 01:15:11,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:11,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:11,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:11,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:11,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:11,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-01-10 01:15:11,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:15:11,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:11,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-01-10 01:15:11,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:12,100 INFO L124 PetriNetUnfolderBase]: 1071/2133 cut-off events. [2025-01-10 01:15:12,101 INFO L125 PetriNetUnfolderBase]: For 202/218 co-relation queries the response was YES. [2025-01-10 01:15:12,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4230 conditions, 2133 events. 1071/2133 cut-off events. For 202/218 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12121 event pairs, 502 based on Foata normal form. 47/2072 useless extension candidates. Maximal degree in co-relation 4219. Up to 903 conditions per place. [2025-01-10 01:15:12,109 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 53 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2025-01-10 01:15:12,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 302 flow [2025-01-10 01:15:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-01-10 01:15:12,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-01-10 01:15:12,110 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 132 flow. Second operand 3 states and 123 transitions. [2025-01-10 01:15:12,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 302 flow [2025-01-10 01:15:12,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:15:12,112 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 145 flow [2025-01-10 01:15:12,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-01-10 01:15:12,112 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2025-01-10 01:15:12,112 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 145 flow [2025-01-10 01:15:12,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:15:12,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:12,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:12,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:15:12,113 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:12,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:12,113 INFO L85 PathProgramCache]: Analyzing trace with hash -366996550, now seen corresponding path program 1 times [2025-01-10 01:15:12,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:12,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309526097] [2025-01-10 01:15:12,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:12,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:12,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:15:12,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:15:12,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:12,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:12,209 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:15:12,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:12,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309526097] [2025-01-10 01:15:12,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309526097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:12,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:12,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:15:12,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806229286] [2025-01-10 01:15:12,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:12,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:15:12,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:12,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:15:12,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:15:12,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-01-10 01:15:12,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 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:15:12,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:12,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-01-10 01:15:12,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:12,491 INFO L124 PetriNetUnfolderBase]: 1069/2029 cut-off events. [2025-01-10 01:15:12,491 INFO L125 PetriNetUnfolderBase]: For 304/317 co-relation queries the response was YES. [2025-01-10 01:15:12,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4226 conditions, 2029 events. 1069/2029 cut-off events. For 304/317 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 11234 event pairs, 470 based on Foata normal form. 0/1881 useless extension candidates. Maximal degree in co-relation 4213. Up to 1334 conditions per place. [2025-01-10 01:15:12,498 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 87 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2025-01-10 01:15:12,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 110 transitions, 469 flow [2025-01-10 01:15:12,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:15:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:15:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 247 transitions. [2025-01-10 01:15:12,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346320346320347 [2025-01-10 01:15:12,500 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 145 flow. Second operand 7 states and 247 transitions. [2025-01-10 01:15:12,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 110 transitions, 469 flow [2025-01-10 01:15:12,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:15:12,502 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 187 flow [2025-01-10 01:15:12,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2025-01-10 01:15:12,502 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2025-01-10 01:15:12,502 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 187 flow [2025-01-10 01:15:12,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 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:15:12,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:12,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:12,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:15:12,504 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:12,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:12,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2113150564, now seen corresponding path program 1 times [2025-01-10 01:15:12,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:12,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317448925] [2025-01-10 01:15:12,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:12,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:12,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:15:12,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:15:12,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:12,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:15:12,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:12,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317448925] [2025-01-10 01:15:12,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317448925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:12,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:12,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:12,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374077693] [2025-01-10 01:15:12,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:12,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:12,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:12,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:12,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:12,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-01-10 01:15:12,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:15:12,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:12,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-01-10 01:15:12,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:12,777 INFO L124 PetriNetUnfolderBase]: 1714/3375 cut-off events. [2025-01-10 01:15:12,777 INFO L125 PetriNetUnfolderBase]: For 899/942 co-relation queries the response was YES. [2025-01-10 01:15:12,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7374 conditions, 3375 events. 1714/3375 cut-off events. For 899/942 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 21380 event pairs, 797 based on Foata normal form. 75/3295 useless extension candidates. Maximal degree in co-relation 7357. Up to 1698 conditions per place. [2025-01-10 01:15:12,793 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 69 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-01-10 01:15:12,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 448 flow [2025-01-10 01:15:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-01-10 01:15:12,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6414141414141414 [2025-01-10 01:15:12,794 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 187 flow. Second operand 3 states and 127 transitions. [2025-01-10 01:15:12,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 448 flow [2025-01-10 01:15:12,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 89 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:12,798 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 193 flow [2025-01-10 01:15:12,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2025-01-10 01:15:12,799 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2025-01-10 01:15:12,799 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 193 flow [2025-01-10 01:15:12,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:15:12,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:12,799 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:12,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:15:12,799 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:12,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:12,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1114605472, now seen corresponding path program 1 times [2025-01-10 01:15:12,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:12,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475147404] [2025-01-10 01:15:12,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:12,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:12,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:15:12,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:15:12,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:12,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:12,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:12,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475147404] [2025-01-10 01:15:12,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475147404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:12,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:12,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:12,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766257508] [2025-01-10 01:15:12,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:12,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:12,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:12,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:12,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:12,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-01-10 01:15:12,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:15:12,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:12,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-01-10 01:15:12,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:13,022 INFO L124 PetriNetUnfolderBase]: 1328/2547 cut-off events. [2025-01-10 01:15:13,022 INFO L125 PetriNetUnfolderBase]: For 740/759 co-relation queries the response was YES. [2025-01-10 01:15:13,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5785 conditions, 2547 events. 1328/2547 cut-off events. For 740/759 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 14452 event pairs, 487 based on Foata normal form. 91/2571 useless extension candidates. Maximal degree in co-relation 5767. Up to 1421 conditions per place. [2025-01-10 01:15:13,031 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 54 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-01-10 01:15:13,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 74 transitions, 356 flow [2025-01-10 01:15:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:13,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-01-10 01:15:13,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5808080808080808 [2025-01-10 01:15:13,032 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 193 flow. Second operand 3 states and 115 transitions. [2025-01-10 01:15:13,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 74 transitions, 356 flow [2025-01-10 01:15:13,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 74 transitions, 347 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:13,039 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 200 flow [2025-01-10 01:15:13,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2025-01-10 01:15:13,039 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2025-01-10 01:15:13,039 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 200 flow [2025-01-10 01:15:13,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:15:13,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:13,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:13,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:15:13,040 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:13,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:13,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1867359102, now seen corresponding path program 1 times [2025-01-10 01:15:13,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:13,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874078417] [2025-01-10 01:15:13,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:13,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:13,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:15:13,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:15:13,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:13,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:13,109 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:15:13,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:13,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874078417] [2025-01-10 01:15:13,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874078417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:13,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:13,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:13,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542546504] [2025-01-10 01:15:13,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:13,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:13,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:13,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:13,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:13,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-01-10 01:15:13,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:13,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:13,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-01-10 01:15:13,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:13,246 INFO L124 PetriNetUnfolderBase]: 804/1812 cut-off events. [2025-01-10 01:15:13,246 INFO L125 PetriNetUnfolderBase]: For 678/678 co-relation queries the response was YES. [2025-01-10 01:15:13,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4147 conditions, 1812 events. 804/1812 cut-off events. For 678/678 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9944 event pairs, 255 based on Foata normal form. 92/1855 useless extension candidates. Maximal degree in co-relation 4129. Up to 821 conditions per place. [2025-01-10 01:15:13,253 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 48 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2025-01-10 01:15:13,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 71 transitions, 352 flow [2025-01-10 01:15:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-01-10 01:15:13,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2025-01-10 01:15:13,254 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 200 flow. Second operand 3 states and 113 transitions. [2025-01-10 01:15:13,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 71 transitions, 352 flow [2025-01-10 01:15:13,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 71 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:13,257 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 202 flow [2025-01-10 01:15:13,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2025-01-10 01:15:13,258 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2025-01-10 01:15:13,258 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 202 flow [2025-01-10 01:15:13,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:13,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:13,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:13,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:15:13,259 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:13,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:13,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1882899012, now seen corresponding path program 1 times [2025-01-10 01:15:13,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:13,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288163355] [2025-01-10 01:15:13,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:13,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:13,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:15:13,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:15:13,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:13,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:13,427 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:15:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288163355] [2025-01-10 01:15:13,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288163355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:13,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:13,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:15:13,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837153971] [2025-01-10 01:15:13,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:13,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:15:13,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:13,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:15:13,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:15:13,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-01-10 01:15:13,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:15:13,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:13,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-01-10 01:15:13,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:13,678 INFO L124 PetriNetUnfolderBase]: 1473/3155 cut-off events. [2025-01-10 01:15:13,678 INFO L125 PetriNetUnfolderBase]: For 1353/1358 co-relation queries the response was YES. [2025-01-10 01:15:13,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7579 conditions, 3155 events. 1473/3155 cut-off events. For 1353/1358 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 17845 event pairs, 766 based on Foata normal form. 3/3018 useless extension candidates. Maximal degree in co-relation 7561. Up to 1308 conditions per place. [2025-01-10 01:15:13,692 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 90 selfloop transitions, 3 changer transitions 0/111 dead transitions. [2025-01-10 01:15:13,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 111 transitions, 578 flow [2025-01-10 01:15:13,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:15:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:15:13,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2025-01-10 01:15:13,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6553030303030303 [2025-01-10 01:15:13,693 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 202 flow. Second operand 4 states and 173 transitions. [2025-01-10 01:15:13,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 111 transitions, 578 flow [2025-01-10 01:15:13,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 111 transitions, 566 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:15:13,699 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 214 flow [2025-01-10 01:15:13,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2025-01-10 01:15:13,700 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2025-01-10 01:15:13,700 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 214 flow [2025-01-10 01:15:13,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:15:13,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:13,700 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] [2025-01-10 01:15:13,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:15:13,701 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:13,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:13,701 INFO L85 PathProgramCache]: Analyzing trace with hash 644729310, now seen corresponding path program 1 times [2025-01-10 01:15:13,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:13,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109568460] [2025-01-10 01:15:13,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:13,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:13,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:15:13,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:15:13,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:13,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:13,746 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:15:13,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:13,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109568460] [2025-01-10 01:15:13,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109568460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:13,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:13,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:15:13,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563560700] [2025-01-10 01:15:13,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:13,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:15:13,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:13,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:15:13,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:15:13,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-01-10 01:15:13,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:15:13,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:13,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-01-10 01:15:13,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:14,115 INFO L124 PetriNetUnfolderBase]: 2035/4435 cut-off events. [2025-01-10 01:15:14,115 INFO L125 PetriNetUnfolderBase]: For 1734/1736 co-relation queries the response was YES. [2025-01-10 01:15:14,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10377 conditions, 4435 events. 2035/4435 cut-off events. For 1734/1736 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 28326 event pairs, 825 based on Foata normal form. 106/4380 useless extension candidates. Maximal degree in co-relation 10356. Up to 2137 conditions per place. [2025-01-10 01:15:14,133 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 85 selfloop transitions, 4 changer transitions 0/108 dead transitions. [2025-01-10 01:15:14,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 108 transitions, 555 flow [2025-01-10 01:15:14,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:15:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:15:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2025-01-10 01:15:14,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6628787878787878 [2025-01-10 01:15:14,134 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 214 flow. Second operand 4 states and 175 transitions. [2025-01-10 01:15:14,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 108 transitions, 555 flow [2025-01-10 01:15:14,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 108 transitions, 555 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:15:14,139 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 233 flow [2025-01-10 01:15:14,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2025-01-10 01:15:14,140 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2025-01-10 01:15:14,140 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 233 flow [2025-01-10 01:15:14,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:15:14,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:14,141 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] [2025-01-10 01:15:14,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:15:14,141 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:14,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:14,142 INFO L85 PathProgramCache]: Analyzing trace with hash 464932377, now seen corresponding path program 1 times [2025-01-10 01:15:14,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:14,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848628248] [2025-01-10 01:15:14,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:14,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:14,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:15:14,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:15:14,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:14,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:15:14,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936048812] [2025-01-10 01:15:14,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:14,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:14,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:14,180 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:15:14,181 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:15:14,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:15:14,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:15:14,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:14,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:14,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:15:14,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:14,419 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:15:14,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:15:14,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:14,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848628248] [2025-01-10 01:15:14,420 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:15:14,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936048812] [2025-01-10 01:15:14,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936048812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:14,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:14,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:14,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640137794] [2025-01-10 01:15:14,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:14,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:15:14,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:14,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:15:14,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:15:14,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-01-10 01:15:14,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:14,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:14,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-01-10 01:15:14,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:14,659 INFO L124 PetriNetUnfolderBase]: 1515/3309 cut-off events. [2025-01-10 01:15:14,659 INFO L125 PetriNetUnfolderBase]: For 2187/2189 co-relation queries the response was YES. [2025-01-10 01:15:14,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8393 conditions, 3309 events. 1515/3309 cut-off events. For 2187/2189 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 19022 event pairs, 510 based on Foata normal form. 26/3240 useless extension candidates. Maximal degree in co-relation 8370. Up to 1576 conditions per place. [2025-01-10 01:15:14,675 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 71 selfloop transitions, 3 changer transitions 0/93 dead transitions. [2025-01-10 01:15:14,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 93 transitions, 508 flow [2025-01-10 01:15:14,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:15:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:15:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2025-01-10 01:15:14,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5946969696969697 [2025-01-10 01:15:14,679 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 233 flow. Second operand 4 states and 157 transitions. [2025-01-10 01:15:14,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 93 transitions, 508 flow [2025-01-10 01:15:14,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 494 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:14,685 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 236 flow [2025-01-10 01:15:14,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2025-01-10 01:15:14,686 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2025-01-10 01:15:14,687 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 236 flow [2025-01-10 01:15:14,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:14,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:14,687 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] [2025-01-10 01:15:14,694 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:15:14,888 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,SelfDestructingSolverStorable12 [2025-01-10 01:15:14,888 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:14,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:14,888 INFO L85 PathProgramCache]: Analyzing trace with hash 148387421, now seen corresponding path program 1 times [2025-01-10 01:15:14,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:14,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683472778] [2025-01-10 01:15:14,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:14,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:15:14,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:15:14,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:14,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:15,526 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:15:15,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:15,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683472778] [2025-01-10 01:15:15,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683472778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:15,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:15,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:15:15,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660753126] [2025-01-10 01:15:15,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:15,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:15:15,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:15,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:15:15,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:15:15,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-01-10 01:15:15,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 236 flow. Second operand has 11 states, 11 states have (on average 24.818181818181817) internal successors, (273), 11 states have internal predecessors, (273), 0 states have call successors, (0), 0 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:15:15,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:15,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-01-10 01:15:15,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:16,539 INFO L124 PetriNetUnfolderBase]: 1758/3795 cut-off events. [2025-01-10 01:15:16,540 INFO L125 PetriNetUnfolderBase]: For 2134/2138 co-relation queries the response was YES. [2025-01-10 01:15:16,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9511 conditions, 3795 events. 1758/3795 cut-off events. For 2134/2138 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 22238 event pairs, 587 based on Foata normal form. 0/3678 useless extension candidates. Maximal degree in co-relation 9486. Up to 1068 conditions per place. [2025-01-10 01:15:16,555 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 130 selfloop transitions, 16 changer transitions 0/165 dead transitions. [2025-01-10 01:15:16,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 165 transitions, 914 flow [2025-01-10 01:15:16,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:15:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:15:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 405 transitions. [2025-01-10 01:15:16,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-01-10 01:15:16,559 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 236 flow. Second operand 12 states and 405 transitions. [2025-01-10 01:15:16,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 165 transitions, 914 flow [2025-01-10 01:15:16,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 165 transitions, 906 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:16,565 INFO L231 Difference]: Finished difference. Result has 89 places, 70 transitions, 326 flow [2025-01-10 01:15:16,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=326, PETRI_PLACES=89, PETRI_TRANSITIONS=70} [2025-01-10 01:15:16,565 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 31 predicate places. [2025-01-10 01:15:16,565 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 70 transitions, 326 flow [2025-01-10 01:15:16,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.818181818181817) internal successors, (273), 11 states have internal predecessors, (273), 0 states have call successors, (0), 0 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:15:16,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:16,566 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-10 01:15:16,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:15:16,566 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:16,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:16,566 INFO L85 PathProgramCache]: Analyzing trace with hash 930286184, now seen corresponding path program 2 times [2025-01-10 01:15:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:16,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419688552] [2025-01-10 01:15:16,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:15:16,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:16,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:15:16,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:15:16,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:15:16,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:16,604 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:15:16,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:16,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419688552] [2025-01-10 01:15:16,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419688552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:16,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:16,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:15:16,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293119909] [2025-01-10 01:15:16,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:16,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:15:16,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:16,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:15:16,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:15:16,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-01-10 01:15:16,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 70 transitions, 326 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:15:16,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:16,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-01-10 01:15:16,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:16,993 INFO L124 PetriNetUnfolderBase]: 2497/5519 cut-off events. [2025-01-10 01:15:16,993 INFO L125 PetriNetUnfolderBase]: For 4008/4009 co-relation queries the response was YES. [2025-01-10 01:15:17,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14387 conditions, 5519 events. 2497/5519 cut-off events. For 4008/4009 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 36777 event pairs, 929 based on Foata normal form. 130/5496 useless extension candidates. Maximal degree in co-relation 14359. Up to 2467 conditions per place. [2025-01-10 01:15:17,016 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 123 selfloop transitions, 3 changer transitions 0/145 dead transitions. [2025-01-10 01:15:17,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 145 transitions, 1008 flow [2025-01-10 01:15:17,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:15:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:15:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2025-01-10 01:15:17,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6553030303030303 [2025-01-10 01:15:17,021 INFO L175 Difference]: Start difference. First operand has 89 places, 70 transitions, 326 flow. Second operand 4 states and 173 transitions. [2025-01-10 01:15:17,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 145 transitions, 1008 flow [2025-01-10 01:15:17,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 145 transitions, 989 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:17,027 INFO L231 Difference]: Finished difference. Result has 90 places, 71 transitions, 335 flow [2025-01-10 01:15:17,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=335, PETRI_PLACES=90, PETRI_TRANSITIONS=71} [2025-01-10 01:15:17,028 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 32 predicate places. [2025-01-10 01:15:17,028 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 71 transitions, 335 flow [2025-01-10 01:15:17,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:15:17,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:17,028 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] [2025-01-10 01:15:17,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:15:17,029 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:17,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:17,029 INFO L85 PathProgramCache]: Analyzing trace with hash 208400341, now seen corresponding path program 1 times [2025-01-10 01:15:17,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:17,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137663517] [2025-01-10 01:15:17,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:17,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:15:17,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:15:17,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:17,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:17,298 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:15:17,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:17,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137663517] [2025-01-10 01:15:17,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137663517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:17,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:17,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:15:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971526650] [2025-01-10 01:15:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:17,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:15:17,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:17,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:15:17,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:15:17,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 66 [2025-01-10 01:15:17,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 71 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:15:17,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:17,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 66 [2025-01-10 01:15:17,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:17,841 INFO L124 PetriNetUnfolderBase]: 3452/7327 cut-off events. [2025-01-10 01:15:17,841 INFO L125 PetriNetUnfolderBase]: For 6831/6835 co-relation queries the response was YES. [2025-01-10 01:15:17,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20418 conditions, 7327 events. 3452/7327 cut-off events. For 6831/6835 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 48625 event pairs, 1846 based on Foata normal form. 58/7158 useless extension candidates. Maximal degree in co-relation 20389. Up to 2908 conditions per place. [2025-01-10 01:15:17,881 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 82 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2025-01-10 01:15:17,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 108 transitions, 687 flow [2025-01-10 01:15:17,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:15:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:15:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2025-01-10 01:15:17,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2025-01-10 01:15:17,886 INFO L175 Difference]: Start difference. First operand has 90 places, 71 transitions, 335 flow. Second operand 5 states and 168 transitions. [2025-01-10 01:15:17,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 108 transitions, 687 flow [2025-01-10 01:15:17,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 108 transitions, 669 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:17,896 INFO L231 Difference]: Finished difference. Result has 92 places, 73 transitions, 370 flow [2025-01-10 01:15:17,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=92, PETRI_TRANSITIONS=73} [2025-01-10 01:15:17,897 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 34 predicate places. [2025-01-10 01:15:17,897 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 73 transitions, 370 flow [2025-01-10 01:15:17,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:15:17,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:17,897 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:17,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:15:17,897 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:17,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:17,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1821463474, now seen corresponding path program 3 times [2025-01-10 01:15:17,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:17,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711600243] [2025-01-10 01:15:17,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:15:17,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:17,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:15:17,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-01-10 01:15:17,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:15:17,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:17,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711600243] [2025-01-10 01:15:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711600243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:17,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:17,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:15:17,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507087368] [2025-01-10 01:15:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:17,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:17,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:17,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:17,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:17,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-01-10 01:15:17,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 73 transitions, 370 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:17,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:17,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-01-10 01:15:17,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:18,360 INFO L124 PetriNetUnfolderBase]: 3286/7046 cut-off events. [2025-01-10 01:15:18,360 INFO L125 PetriNetUnfolderBase]: For 6035/6038 co-relation queries the response was YES. [2025-01-10 01:15:18,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19314 conditions, 7046 events. 3286/7046 cut-off events. For 6035/6038 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 47388 event pairs, 2589 based on Foata normal form. 19/6830 useless extension candidates. Maximal degree in co-relation 19283. Up to 5596 conditions per place. [2025-01-10 01:15:18,468 INFO L140 encePairwiseOnDemand]: 64/66 looper letters, 52 selfloop transitions, 1 changer transitions 3/72 dead transitions. [2025-01-10 01:15:18,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 72 transitions, 478 flow [2025-01-10 01:15:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-01-10 01:15:18,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 01:15:18,469 INFO L175 Difference]: Start difference. First operand has 92 places, 73 transitions, 370 flow. Second operand 3 states and 99 transitions. [2025-01-10 01:15:18,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 72 transitions, 478 flow [2025-01-10 01:15:18,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 72 transitions, 470 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:18,479 INFO L231 Difference]: Finished difference. Result has 91 places, 69 transitions, 349 flow [2025-01-10 01:15:18,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=91, PETRI_TRANSITIONS=69} [2025-01-10 01:15:18,479 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 33 predicate places. [2025-01-10 01:15:18,480 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 69 transitions, 349 flow [2025-01-10 01:15:18,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:18,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:18,480 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, 1] [2025-01-10 01:15:18,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:15:18,481 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:18,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:18,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1483491578, now seen corresponding path program 1 times [2025-01-10 01:15:18,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:18,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445610867] [2025-01-10 01:15:18,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:18,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:18,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 01:15:18,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:15:18,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:18,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:18,572 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:15:18,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:18,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445610867] [2025-01-10 01:15:18,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445610867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:18,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:18,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:18,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691042497] [2025-01-10 01:15:18,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:18,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:15:18,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:18,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:15:18,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:15:18,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-01-10 01:15:18,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 69 transitions, 349 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:15:18,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:18,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-01-10 01:15:18,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:18,959 INFO L124 PetriNetUnfolderBase]: 2401/5111 cut-off events. [2025-01-10 01:15:18,959 INFO L125 PetriNetUnfolderBase]: For 4648/4652 co-relation queries the response was YES. [2025-01-10 01:15:18,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14141 conditions, 5111 events. 2401/5111 cut-off events. For 4648/4652 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 30603 event pairs, 1925 based on Foata normal form. 50/5023 useless extension candidates. Maximal degree in co-relation 14109. Up to 4137 conditions per place. [2025-01-10 01:15:18,979 INFO L140 encePairwiseOnDemand]: 64/66 looper letters, 50 selfloop transitions, 1 changer transitions 0/65 dead transitions. [2025-01-10 01:15:18,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 65 transitions, 426 flow [2025-01-10 01:15:18,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-01-10 01:15:18,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-01-10 01:15:18,980 INFO L175 Difference]: Start difference. First operand has 91 places, 69 transitions, 349 flow. Second operand 3 states and 96 transitions. [2025-01-10 01:15:18,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 65 transitions, 426 flow [2025-01-10 01:15:18,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 65 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:18,988 INFO L231 Difference]: Finished difference. Result has 88 places, 65 transitions, 315 flow [2025-01-10 01:15:18,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=315, PETRI_PLACES=88, PETRI_TRANSITIONS=65} [2025-01-10 01:15:18,989 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 30 predicate places. [2025-01-10 01:15:18,989 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 65 transitions, 315 flow [2025-01-10 01:15:18,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:15:18,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:18,990 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:18,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:15:18,990 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:18,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:18,990 INFO L85 PathProgramCache]: Analyzing trace with hash -447632695, now seen corresponding path program 1 times [2025-01-10 01:15:18,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:18,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591972877] [2025-01-10 01:15:18,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:18,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:19,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 01:15:19,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:15:19,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:19,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:19,103 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:15:19,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:19,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591972877] [2025-01-10 01:15:19,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591972877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:19,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:19,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:15:19,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760479959] [2025-01-10 01:15:19,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:19,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:15:19,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:19,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:15:19,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:15:19,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-01-10 01:15:19,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 65 transitions, 315 flow. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 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:15:19,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:19,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-01-10 01:15:19,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:19,506 INFO L124 PetriNetUnfolderBase]: 2478/5174 cut-off events. [2025-01-10 01:15:19,506 INFO L125 PetriNetUnfolderBase]: For 5047/5047 co-relation queries the response was YES. [2025-01-10 01:15:19,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14433 conditions, 5174 events. 2478/5174 cut-off events. For 5047/5047 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 30404 event pairs, 1259 based on Foata normal form. 0/5050 useless extension candidates. Maximal degree in co-relation 14402. Up to 3002 conditions per place. [2025-01-10 01:15:19,533 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 82 selfloop transitions, 12 changer transitions 5/111 dead transitions. [2025-01-10 01:15:19,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 111 transitions, 716 flow [2025-01-10 01:15:19,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:15:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:15:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2025-01-10 01:15:19,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5025252525252525 [2025-01-10 01:15:19,535 INFO L175 Difference]: Start difference. First operand has 88 places, 65 transitions, 315 flow. Second operand 6 states and 199 transitions. [2025-01-10 01:15:19,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 111 transitions, 716 flow [2025-01-10 01:15:19,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 111 transitions, 715 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:15:19,543 INFO L231 Difference]: Finished difference. Result has 90 places, 63 transitions, 344 flow [2025-01-10 01:15:19,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=90, PETRI_TRANSITIONS=63} [2025-01-10 01:15:19,544 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 32 predicate places. [2025-01-10 01:15:19,544 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 63 transitions, 344 flow [2025-01-10 01:15:19,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 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:15:19,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:19,544 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:19,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:15:19,545 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:19,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1298108788, now seen corresponding path program 1 times [2025-01-10 01:15:19,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:19,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704592323] [2025-01-10 01:15:19,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:19,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:19,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:15:19,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:15:19,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:19,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:15:19,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:19,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704592323] [2025-01-10 01:15:19,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704592323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:19,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:19,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:19,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080702287] [2025-01-10 01:15:19,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:19,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:15:19,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:19,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:15:19,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:15:19,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-01-10 01:15:19,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 63 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:19,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:19,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-01-10 01:15:19,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:20,192 INFO L124 PetriNetUnfolderBase]: 2495/5428 cut-off events. [2025-01-10 01:15:20,192 INFO L125 PetriNetUnfolderBase]: For 7092/7093 co-relation queries the response was YES. [2025-01-10 01:15:20,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15752 conditions, 5428 events. 2495/5428 cut-off events. For 7092/7093 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 30872 event pairs, 823 based on Foata normal form. 23/5324 useless extension candidates. Maximal degree in co-relation 15720. Up to 1851 conditions per place. [2025-01-10 01:15:20,220 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 103 selfloop transitions, 5 changer transitions 2/123 dead transitions. [2025-01-10 01:15:20,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 123 transitions, 859 flow [2025-01-10 01:15:20,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:15:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:15:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2025-01-10 01:15:20,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-01-10 01:15:20,221 INFO L175 Difference]: Start difference. First operand has 90 places, 63 transitions, 344 flow. Second operand 5 states and 200 transitions. [2025-01-10 01:15:20,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 123 transitions, 859 flow [2025-01-10 01:15:20,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 123 transitions, 828 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:15:20,229 INFO L231 Difference]: Finished difference. Result has 90 places, 64 transitions, 348 flow [2025-01-10 01:15:20,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=348, PETRI_PLACES=90, PETRI_TRANSITIONS=64} [2025-01-10 01:15:20,229 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 32 predicate places. [2025-01-10 01:15:20,229 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 64 transitions, 348 flow [2025-01-10 01:15:20,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:20,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:20,230 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-01-10 01:15:20,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:15:20,230 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:20,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:20,230 INFO L85 PathProgramCache]: Analyzing trace with hash 476919423, now seen corresponding path program 1 times [2025-01-10 01:15:20,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:20,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685633104] [2025-01-10 01:15:20,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:20,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:20,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 01:15:20,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 01:15:20,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:20,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:15:20,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2576476] [2025-01-10 01:15:20,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:20,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:20,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:20,265 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:15:20,267 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:15:20,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 01:15:20,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 01:15:20,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:20,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:20,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:15:20,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:20,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:23,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:23,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685633104] [2025-01-10 01:15:23,301 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:15:23,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2576476] [2025-01-10 01:15:23,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2576476] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:23,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:15:23,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2025-01-10 01:15:23,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471052321] [2025-01-10 01:15:23,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:23,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:15:23,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:23,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:15:23,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:15:23,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-01-10 01:15:23,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 64 transitions, 348 flow. Second operand has 12 states, 12 states have (on average 27.333333333333332) internal successors, (328), 12 states have internal predecessors, (328), 0 states have call successors, (0), 0 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:15:23,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:23,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-01-10 01:15:23,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:25,488 INFO L124 PetriNetUnfolderBase]: 2367/5083 cut-off events. [2025-01-10 01:15:25,488 INFO L125 PetriNetUnfolderBase]: For 6591/6591 co-relation queries the response was YES. [2025-01-10 01:15:25,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14591 conditions, 5083 events. 2367/5083 cut-off events. For 6591/6591 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 26163 event pairs, 397 based on Foata normal form. 40/5040 useless extension candidates. Maximal degree in co-relation 14557. Up to 936 conditions per place. [2025-01-10 01:15:25,511 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 162 selfloop transitions, 10 changer transitions 4/188 dead transitions. [2025-01-10 01:15:25,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 188 transitions, 1241 flow [2025-01-10 01:15:25,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:15:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:15:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 365 transitions. [2025-01-10 01:15:25,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553030303030303 [2025-01-10 01:15:25,514 INFO L175 Difference]: Start difference. First operand has 90 places, 64 transitions, 348 flow. Second operand 10 states and 365 transitions. [2025-01-10 01:15:25,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 188 transitions, 1241 flow [2025-01-10 01:15:25,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 188 transitions, 1231 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:25,522 INFO L231 Difference]: Finished difference. Result has 99 places, 67 transitions, 392 flow [2025-01-10 01:15:25,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=392, PETRI_PLACES=99, PETRI_TRANSITIONS=67} [2025-01-10 01:15:25,523 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 41 predicate places. [2025-01-10 01:15:25,523 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 67 transitions, 392 flow [2025-01-10 01:15:25,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.333333333333332) internal successors, (328), 12 states have internal predecessors, (328), 0 states have call successors, (0), 0 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:15:25,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:25,523 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:25,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:15:25,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:25,724 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-01-10 01:15:25,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:25,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1867083545, now seen corresponding path program 1 times [2025-01-10 01:15:25,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:25,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235156852] [2025-01-10 01:15:25,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:25,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:25,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 01:15:25,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 01:15:25,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:25,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 01:15:25,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260532962] [2025-01-10 01:15:25,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:25,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:25,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:25,764 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:15:25,768 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:15:25,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 01:15:25,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 01:15:25,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:25,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:25,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-10 01:15:25,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:26,410 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 11 treesize of output 7 [2025-01-10 01:15:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:26,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:26,930 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 40 treesize of output 36 [2025-01-10 01:15:26,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:15:26,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 75 [2025-01-10 01:15:27,028 INFO L349 Elim1Store]: treesize reduction 50, result has 51.0 percent of original size [2025-01-10 01:15:27,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 126 [2025-01-10 01:15:27,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:15:27,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 85 [2025-01-10 01:16:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:16:28,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:28,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235156852] [2025-01-10 01:16:28,853 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 01:16:28,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260532962] [2025-01-10 01:16:28,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260532962] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:16:28,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:16:28,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2025-01-10 01:16:28,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840081278] [2025-01-10 01:16:28,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:16:28,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-10 01:16:28,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:28,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-10 01:16:28,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=785, Unknown=8, NotChecked=0, Total=930 [2025-01-10 01:16:33,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:16:37,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-01-10 01:16:42,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1]