./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/bench-exp2x6.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/bench-exp2x6.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:00:27,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:00:27,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:00:27,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:00:27,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:00:27,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:00:27,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:00:27,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:00:27,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:00:27,161 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:00:27,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:00:27,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:00:27,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:00:27,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:00:27,161 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:00:27,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:00:27,162 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:00:27,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:00:27,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:00:27,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:00:27,162 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:00:27,162 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:00:27,162 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:00:27,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:00:27,163 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:00:27,163 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:00:27,163 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:00:27,163 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:00:27,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:00:27,163 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:00:27,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:27,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:27,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:27,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:27,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:00:27,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:27,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:27,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:27,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:27,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:00:27,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:00:27,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:00:27,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:00:27,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:00:27,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:00:27,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:00:27,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:00:27,165 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 [2025-01-10 01:00:27,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:00:27,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:00:27,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:00:27,351 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:00:27,352 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:00:27,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2025-01-10 01:00:28,621 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d465f515b/9a60d26acd68487ea4bc62cf608c5112/FLAG574622df2 [2025-01-10 01:00:28,841 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:00:28,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2025-01-10 01:00:28,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d465f515b/9a60d26acd68487ea4bc62cf608c5112/FLAG574622df2 [2025-01-10 01:00:28,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d465f515b/9a60d26acd68487ea4bc62cf608c5112 [2025-01-10 01:00:28,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:00:28,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:00:28,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:28,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:00:28,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:00:28,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:28" (1/1) ... [2025-01-10 01:00:28,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6842e985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:28, skipping insertion in model container [2025-01-10 01:00:28,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:28" (1/1) ... [2025-01-10 01:00:28,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:00:29,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:29,019 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:00:29,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:29,054 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:00:29,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:29 WrapperNode [2025-01-10 01:00:29,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:29,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:00:29,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:00:29,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:00:29,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:29" (1/1) ... [2025-01-10 01:00:29,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:29" (1/1) ... [2025-01-10 01:00:29,092 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2025-01-10 01:00:29,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:00:29,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:00:29,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:00:29,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:00:29,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:29" (1/1) ... [2025-01-10 01:00:29,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:29" (1/1) ... [2025-01-10 01:00:29,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:29" (1/1) ... [2025-01-10 01:00:29,117 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:00:29,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:29" (1/1) ... [2025-01-10 01:00:29,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:29" (1/1) ... [2025-01-10 01:00:29,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:29" (1/1) ... [2025-01-10 01:00:29,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:29" (1/1) ... [2025-01-10 01:00:29,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:29" (1/1) ... [2025-01-10 01:00:29,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:29" (1/1) ... [2025-01-10 01:00:29,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:29" (1/1) ... [2025-01-10 01:00:29,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:00:29,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:00:29,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:00:29,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:00:29,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:29" (1/1) ... [2025-01-10 01:00:29,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:29,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:29,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:00:29,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:00:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:00:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:00:29,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:00:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:00:29,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:00:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:00:29,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:00:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 01:00:29,184 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 01:00:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:00:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:00:29,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:00:29,185 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:00:29,257 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:00:29,258 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:00:29,468 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:00:29,468 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:00:29,643 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:00:29,643 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:00:29,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:29 BoogieIcfgContainer [2025-01-10 01:00:29,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:00:29,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:00:29,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:00:29,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:00:29,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:00:28" (1/3) ... [2025-01-10 01:00:29,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbebcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:29, skipping insertion in model container [2025-01-10 01:00:29,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:29" (2/3) ... [2025-01-10 01:00:29,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbebcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:29, skipping insertion in model container [2025-01-10 01:00:29,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:29" (3/3) ... [2025-01-10 01:00:29,656 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2025-01-10 01:00:29,677 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:00:29,678 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x6.wvr.c that has 5 procedures, 31 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-01-10 01:00:29,678 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:00:29,728 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 01:00:29,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 96 flow [2025-01-10 01:00:29,822 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-01-10 01:00:29,829 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:00:29,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 30 events. 4/30 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-01-10 01:00:29,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 34 transitions, 96 flow [2025-01-10 01:00:29,836 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 29 transitions, 82 flow [2025-01-10 01:00:29,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:00:29,869 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;@76ad076e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:00:29,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:00:29,886 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:00:29,889 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-01-10 01:00:29,889 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:00:29,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:29,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:29,890 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:00:29,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:29,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1887205856, now seen corresponding path program 1 times [2025-01-10 01:00:29,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:29,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327379664] [2025-01-10 01:00:29,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:29,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:29,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:00:29,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:00:29,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:29,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327379664] [2025-01-10 01:00:30,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327379664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:30,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:30,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:00:30,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737240259] [2025-01-10 01:00:30,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:30,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:00:30,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:30,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:00:30,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:00:30,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:30,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:30,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:30,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:30,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:30,556 INFO L124 PetriNetUnfolderBase]: 1367/1732 cut-off events. [2025-01-10 01:00:30,556 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-01-10 01:00:30,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 1732 events. 1367/1732 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5608 event pairs, 123 based on Foata normal form. 2/999 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2025-01-10 01:00:30,577 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 35 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2025-01-10 01:00:30,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 219 flow [2025-01-10 01:00:30,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:00:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:00:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-01-10 01:00:30,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2025-01-10 01:00:30,594 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 82 flow. Second operand 3 states and 73 transitions. [2025-01-10 01:00:30,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 219 flow [2025-01-10 01:00:30,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 01:00:30,604 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 95 flow [2025-01-10 01:00:30,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2025-01-10 01:00:30,608 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -7 predicate places. [2025-01-10 01:00:30,608 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 95 flow [2025-01-10 01:00:30,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:30,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:30,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:30,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:00:30,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:00:30,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:30,609 INFO L85 PathProgramCache]: Analyzing trace with hash 95072072, now seen corresponding path program 1 times [2025-01-10 01:00:30,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:30,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505011314] [2025-01-10 01:00:30,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:30,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:30,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:00:30,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:30,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:30,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:30,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:30,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505011314] [2025-01-10 01:00:30,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505011314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:30,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:30,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:30,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053939416] [2025-01-10 01:00:30,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:30,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:30,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:30,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:30,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:30,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:30,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-01-10 01:00:30,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:30,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:30,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:30,951 INFO L124 PetriNetUnfolderBase]: 1560/2017 cut-off events. [2025-01-10 01:00:30,952 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2025-01-10 01:00:30,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4998 conditions, 2017 events. 1560/2017 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6912 event pairs, 87 based on Foata normal form. 31/2026 useless extension candidates. Maximal degree in co-relation 1792. Up to 827 conditions per place. [2025-01-10 01:00:30,964 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 58 selfloop transitions, 10 changer transitions 0/73 dead transitions. [2025-01-10 01:00:30,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 73 transitions, 357 flow [2025-01-10 01:00:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:30,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2025-01-10 01:00:30,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2025-01-10 01:00:30,966 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 95 flow. Second operand 5 states and 112 transitions. [2025-01-10 01:00:30,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 73 transitions, 357 flow [2025-01-10 01:00:30,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 73 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:30,968 INFO L231 Difference]: Finished difference. Result has 36 places, 38 transitions, 155 flow [2025-01-10 01:00:30,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=36, PETRI_TRANSITIONS=38} [2025-01-10 01:00:30,969 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-01-10 01:00:30,969 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 38 transitions, 155 flow [2025-01-10 01:00:30,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-01-10 01:00:30,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:30,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:30,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:00:30,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:00:30,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:30,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1729167923, now seen corresponding path program 1 times [2025-01-10 01:00:30,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:30,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165268924] [2025-01-10 01:00:30,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:30,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:00:30,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:30,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:30,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:31,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:31,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165268924] [2025-01-10 01:00:31,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165268924] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:31,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200994969] [2025-01-10 01:00:31,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:31,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:31,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:31,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:31,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:00:31,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:00:31,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:31,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:31,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:31,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:00:31,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:31,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:31,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200994969] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:31,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:31,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:00:31,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926031125] [2025-01-10 01:00:31,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:31,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:00:31,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:31,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:00:31,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:00:31,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:31,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 38 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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-01-10 01:00:31,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:31,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:31,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:31,821 INFO L124 PetriNetUnfolderBase]: 1958/2597 cut-off events. [2025-01-10 01:00:31,821 INFO L125 PetriNetUnfolderBase]: For 2755/2755 co-relation queries the response was YES. [2025-01-10 01:00:31,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8095 conditions, 2597 events. 1958/2597 cut-off events. For 2755/2755 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 10552 event pairs, 301 based on Foata normal form. 80/2669 useless extension candidates. Maximal degree in co-relation 3502. Up to 1295 conditions per place. [2025-01-10 01:00:31,838 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 89 selfloop transitions, 8 changer transitions 0/102 dead transitions. [2025-01-10 01:00:31,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 102 transitions, 615 flow [2025-01-10 01:00:31,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-01-10 01:00:31,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7235294117647059 [2025-01-10 01:00:31,843 INFO L175 Difference]: Start difference. First operand has 36 places, 38 transitions, 155 flow. Second operand 5 states and 123 transitions. [2025-01-10 01:00:31,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 102 transitions, 615 flow [2025-01-10 01:00:31,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 102 transitions, 615 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:00:31,850 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 210 flow [2025-01-10 01:00:31,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2025-01-10 01:00:31,851 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2025-01-10 01:00:31,851 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 210 flow [2025-01-10 01:00:31,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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-01-10 01:00:31,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:31,852 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:31,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:00:32,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:32,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:00:32,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:32,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1013334845, now seen corresponding path program 2 times [2025-01-10 01:00:32,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:32,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915315800] [2025-01-10 01:00:32,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:32,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:32,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:00:32,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:32,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:32,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:32,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:32,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915315800] [2025-01-10 01:00:32,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915315800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:32,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:32,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:32,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252283608] [2025-01-10 01:00:32,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:32,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:32,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:32,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:32,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:32,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:32,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-01-10 01:00:32,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:32,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:32,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:32,397 INFO L124 PetriNetUnfolderBase]: 1712/2238 cut-off events. [2025-01-10 01:00:32,397 INFO L125 PetriNetUnfolderBase]: For 3654/3654 co-relation queries the response was YES. [2025-01-10 01:00:32,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8302 conditions, 2238 events. 1712/2238 cut-off events. For 3654/3654 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 8382 event pairs, 127 based on Foata normal form. 34/2270 useless extension candidates. Maximal degree in co-relation 4004. Up to 939 conditions per place. [2025-01-10 01:00:32,412 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 88 selfloop transitions, 11 changer transitions 0/104 dead transitions. [2025-01-10 01:00:32,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 104 transitions, 683 flow [2025-01-10 01:00:32,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-01-10 01:00:32,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2025-01-10 01:00:32,413 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 210 flow. Second operand 5 states and 120 transitions. [2025-01-10 01:00:32,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 104 transitions, 683 flow [2025-01-10 01:00:32,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 104 transitions, 683 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:00:32,420 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 271 flow [2025-01-10 01:00:32,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2025-01-10 01:00:32,420 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2025-01-10 01:00:32,420 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 271 flow [2025-01-10 01:00:32,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-01-10 01:00:32,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:32,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:32,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:00:32,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:00:32,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:32,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1323193859, now seen corresponding path program 1 times [2025-01-10 01:00:32,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:32,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147867730] [2025-01-10 01:00:32,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:32,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:32,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:00:32,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:32,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:32,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:32,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:32,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147867730] [2025-01-10 01:00:32,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147867730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:32,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:32,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:32,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885388720] [2025-01-10 01:00:32,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:32,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:32,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:32,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:32,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:32,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:32,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-01-10 01:00:32,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:32,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:32,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:32,754 INFO L124 PetriNetUnfolderBase]: 1666/2192 cut-off events. [2025-01-10 01:00:32,754 INFO L125 PetriNetUnfolderBase]: For 4899/4899 co-relation queries the response was YES. [2025-01-10 01:00:32,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8713 conditions, 2192 events. 1666/2192 cut-off events. For 4899/4899 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 8450 event pairs, 105 based on Foata normal form. 46/2236 useless extension candidates. Maximal degree in co-relation 4061. Up to 973 conditions per place. [2025-01-10 01:00:32,766 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 86 selfloop transitions, 8 changer transitions 2/101 dead transitions. [2025-01-10 01:00:32,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 101 transitions, 692 flow [2025-01-10 01:00:32,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-01-10 01:00:32,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6941176470588235 [2025-01-10 01:00:32,767 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 271 flow. Second operand 5 states and 118 transitions. [2025-01-10 01:00:32,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 101 transitions, 692 flow [2025-01-10 01:00:32,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 101 transitions, 681 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:32,773 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 274 flow [2025-01-10 01:00:32,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2025-01-10 01:00:32,775 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2025-01-10 01:00:32,775 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 274 flow [2025-01-10 01:00:32,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-01-10 01:00:32,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:32,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:32,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:00:32,776 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:00:32,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:32,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1400682097, now seen corresponding path program 1 times [2025-01-10 01:00:32,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:32,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121463183] [2025-01-10 01:00:32,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:32,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:32,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:00:32,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:32,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:32,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:32,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:32,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121463183] [2025-01-10 01:00:32,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121463183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:32,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:32,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:32,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103905643] [2025-01-10 01:00:32,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:32,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:32,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:32,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:32,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:32,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:32,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-01-10 01:00:32,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:32,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:32,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:33,033 INFO L124 PetriNetUnfolderBase]: 1641/2186 cut-off events. [2025-01-10 01:00:33,034 INFO L125 PetriNetUnfolderBase]: For 5625/5629 co-relation queries the response was YES. [2025-01-10 01:00:33,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8921 conditions, 2186 events. 1641/2186 cut-off events. For 5625/5629 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 8098 event pairs, 71 based on Foata normal form. 34/2200 useless extension candidates. Maximal degree in co-relation 4980. Up to 983 conditions per place. [2025-01-10 01:00:33,048 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 85 selfloop transitions, 8 changer transitions 4/102 dead transitions. [2025-01-10 01:00:33,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 102 transitions, 810 flow [2025-01-10 01:00:33,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-01-10 01:00:33,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2025-01-10 01:00:33,049 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 274 flow. Second operand 5 states and 110 transitions. [2025-01-10 01:00:33,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 102 transitions, 810 flow [2025-01-10 01:00:33,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 102 transitions, 777 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:33,054 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 277 flow [2025-01-10 01:00:33,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2025-01-10 01:00:33,056 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2025-01-10 01:00:33,056 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 277 flow [2025-01-10 01:00:33,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-01-10 01:00:33,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:33,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:33,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:00:33,057 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:00:33,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:33,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1401687036, now seen corresponding path program 2 times [2025-01-10 01:00:33,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:33,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181466121] [2025-01-10 01:00:33,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:33,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:33,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:00:33,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:33,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:33,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:33,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:33,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181466121] [2025-01-10 01:00:33,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181466121] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:33,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226669371] [2025-01-10 01:00:33,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:33,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:33,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:33,135 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:33,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:00:33,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:00:33,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:33,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:33,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:33,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:00:33,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:33,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:33,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226669371] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:33,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:33,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:00:33,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744082266] [2025-01-10 01:00:33,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:33,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:00:33,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:33,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:00:33,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:00:33,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:33,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:33,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:33,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:33,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:33,646 INFO L124 PetriNetUnfolderBase]: 1577/2134 cut-off events. [2025-01-10 01:00:33,646 INFO L125 PetriNetUnfolderBase]: For 5613/5617 co-relation queries the response was YES. [2025-01-10 01:00:33,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8978 conditions, 2134 events. 1577/2134 cut-off events. For 5613/5617 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8535 event pairs, 287 based on Foata normal form. 65/2179 useless extension candidates. Maximal degree in co-relation 5652. Up to 968 conditions per place. [2025-01-10 01:00:33,658 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2025-01-10 01:00:33,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 104 transitions, 821 flow [2025-01-10 01:00:33,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-01-10 01:00:33,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6529411764705882 [2025-01-10 01:00:33,660 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 277 flow. Second operand 5 states and 111 transitions. [2025-01-10 01:00:33,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 104 transitions, 821 flow [2025-01-10 01:00:33,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 104 transitions, 814 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:33,667 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 320 flow [2025-01-10 01:00:33,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2025-01-10 01:00:33,667 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2025-01-10 01:00:33,667 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 320 flow [2025-01-10 01:00:33,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:33,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:33,667 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:33,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:00:33,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:33,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:00:33,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash 608824033, now seen corresponding path program 2 times [2025-01-10 01:00:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:33,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958763200] [2025-01-10 01:00:33,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:33,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:00:33,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:33,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:33,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:33,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:33,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:33,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958763200] [2025-01-10 01:00:33,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958763200] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:33,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794686118] [2025-01-10 01:00:33,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:33,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:33,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:33,966 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:33,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:00:34,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:00:34,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:34,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:34,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:34,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:00:34,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:34,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:34,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794686118] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:34,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:34,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:00:34,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449846860] [2025-01-10 01:00:34,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:34,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:00:34,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:34,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:00:34,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:00:34,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:34,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:34,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:34,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:34,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:34,392 INFO L124 PetriNetUnfolderBase]: 1515/2072 cut-off events. [2025-01-10 01:00:34,392 INFO L125 PetriNetUnfolderBase]: For 5352/5356 co-relation queries the response was YES. [2025-01-10 01:00:34,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9466 conditions, 2072 events. 1515/2072 cut-off events. For 5352/5356 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8405 event pairs, 258 based on Foata normal form. 63/2115 useless extension candidates. Maximal degree in co-relation 5965. Up to 1124 conditions per place. [2025-01-10 01:00:34,403 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2025-01-10 01:00:34,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 104 transitions, 865 flow [2025-01-10 01:00:34,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-01-10 01:00:34,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2025-01-10 01:00:34,404 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 320 flow. Second operand 5 states and 108 transitions. [2025-01-10 01:00:34,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 104 transitions, 865 flow [2025-01-10 01:00:34,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 856 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:34,410 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 368 flow [2025-01-10 01:00:34,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=368, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2025-01-10 01:00:34,411 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 28 predicate places. [2025-01-10 01:00:34,411 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 368 flow [2025-01-10 01:00:34,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:34,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:34,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:34,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:00:34,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:34,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:00:34,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash 730827875, now seen corresponding path program 2 times [2025-01-10 01:00:34,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:34,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940536261] [2025-01-10 01:00:34,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:34,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:34,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:00:34,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:34,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:34,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:34,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:34,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940536261] [2025-01-10 01:00:34,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940536261] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:34,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561507911] [2025-01-10 01:00:34,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:34,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:34,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:34,685 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:34,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:00:34,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:00:34,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:34,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:34,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:34,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:00:34,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:34,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:34,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561507911] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:34,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:34,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:00:34,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772718651] [2025-01-10 01:00:34,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:34,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:00:34,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:34,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:00:34,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:00:34,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:34,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:34,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:34,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:34,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:35,041 INFO L124 PetriNetUnfolderBase]: 1447/1987 cut-off events. [2025-01-10 01:00:35,042 INFO L125 PetriNetUnfolderBase]: For 6694/6694 co-relation queries the response was YES. [2025-01-10 01:00:35,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9691 conditions, 1987 events. 1447/1987 cut-off events. For 6694/6694 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8173 event pairs, 375 based on Foata normal form. 68/2047 useless extension candidates. Maximal degree in co-relation 8529. Up to 1150 conditions per place. [2025-01-10 01:00:35,053 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 111 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2025-01-10 01:00:35,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 124 transitions, 1132 flow [2025-01-10 01:00:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-01-10 01:00:35,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6823529411764706 [2025-01-10 01:00:35,054 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 368 flow. Second operand 5 states and 116 transitions. [2025-01-10 01:00:35,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 124 transitions, 1132 flow [2025-01-10 01:00:35,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 124 transitions, 1091 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:35,063 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 406 flow [2025-01-10 01:00:35,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2025-01-10 01:00:35,063 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2025-01-10 01:00:35,063 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 406 flow [2025-01-10 01:00:35,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:00:35,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:35,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:35,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:00:35,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-10 01:00:35,268 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:00:35,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2035607727, now seen corresponding path program 1 times [2025-01-10 01:00:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:35,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801931812] [2025-01-10 01:00:35,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:35,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:35,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:00:35,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:00:35,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:35,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:35,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:35,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801931812] [2025-01-10 01:00:35,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801931812] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:35,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005862480] [2025-01-10 01:00:35,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:35,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:35,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:35,713 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:00:35,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:00:35,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:00:35,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:00:35,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:35,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:35,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:00:35,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:05,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:10,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005862480] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:10,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:10,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-01-10 01:01:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773026037] [2025-01-10 01:01:10,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:10,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:01:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:10,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:01:10,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=168, Unknown=4, NotChecked=0, Total=240 [2025-01-10 01:01:10,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:01:10,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 406 flow. Second operand has 16 states, 16 states have (on average 13.5) internal successors, (216), 16 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:10,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:10,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:01:10,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:17,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:01:19,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:01:22,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:01:23,115 INFO L124 PetriNetUnfolderBase]: 2703/3713 cut-off events. [2025-01-10 01:01:23,115 INFO L125 PetriNetUnfolderBase]: For 12691/12691 co-relation queries the response was YES. [2025-01-10 01:01:23,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19363 conditions, 3713 events. 2703/3713 cut-off events. For 12691/12691 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 16536 event pairs, 269 based on Foata normal form. 15/3720 useless extension candidates. Maximal degree in co-relation 17309. Up to 2092 conditions per place. [2025-01-10 01:01:23,134 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 179 selfloop transitions, 100 changer transitions 20/304 dead transitions. [2025-01-10 01:01:23,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 304 transitions, 2749 flow [2025-01-10 01:01:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:01:23,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:01:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 361 transitions. [2025-01-10 01:01:23,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6636029411764706 [2025-01-10 01:01:23,136 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 406 flow. Second operand 16 states and 361 transitions. [2025-01-10 01:01:23,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 304 transitions, 2749 flow [2025-01-10 01:01:23,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 304 transitions, 2619 flow, removed 40 selfloop flow, removed 2 redundant places. [2025-01-10 01:01:23,150 INFO L231 Difference]: Finished difference. Result has 94 places, 153 transitions, 1616 flow [2025-01-10 01:01:23,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1616, PETRI_PLACES=94, PETRI_TRANSITIONS=153} [2025-01-10 01:01:23,151 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 56 predicate places. [2025-01-10 01:01:23,151 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 153 transitions, 1616 flow [2025-01-10 01:01:23,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 13.5) internal successors, (216), 16 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:23,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:23,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:23,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:01:23,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 01:01:23,352 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:01:23,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:23,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1633686397, now seen corresponding path program 2 times [2025-01-10 01:01:23,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:23,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700607121] [2025-01-10 01:01:23,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:23,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:23,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:01:23,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:01:23,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:01:23,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:23,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:23,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700607121] [2025-01-10 01:01:23,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700607121] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:23,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930390953] [2025-01-10 01:01:23,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:23,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:23,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:23,570 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:01:23,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:01:23,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:01:23,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:01:23,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:01:23,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:23,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:01:23,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:56,666 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)