./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/stack_longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/stack_longest-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5773bc320dd9dee5d943610df8c4ec3040864edddf388dd42a51d37167245e47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:43:14,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:43:14,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:43:14,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:43:14,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:43:15,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:43:15,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:43:15,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:43:15,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:43:15,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:43:15,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:43:15,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:43:15,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:43:15,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:43:15,011 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:43:15,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:43:15,011 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:43:15,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:43:15,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:43:15,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:43:15,011 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:43:15,011 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:43:15,011 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:43:15,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:43:15,012 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:43:15,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:43:15,012 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5773bc320dd9dee5d943610df8c4ec3040864edddf388dd42a51d37167245e47 [2025-03-04 09:43:15,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:43:15,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:43:15,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:43:15,218 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:43:15,218 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:43:15,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longest-2.i [2025-03-04 09:43:16,356 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8ddcaee/80439beafba44a75b5b68d21922eecda/FLAG57d1d6254 [2025-03-04 09:43:16,636 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:43:16,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-2.i [2025-03-04 09:43:16,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8ddcaee/80439beafba44a75b5b68d21922eecda/FLAG57d1d6254 [2025-03-04 09:43:16,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8ddcaee/80439beafba44a75b5b68d21922eecda [2025-03-04 09:43:16,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:43:16,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:43:16,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:43:16,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:43:16,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:43:16,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:43:16" (1/1) ... [2025-03-04 09:43:16,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ecb9cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:16, skipping insertion in model container [2025-03-04 09:43:16,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:43:16" (1/1) ... [2025-03-04 09:43:16,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:43:17,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:43:17,347 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:43:17,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:43:17,501 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:43:17,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:17 WrapperNode [2025-03-04 09:43:17,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:43:17,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:43:17,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:43:17,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:43:17,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:17" (1/1) ... [2025-03-04 09:43:17,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:17" (1/1) ... [2025-03-04 09:43:17,589 INFO L138 Inliner]: procedures = 277, calls = 831, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 943 [2025-03-04 09:43:17,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:43:17,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:43:17,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:43:17,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:43:17,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:17" (1/1) ... [2025-03-04 09:43:17,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:17" (1/1) ... [2025-03-04 09:43:17,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:17" (1/1) ... [2025-03-04 09:43:17,648 INFO L175 MemorySlicer]: Split 809 memory accesses to 3 slices as follows [2, 802, 5]. 99 percent of accesses are in the largest equivalence class. The 807 initializations are split as follows [2, 800, 5]. The 1 writes are split as follows [0, 1, 0]. [2025-03-04 09:43:17,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:17" (1/1) ... [2025-03-04 09:43:17,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:17" (1/1) ... [2025-03-04 09:43:17,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:17" (1/1) ... [2025-03-04 09:43:17,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:17" (1/1) ... [2025-03-04 09:43:17,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:17" (1/1) ... [2025-03-04 09:43:17,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:17" (1/1) ... [2025-03-04 09:43:17,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:43:17,697 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:43:17,698 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:43:17,698 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:43:17,698 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:17" (1/1) ... [2025-03-04 09:43:17,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:43:17,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:17,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:43:17,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:43:17,741 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 09:43:17,741 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 09:43:17,741 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 09:43:17,741 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 09:43:17,741 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 09:43:17,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:43:17,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:43:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:43:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:43:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:43:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:43:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 09:43:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:43:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:43:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:43:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:43:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:43:17,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:43:17,743 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:43:17,863 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:43:17,865 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:43:18,780 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L985-1: pop_#res#1 := 0; [2025-03-04 09:43:18,780 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: havoc pop_#t~mem37#1; [2025-03-04 09:43:18,781 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-1: havoc pop_#t~ret36#1; [2025-03-04 09:43:18,781 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:43:18,781 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:43:28,779 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:43:28,779 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:43:28,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:43:28 BoogieIcfgContainer [2025-03-04 09:43:28,779 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:43:28,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:43:28,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:43:28,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:43:28,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:43:16" (1/3) ... [2025-03-04 09:43:28,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b489de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:43:28, skipping insertion in model container [2025-03-04 09:43:28,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:17" (2/3) ... [2025-03-04 09:43:28,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b489de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:43:28, skipping insertion in model container [2025-03-04 09:43:28,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:43:28" (3/3) ... [2025-03-04 09:43:28,788 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2025-03-04 09:43:28,800 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:43:28,802 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longest-2.i that has 3 procedures, 46 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-04 09:43:28,802 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:43:28,870 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 09:43:28,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 54 transitions, 122 flow [2025-03-04 09:43:28,949 INFO L124 PetriNetUnfolderBase]: 9/52 cut-off events. [2025-03-04 09:43:28,951 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:43:28,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 52 events. 9/52 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 135 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 47. Up to 3 conditions per place. [2025-03-04 09:43:28,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 54 transitions, 122 flow [2025-03-04 09:43:28,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 51 transitions, 114 flow [2025-03-04 09:43:28,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:43:28,977 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;@4d04b850, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:43:28,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 09:43:29,005 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:43:29,006 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-04 09:43:29,006 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:43:29,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:29,007 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:29,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:29,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:29,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1074542194, now seen corresponding path program 1 times [2025-03-04 09:43:29,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:29,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031446056] [2025-03-04 09:43:29,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:29,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:29,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:43:29,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:43:29,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:29,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:29,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:29,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031446056] [2025-03-04 09:43:29,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031446056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:29,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:29,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:43:29,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529476377] [2025-03-04 09:43:29,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:29,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:43:29,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:29,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:43:29,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:43:29,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-03-04 09:43:29,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:29,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:29,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-03-04 09:43:29,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:30,029 INFO L124 PetriNetUnfolderBase]: 454/865 cut-off events. [2025-03-04 09:43:30,029 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 09:43:30,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1627 conditions, 865 events. 454/865 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4292 event pairs, 242 based on Foata normal form. 90/839 useless extension candidates. Maximal degree in co-relation 1552. Up to 512 conditions per place. [2025-03-04 09:43:30,036 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 43 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2025-03-04 09:43:30,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 225 flow [2025-03-04 09:43:30,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:43:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:43:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-03-04 09:43:30,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2025-03-04 09:43:30,047 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 114 flow. Second operand 4 states and 113 transitions. [2025-03-04 09:43:30,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 225 flow [2025-03-04 09:43:30,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 215 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:43:30,053 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 98 flow [2025-03-04 09:43:30,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2025-03-04 09:43:30,057 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2025-03-04 09:43:30,058 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 98 flow [2025-03-04 09:43:30,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:30,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:30,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:30,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:43:30,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:30,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1074542193, now seen corresponding path program 1 times [2025-03-04 09:43:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:30,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636429257] [2025-03-04 09:43:30,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:30,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:30,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:43:30,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:43:30,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:30,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:30,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:30,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636429257] [2025-03-04 09:43:30,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636429257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:30,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:30,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:43:30,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140666804] [2025-03-04 09:43:30,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:30,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:43:30,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:30,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:43:30,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:43:30,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-03-04 09:43:30,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:30,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:30,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-03-04 09:43:30,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:31,085 INFO L124 PetriNetUnfolderBase]: 574/1077 cut-off events. [2025-03-04 09:43:31,085 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-04 09:43:31,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2088 conditions, 1077 events. 574/1077 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5147 event pairs, 179 based on Foata normal form. 12/951 useless extension candidates. Maximal degree in co-relation 695. Up to 755 conditions per place. [2025-03-04 09:43:31,095 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 59 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2025-03-04 09:43:31,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 293 flow [2025-03-04 09:43:31,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:43:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:43:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-03-04 09:43:31,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5296296296296297 [2025-03-04 09:43:31,096 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 98 flow. Second operand 5 states and 143 transitions. [2025-03-04 09:43:31,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 293 flow [2025-03-04 09:43:31,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 75 transitions, 285 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:43:31,099 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 128 flow [2025-03-04 09:43:31,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2025-03-04 09:43:31,100 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2025-03-04 09:43:31,100 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 128 flow [2025-03-04 09:43:31,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:31,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:31,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:31,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:43:31,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:31,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1435346283, now seen corresponding path program 1 times [2025-03-04 09:43:31,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:31,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839534266] [2025-03-04 09:43:31,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:31,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:31,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 09:43:31,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 09:43:31,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:31,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:31,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:31,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839534266] [2025-03-04 09:43:31,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839534266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:31,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:31,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:43:31,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785669378] [2025-03-04 09:43:31,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:31,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:43:31,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:31,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:43:31,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:43:31,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:31,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:31,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:31,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:31,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:31,490 INFO L124 PetriNetUnfolderBase]: 823/1524 cut-off events. [2025-03-04 09:43:31,490 INFO L125 PetriNetUnfolderBase]: For 258/262 co-relation queries the response was YES. [2025-03-04 09:43:31,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3219 conditions, 1524 events. 823/1524 cut-off events. For 258/262 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7819 event pairs, 363 based on Foata normal form. 2/1388 useless extension candidates. Maximal degree in co-relation 1126. Up to 857 conditions per place. [2025-03-04 09:43:31,498 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 68 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-03-04 09:43:31,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 86 transitions, 370 flow [2025-03-04 09:43:31,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:43:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:43:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-03-04 09:43:31,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-04 09:43:31,500 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 128 flow. Second operand 4 states and 135 transitions. [2025-03-04 09:43:31,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 86 transitions, 370 flow [2025-03-04 09:43:31,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 86 transitions, 368 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:31,503 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 159 flow [2025-03-04 09:43:31,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-03-04 09:43:31,504 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2025-03-04 09:43:31,505 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 159 flow [2025-03-04 09:43:31,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:31,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:31,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:31,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:43:31,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:31,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:31,505 INFO L85 PathProgramCache]: Analyzing trace with hash 616409874, now seen corresponding path program 1 times [2025-03-04 09:43:31,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:31,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99069109] [2025-03-04 09:43:31,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:31,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:31,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:43:31,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:43:31,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:31,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:31,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:31,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99069109] [2025-03-04 09:43:31,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99069109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:31,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:31,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:43:31,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532352962] [2025-03-04 09:43:31,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:31,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:43:31,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:31,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:43:31,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:43:31,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:31,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:31,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:31,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:31,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:31,772 INFO L124 PetriNetUnfolderBase]: 957/1724 cut-off events. [2025-03-04 09:43:31,773 INFO L125 PetriNetUnfolderBase]: For 504/508 co-relation queries the response was YES. [2025-03-04 09:43:31,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4020 conditions, 1724 events. 957/1724 cut-off events. For 504/508 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8950 event pairs, 395 based on Foata normal form. 14/1589 useless extension candidates. Maximal degree in co-relation 1265. Up to 1191 conditions per place. [2025-03-04 09:43:31,782 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 55 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-03-04 09:43:31,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 328 flow [2025-03-04 09:43:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:43:31,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:43:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-03-04 09:43:31,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2025-03-04 09:43:31,783 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 159 flow. Second operand 3 states and 103 transitions. [2025-03-04 09:43:31,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 328 flow [2025-03-04 09:43:31,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:31,787 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 168 flow [2025-03-04 09:43:31,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=168, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2025-03-04 09:43:31,787 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2025-03-04 09:43:31,787 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 168 flow [2025-03-04 09:43:31,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:31,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:31,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:31,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:43:31,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:31,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash 462808774, now seen corresponding path program 1 times [2025-03-04 09:43:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:31,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385365462] [2025-03-04 09:43:31,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:31,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:31,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:43:31,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:43:31,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:31,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:32,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:32,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385365462] [2025-03-04 09:43:32,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385365462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:32,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:32,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:43:32,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776996598] [2025-03-04 09:43:32,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:32,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:43:32,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:32,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:43:32,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:43:32,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:32,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:32,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:32,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:32,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:32,163 INFO L124 PetriNetUnfolderBase]: 499/1036 cut-off events. [2025-03-04 09:43:32,163 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2025-03-04 09:43:32,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2395 conditions, 1036 events. 499/1036 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4797 event pairs, 105 based on Foata normal form. 60/1027 useless extension candidates. Maximal degree in co-relation 919. Up to 634 conditions per place. [2025-03-04 09:43:32,169 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 45 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2025-03-04 09:43:32,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 300 flow [2025-03-04 09:43:32,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:43:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:43:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-04 09:43:32,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5617283950617284 [2025-03-04 09:43:32,171 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 168 flow. Second operand 3 states and 91 transitions. [2025-03-04 09:43:32,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 300 flow [2025-03-04 09:43:32,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 292 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:32,174 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 170 flow [2025-03-04 09:43:32,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2025-03-04 09:43:32,177 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2025-03-04 09:43:32,177 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 170 flow [2025-03-04 09:43:32,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:32,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:32,177 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:32,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:43:32,177 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:32,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:32,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1387336456, now seen corresponding path program 1 times [2025-03-04 09:43:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:32,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559943247] [2025-03-04 09:43:32,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:32,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:43:32,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:43:32,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:32,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:32,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:32,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559943247] [2025-03-04 09:43:32,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559943247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:32,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240330909] [2025-03-04 09:43:32,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:32,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:32,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:32,602 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:32,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:43:32,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:43:32,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:43:32,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:32,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:32,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 1756 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 09:43:32,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:33,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:33,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240330909] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:33,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:33,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-04 09:43:33,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431092898] [2025-03-04 09:43:33,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:33,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:43:33,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:33,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:43:33,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:43:33,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-03-04 09:43:33,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 170 flow. Second operand has 14 states, 14 states have (on average 17.214285714285715) internal successors, (241), 14 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:33,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:33,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-03-04 09:43:33,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:33,983 INFO L124 PetriNetUnfolderBase]: 1740/3514 cut-off events. [2025-03-04 09:43:33,984 INFO L125 PetriNetUnfolderBase]: For 794/794 co-relation queries the response was YES. [2025-03-04 09:43:33,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8225 conditions, 3514 events. 1740/3514 cut-off events. For 794/794 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 19732 event pairs, 262 based on Foata normal form. 54/3337 useless extension candidates. Maximal degree in co-relation 2561. Up to 699 conditions per place. [2025-03-04 09:43:34,003 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 194 selfloop transitions, 26 changer transitions 0/231 dead transitions. [2025-03-04 09:43:34,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 231 transitions, 1170 flow [2025-03-04 09:43:34,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:43:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 09:43:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 425 transitions. [2025-03-04 09:43:34,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5246913580246914 [2025-03-04 09:43:34,005 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 170 flow. Second operand 15 states and 425 transitions. [2025-03-04 09:43:34,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 231 transitions, 1170 flow [2025-03-04 09:43:34,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 231 transitions, 1148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:34,013 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 417 flow [2025-03-04 09:43:34,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=417, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-03-04 09:43:34,014 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 32 predicate places. [2025-03-04 09:43:34,014 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 417 flow [2025-03-04 09:43:34,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.214285714285715) internal successors, (241), 14 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:34,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:34,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:34,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:43:34,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 09:43:34,216 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:34,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:34,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1853744766, now seen corresponding path program 1 times [2025-03-04 09:43:34,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:34,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173545237] [2025-03-04 09:43:34,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:34,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:34,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:43:34,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:43:34,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:34,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:34,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:34,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173545237] [2025-03-04 09:43:34,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173545237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:34,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:34,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:43:34,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647762299] [2025-03-04 09:43:34,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:34,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:43:34,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:34,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:43:34,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:43:34,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-03-04 09:43:34,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 417 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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-03-04 09:43:34,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:34,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-03-04 09:43:34,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:34,708 INFO L124 PetriNetUnfolderBase]: 1695/3436 cut-off events. [2025-03-04 09:43:34,708 INFO L125 PetriNetUnfolderBase]: For 1885/1885 co-relation queries the response was YES. [2025-03-04 09:43:34,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8816 conditions, 3436 events. 1695/3436 cut-off events. For 1885/1885 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 19758 event pairs, 1170 based on Foata normal form. 0/3326 useless extension candidates. Maximal degree in co-relation 7338. Up to 2532 conditions per place. [2025-03-04 09:43:34,731 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 64 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-03-04 09:43:34,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 566 flow [2025-03-04 09:43:34,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:43:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:43:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-03-04 09:43:34,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-04 09:43:34,733 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 417 flow. Second operand 4 states and 96 transitions. [2025-03-04 09:43:34,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 566 flow [2025-03-04 09:43:34,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 79 transitions, 556 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-03-04 09:43:34,743 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 411 flow [2025-03-04 09:43:34,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=411, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2025-03-04 09:43:34,745 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2025-03-04 09:43:34,745 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 411 flow [2025-03-04 09:43:34,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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-03-04 09:43:34,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:34,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:34,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:43:34,747 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:34,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:34,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1744161149, now seen corresponding path program 1 times [2025-03-04 09:43:34,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:34,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413089453] [2025-03-04 09:43:34,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:34,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:34,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:43:34,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:43:34,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:34,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:35,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:35,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413089453] [2025-03-04 09:43:35,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413089453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:35,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:35,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:43:35,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301211227] [2025-03-04 09:43:35,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:35,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:43:35,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:35,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:43:35,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:43:35,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-03-04 09:43:35,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 411 flow. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:35,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:35,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-03-04 09:43:35,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:35,828 INFO L124 PetriNetUnfolderBase]: 1780/3580 cut-off events. [2025-03-04 09:43:35,829 INFO L125 PetriNetUnfolderBase]: For 2160/2160 co-relation queries the response was YES. [2025-03-04 09:43:35,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9298 conditions, 3580 events. 1780/3580 cut-off events. For 2160/2160 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 20407 event pairs, 456 based on Foata normal form. 0/3439 useless extension candidates. Maximal degree in co-relation 7795. Up to 2729 conditions per place. [2025-03-04 09:43:35,854 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 95 selfloop transitions, 6 changer transitions 0/112 dead transitions. [2025-03-04 09:43:35,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 112 transitions, 751 flow [2025-03-04 09:43:35,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:43:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:43:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2025-03-04 09:43:35,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2025-03-04 09:43:35,856 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 411 flow. Second operand 6 states and 164 transitions. [2025-03-04 09:43:35,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 112 transitions, 751 flow [2025-03-04 09:43:35,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 112 transitions, 743 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:43:35,866 INFO L231 Difference]: Finished difference. Result has 88 places, 78 transitions, 456 flow [2025-03-04 09:43:35,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=456, PETRI_PLACES=88, PETRI_TRANSITIONS=78} [2025-03-04 09:43:35,867 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 39 predicate places. [2025-03-04 09:43:35,867 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 78 transitions, 456 flow [2025-03-04 09:43:35,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:35,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:35,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:35,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:43:35,867 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:35,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:35,868 INFO L85 PathProgramCache]: Analyzing trace with hash 193987445, now seen corresponding path program 1 times [2025-03-04 09:43:35,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:35,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355044687] [2025-03-04 09:43:35,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:35,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:35,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:43:35,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:43:35,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:35,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:35,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:35,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355044687] [2025-03-04 09:43:35,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355044687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:35,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:35,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:43:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107896581] [2025-03-04 09:43:35,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:35,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:43:35,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:35,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:43:35,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:43:35,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:35,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 78 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:35,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:35,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:35,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:36,529 INFO L124 PetriNetUnfolderBase]: 2658/5555 cut-off events. [2025-03-04 09:43:36,530 INFO L125 PetriNetUnfolderBase]: For 3825/3825 co-relation queries the response was YES. [2025-03-04 09:43:36,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14225 conditions, 5555 events. 2658/5555 cut-off events. For 3825/3825 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 36697 event pairs, 1282 based on Foata normal form. 137/5499 useless extension candidates. Maximal degree in co-relation 12401. Up to 3123 conditions per place. [2025-03-04 09:43:36,565 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 121 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2025-03-04 09:43:36,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 135 transitions, 1084 flow [2025-03-04 09:43:36,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:43:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:43:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-03-04 09:43:36,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2025-03-04 09:43:36,566 INFO L175 Difference]: Start difference. First operand has 88 places, 78 transitions, 456 flow. Second operand 3 states and 104 transitions. [2025-03-04 09:43:36,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 135 transitions, 1084 flow [2025-03-04 09:43:36,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 135 transitions, 1072 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 09:43:36,579 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 461 flow [2025-03-04 09:43:36,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2025-03-04 09:43:36,579 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 40 predicate places. [2025-03-04 09:43:36,580 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 461 flow [2025-03-04 09:43:36,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:36,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:36,580 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-03-04 09:43:36,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:43:36,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:36,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:36,581 INFO L85 PathProgramCache]: Analyzing trace with hash -981774932, now seen corresponding path program 1 times [2025-03-04 09:43:36,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:36,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699685215] [2025-03-04 09:43:36,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:36,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:36,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:43:36,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:43:36,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:36,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:37,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:37,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699685215] [2025-03-04 09:43:37,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699685215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:37,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:37,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:43:37,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533128688] [2025-03-04 09:43:37,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:37,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:43:37,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:37,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:43:37,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:43:37,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:37,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 79 transitions, 461 flow. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:37,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:37,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:37,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:38,979 INFO L124 PetriNetUnfolderBase]: 3462/7035 cut-off events. [2025-03-04 09:43:38,979 INFO L125 PetriNetUnfolderBase]: For 5745/5745 co-relation queries the response was YES. [2025-03-04 09:43:39,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19713 conditions, 7035 events. 3462/7035 cut-off events. For 5745/5745 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 44932 event pairs, 786 based on Foata normal form. 0/6819 useless extension candidates. Maximal degree in co-relation 16138. Up to 3938 conditions per place. [2025-03-04 09:43:39,031 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 165 selfloop transitions, 12 changer transitions 0/189 dead transitions. [2025-03-04 09:43:39,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 189 transitions, 1335 flow [2025-03-04 09:43:39,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:43:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 09:43:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 319 transitions. [2025-03-04 09:43:39,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49228395061728397 [2025-03-04 09:43:39,033 INFO L175 Difference]: Start difference. First operand has 89 places, 79 transitions, 461 flow. Second operand 12 states and 319 transitions. [2025-03-04 09:43:39,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 189 transitions, 1335 flow [2025-03-04 09:43:39,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 189 transitions, 1323 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:39,052 INFO L231 Difference]: Finished difference. Result has 103 places, 83 transitions, 523 flow [2025-03-04 09:43:39,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=523, PETRI_PLACES=103, PETRI_TRANSITIONS=83} [2025-03-04 09:43:39,053 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 54 predicate places. [2025-03-04 09:43:39,053 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 83 transitions, 523 flow [2025-03-04 09:43:39,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:39,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:39,053 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-03-04 09:43:39,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:43:39,054 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:39,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:39,054 INFO L85 PathProgramCache]: Analyzing trace with hash -890078705, now seen corresponding path program 1 times [2025-03-04 09:43:39,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:39,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037274827] [2025-03-04 09:43:39,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:39,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:39,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 09:43:39,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 09:43:39,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:39,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:39,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:39,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037274827] [2025-03-04 09:43:39,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037274827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:39,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:39,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:43:39,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394211080] [2025-03-04 09:43:39,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:39,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:43:39,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:39,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:43:39,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:43:39,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:39,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 83 transitions, 523 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:39,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:39,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:39,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:40,200 INFO L124 PetriNetUnfolderBase]: 4935/10402 cut-off events. [2025-03-04 09:43:40,200 INFO L125 PetriNetUnfolderBase]: For 10228/10228 co-relation queries the response was YES. [2025-03-04 09:43:40,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29155 conditions, 10402 events. 4935/10402 cut-off events. For 10228/10228 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 76324 event pairs, 1723 based on Foata normal form. 307/10394 useless extension candidates. Maximal degree in co-relation 24234. Up to 4409 conditions per place. [2025-03-04 09:43:40,263 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 189 selfloop transitions, 3 changer transitions 0/204 dead transitions. [2025-03-04 09:43:40,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 204 transitions, 1774 flow [2025-03-04 09:43:40,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:43:40,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:43:40,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-03-04 09:43:40,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 09:43:40,267 INFO L175 Difference]: Start difference. First operand has 103 places, 83 transitions, 523 flow. Second operand 4 states and 144 transitions. [2025-03-04 09:43:40,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 204 transitions, 1774 flow [2025-03-04 09:43:40,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 204 transitions, 1721 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-03-04 09:43:40,298 INFO L231 Difference]: Finished difference. Result has 100 places, 84 transitions, 519 flow [2025-03-04 09:43:40,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=519, PETRI_PLACES=100, PETRI_TRANSITIONS=84} [2025-03-04 09:43:40,299 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 51 predicate places. [2025-03-04 09:43:40,299 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 84 transitions, 519 flow [2025-03-04 09:43:40,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:40,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:40,299 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:40,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:43:40,299 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:40,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:40,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1317969052, now seen corresponding path program 1 times [2025-03-04 09:43:40,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:40,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304997481] [2025-03-04 09:43:40,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:40,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:40,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 09:43:40,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 09:43:40,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:40,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:40,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:40,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304997481] [2025-03-04 09:43:40,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304997481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:40,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403605215] [2025-03-04 09:43:40,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:40,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:40,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:40,697 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:40,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:43:40,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 09:43:40,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 09:43:40,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:40,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:40,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 09:43:40,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:41,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:41,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403605215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:41,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:41,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-04 09:43:41,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413286731] [2025-03-04 09:43:41,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:41,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 09:43:41,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:41,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 09:43:41,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-04 09:43:41,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-03-04 09:43:41,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 84 transitions, 519 flow. Second operand has 17 states, 17 states have (on average 18.41176470588235) internal successors, (313), 17 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:41,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:41,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-03-04 09:43:41,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:43,628 INFO L124 PetriNetUnfolderBase]: 10387/20861 cut-off events. [2025-03-04 09:43:43,629 INFO L125 PetriNetUnfolderBase]: For 25769/25777 co-relation queries the response was YES. [2025-03-04 09:43:43,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62314 conditions, 20861 events. 10387/20861 cut-off events. For 25769/25777 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 160036 event pairs, 1566 based on Foata normal form. 225/20393 useless extension candidates. Maximal degree in co-relation 48235. Up to 3457 conditions per place. [2025-03-04 09:43:43,824 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 333 selfloop transitions, 57 changer transitions 0/400 dead transitions. [2025-03-04 09:43:43,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 400 transitions, 2862 flow [2025-03-04 09:43:43,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 09:43:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 09:43:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 590 transitions. [2025-03-04 09:43:43,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2025-03-04 09:43:43,826 INFO L175 Difference]: Start difference. First operand has 100 places, 84 transitions, 519 flow. Second operand 20 states and 590 transitions. [2025-03-04 09:43:43,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 400 transitions, 2862 flow [2025-03-04 09:43:43,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 400 transitions, 2807 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-03-04 09:43:43,913 INFO L231 Difference]: Finished difference. Result has 129 places, 127 transitions, 1025 flow [2025-03-04 09:43:43,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1025, PETRI_PLACES=129, PETRI_TRANSITIONS=127} [2025-03-04 09:43:43,914 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 80 predicate places. [2025-03-04 09:43:43,914 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 127 transitions, 1025 flow [2025-03-04 09:43:43,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.41176470588235) internal successors, (313), 17 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:43,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:43,914 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:43,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:43:44,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 09:43:44,115 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:44,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:44,115 INFO L85 PathProgramCache]: Analyzing trace with hash 801882479, now seen corresponding path program 1 times [2025-03-04 09:43:44,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:44,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193721522] [2025-03-04 09:43:44,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:44,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:44,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 09:43:44,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 09:43:44,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:44,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:44,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:44,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193721522] [2025-03-04 09:43:44,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193721522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:44,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363304900] [2025-03-04 09:43:44,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:44,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:44,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:44,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:44,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:43:44,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 09:43:45,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 09:43:45,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:45,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:45,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 1842 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 09:43:45,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:45,236 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 25 treesize of output 1 [2025-03-04 09:43:45,345 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 80 treesize of output 32 [2025-03-04 09:43:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:43:45,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:43:45,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363304900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:45,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 09:43:45,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2025-03-04 09:43:45,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454107366] [2025-03-04 09:43:45,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:45,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:43:45,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:45,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:43:45,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-03-04 09:43:45,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:45,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 127 transitions, 1025 flow. Second operand has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:45,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:45,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:45,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:49,094 INFO L124 PetriNetUnfolderBase]: 14547/29206 cut-off events. [2025-03-04 09:43:49,094 INFO L125 PetriNetUnfolderBase]: For 52837/52837 co-relation queries the response was YES. [2025-03-04 09:43:49,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94055 conditions, 29206 events. 14547/29206 cut-off events. For 52837/52837 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 241481 event pairs, 2010 based on Foata normal form. 0/28357 useless extension candidates. Maximal degree in co-relation 87540. Up to 5948 conditions per place. [2025-03-04 09:43:49,446 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 164 selfloop transitions, 140 changer transitions 0/316 dead transitions. [2025-03-04 09:43:49,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 316 transitions, 2799 flow [2025-03-04 09:43:49,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 09:43:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 09:43:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 420 transitions. [2025-03-04 09:43:49,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45751633986928103 [2025-03-04 09:43:49,448 INFO L175 Difference]: Start difference. First operand has 129 places, 127 transitions, 1025 flow. Second operand 17 states and 420 transitions. [2025-03-04 09:43:49,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 316 transitions, 2799 flow [2025-03-04 09:43:49,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 316 transitions, 2642 flow, removed 72 selfloop flow, removed 3 redundant places. [2025-03-04 09:43:49,728 INFO L231 Difference]: Finished difference. Result has 146 places, 193 transitions, 1907 flow [2025-03-04 09:43:49,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1907, PETRI_PLACES=146, PETRI_TRANSITIONS=193} [2025-03-04 09:43:49,729 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 97 predicate places. [2025-03-04 09:43:49,729 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 193 transitions, 1907 flow [2025-03-04 09:43:49,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:49,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:49,729 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, 1, 1, 1] [2025-03-04 09:43:49,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 09:43:49,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:49,929 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:49,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:49,930 INFO L85 PathProgramCache]: Analyzing trace with hash 839360749, now seen corresponding path program 2 times [2025-03-04 09:43:49,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:49,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144381839] [2025-03-04 09:43:49,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:43:49,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:49,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 09:43:49,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 34 statements. [2025-03-04 09:43:49,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:43:49,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 09:43:50,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:50,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144381839] [2025-03-04 09:43:50,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144381839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:50,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:50,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:43:50,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424590494] [2025-03-04 09:43:50,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:50,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:43:50,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:50,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:43:50,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:43:50,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:50,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 193 transitions, 1907 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:50,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:50,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:50,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand