./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:45:07,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:45:07,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:45:07,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:45:07,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:45:07,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:45:07,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:45:07,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:45:07,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:45:07,319 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:45:07,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:45:07,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:45:07,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:45:07,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:45:07,321 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:45:07,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:45:07,321 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:45:07,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:45:07,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:45:07,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:45:07,321 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:45:07,322 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:45:07,322 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:45:07,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:45:07,322 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:45:07,322 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:45:07,322 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:45:07,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:45:07,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:45:07,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:45:07,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:45:07,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:45:07,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:45:07,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:45:07,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:45:07,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:45:07,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:45:07,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:45:07,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:45:07,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:45:07,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:45:07,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:45:07,324 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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 [2025-02-08 08:45:07,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:45:07,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:45:07,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:45:07,582 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:45:07,582 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:45:07,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2025-02-08 08:45:08,782 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e426912d7/f20e011856e841e8a5cb23c373eabef2/FLAGbe5ae1efd [2025-02-08 08:45:09,031 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:45:09,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2025-02-08 08:45:09,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e426912d7/f20e011856e841e8a5cb23c373eabef2/FLAGbe5ae1efd [2025-02-08 08:45:09,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e426912d7/f20e011856e841e8a5cb23c373eabef2 [2025-02-08 08:45:09,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:45:09,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:45:09,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:45:09,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:45:09,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:45:09,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:45:09" (1/1) ... [2025-02-08 08:45:09,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be505d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:09, skipping insertion in model container [2025-02-08 08:45:09,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:45:09" (1/1) ... [2025-02-08 08:45:09,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:45:09,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:45:09,351 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:45:09,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:45:09,430 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:45:09,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:09 WrapperNode [2025-02-08 08:45:09,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:45:09,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:45:09,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:45:09,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:45:09,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:09" (1/1) ... [2025-02-08 08:45:09,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:09" (1/1) ... [2025-02-08 08:45:09,483 INFO L138 Inliner]: procedures = 243, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 262 [2025-02-08 08:45:09,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:45:09,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:45:09,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:45:09,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:45:09,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:09" (1/1) ... [2025-02-08 08:45:09,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:09" (1/1) ... [2025-02-08 08:45:09,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:09" (1/1) ... [2025-02-08 08:45:09,521 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2025-02-08 08:45:09,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:09" (1/1) ... [2025-02-08 08:45:09,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:09" (1/1) ... [2025-02-08 08:45:09,527 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:09" (1/1) ... [2025-02-08 08:45:09,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:09" (1/1) ... [2025-02-08 08:45:09,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:09" (1/1) ... [2025-02-08 08:45:09,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:09" (1/1) ... [2025-02-08 08:45:09,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:45:09,537 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:45:09,538 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:45:09,538 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:45:09,539 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:09" (1/1) ... [2025-02-08 08:45:09,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:45:09,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:09,566 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-02-08 08:45:09,568 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-02-08 08:45:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 08:45:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 08:45:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 08:45:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:45:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:45:09,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:45:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:45:09,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:45:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:45:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:45:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:45:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:45:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:45:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:45:09,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:45:09,587 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:45:09,696 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:45:09,697 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:45:09,960 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:45:09,961 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:45:10,469 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:45:10,470 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:45:10,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:10 BoogieIcfgContainer [2025-02-08 08:45:10,470 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:45:10,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:45:10,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:45:10,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:45:10,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:45:09" (1/3) ... [2025-02-08 08:45:10,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be3bcc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:45:10, skipping insertion in model container [2025-02-08 08:45:10,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:09" (2/3) ... [2025-02-08 08:45:10,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be3bcc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:45:10, skipping insertion in model container [2025-02-08 08:45:10,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:10" (3/3) ... [2025-02-08 08:45:10,476 INFO L128 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2025-02-08 08:45:10,491 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:45:10,493 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG arithmetic_prog_bad.i that has 3 procedures, 37 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-02-08 08:45:10,493 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:45:10,539 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:45:10,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 43 transitions, 100 flow [2025-02-08 08:45:10,629 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2025-02-08 08:45:10,632 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:45:10,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 7/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2025-02-08 08:45:10,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 43 transitions, 100 flow [2025-02-08 08:45:10,643 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 40 transitions, 92 flow [2025-02-08 08:45:10,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:45:10,665 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;@15a7d1c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:45:10,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 08:45:10,704 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:45:10,705 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2025-02-08 08:45:10,705 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:45:10,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:10,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:10,706 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:10,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:10,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1003649640, now seen corresponding path program 1 times [2025-02-08 08:45:10,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:10,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483712505] [2025-02-08 08:45:10,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:10,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:11,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:45:11,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:45:11,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:11,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:11,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:11,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483712505] [2025-02-08 08:45:11,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483712505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:11,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:11,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:11,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101774808] [2025-02-08 08:45:11,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:11,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:11,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:11,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:11,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:11,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-02-08 08:45:11,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:11,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:11,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-02-08 08:45:11,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:11,573 INFO L124 PetriNetUnfolderBase]: 430/787 cut-off events. [2025-02-08 08:45:11,573 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 08:45:11,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1490 conditions, 787 events. 430/787 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3695 event pairs, 169 based on Foata normal form. 20/793 useless extension candidates. Maximal degree in co-relation 1424. Up to 400 conditions per place. [2025-02-08 08:45:11,582 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 39 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-02-08 08:45:11,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 205 flow [2025-02-08 08:45:11,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:11,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-02-08 08:45:11,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2025-02-08 08:45:11,594 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 92 flow. Second operand 3 states and 89 transitions. [2025-02-08 08:45:11,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 205 flow [2025-02-08 08:45:11,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 195 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:45:11,602 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 90 flow [2025-02-08 08:45:11,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2025-02-08 08:45:11,609 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-02-08 08:45:11,609 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 90 flow [2025-02-08 08:45:11,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:11,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:11,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:11,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:45:11,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:11,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:11,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1644456246, now seen corresponding path program 1 times [2025-02-08 08:45:11,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:11,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511136463] [2025-02-08 08:45:11,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:11,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:11,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:45:11,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:45:11,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:11,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:45:11,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:11,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511136463] [2025-02-08 08:45:11,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511136463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:11,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:11,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:11,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242045437] [2025-02-08 08:45:11,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:11,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:11,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:11,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:11,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:11,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-02-08 08:45:11,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-02-08 08:45:11,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:11,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-02-08 08:45:11,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:12,095 INFO L124 PetriNetUnfolderBase]: 731/1321 cut-off events. [2025-02-08 08:45:12,095 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2025-02-08 08:45:12,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 1321 events. 731/1321 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6718 event pairs, 294 based on Foata normal form. 29/1333 useless extension candidates. Maximal degree in co-relation 946. Up to 681 conditions per place. [2025-02-08 08:45:12,106 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 40 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-02-08 08:45:12,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 219 flow [2025-02-08 08:45:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-02-08 08:45:12,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-08 08:45:12,109 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 90 flow. Second operand 3 states and 86 transitions. [2025-02-08 08:45:12,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 219 flow [2025-02-08 08:45:12,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:12,111 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 100 flow [2025-02-08 08:45:12,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2025-02-08 08:45:12,112 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2025-02-08 08:45:12,112 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 100 flow [2025-02-08 08:45:12,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-02-08 08:45:12,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:12,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:12,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:45:12,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:12,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:12,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2032421898, now seen corresponding path program 1 times [2025-02-08 08:45:12,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:12,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58917574] [2025-02-08 08:45:12,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:12,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:12,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:45:12,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:45:12,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:12,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:12,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:12,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58917574] [2025-02-08 08:45:12,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58917574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:12,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:12,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:12,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419939974] [2025-02-08 08:45:12,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:12,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:12,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:12,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:12,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-02-08 08:45:12,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:12,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:12,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-02-08 08:45:12,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:12,565 INFO L124 PetriNetUnfolderBase]: 428/905 cut-off events. [2025-02-08 08:45:12,566 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2025-02-08 08:45:12,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 905 events. 428/905 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4348 event pairs, 182 based on Foata normal form. 64/967 useless extension candidates. Maximal degree in co-relation 610. Up to 373 conditions per place. [2025-02-08 08:45:12,569 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 30 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2025-02-08 08:45:12,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 220 flow [2025-02-08 08:45:12,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-02-08 08:45:12,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-02-08 08:45:12,570 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 100 flow. Second operand 3 states and 83 transitions. [2025-02-08 08:45:12,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 220 flow [2025-02-08 08:45:12,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:12,573 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 114 flow [2025-02-08 08:45:12,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2025-02-08 08:45:12,573 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2025-02-08 08:45:12,573 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 114 flow [2025-02-08 08:45:12,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:12,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:12,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:12,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:45:12,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:12,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:12,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2010261132, now seen corresponding path program 2 times [2025-02-08 08:45:12,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:12,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691255580] [2025-02-08 08:45:12,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:45:12,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:12,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:45:12,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:45:12,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:45:12,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:12,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:12,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691255580] [2025-02-08 08:45:12,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691255580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:12,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:12,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:45:12,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663597769] [2025-02-08 08:45:12,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:12,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:12,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:12,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:12,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:12,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-02-08 08:45:12,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:12,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:12,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-02-08 08:45:12,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:13,152 INFO L124 PetriNetUnfolderBase]: 627/1306 cut-off events. [2025-02-08 08:45:13,153 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2025-02-08 08:45:13,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 1306 events. 627/1306 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6838 event pairs, 183 based on Foata normal form. 30/1316 useless extension candidates. Maximal degree in co-relation 762. Up to 480 conditions per place. [2025-02-08 08:45:13,162 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 58 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-02-08 08:45:13,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 74 transitions, 358 flow [2025-02-08 08:45:13,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-02-08 08:45:13,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6918604651162791 [2025-02-08 08:45:13,165 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 114 flow. Second operand 4 states and 119 transitions. [2025-02-08 08:45:13,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 74 transitions, 358 flow [2025-02-08 08:45:13,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 74 transitions, 334 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:13,170 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 122 flow [2025-02-08 08:45:13,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2025-02-08 08:45:13,171 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2025-02-08 08:45:13,172 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 122 flow [2025-02-08 08:45:13,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:13,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:13,172 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:13,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:45:13,173 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:13,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:13,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1915013082, now seen corresponding path program 3 times [2025-02-08 08:45:13,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:13,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356957407] [2025-02-08 08:45:13,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:45:13,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:13,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-02-08 08:45:13,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 32 statements. [2025-02-08 08:45:13,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:45:13,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 08:45:13,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:13,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356957407] [2025-02-08 08:45:13,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356957407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:13,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:13,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:45:13,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087945386] [2025-02-08 08:45:13,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:13,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:13,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:13,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:13,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:13,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-02-08 08:45:13,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:13,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:13,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-02-08 08:45:13,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:13,624 INFO L124 PetriNetUnfolderBase]: 849/1796 cut-off events. [2025-02-08 08:45:13,624 INFO L125 PetriNetUnfolderBase]: For 834/834 co-relation queries the response was YES. [2025-02-08 08:45:13,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4138 conditions, 1796 events. 849/1796 cut-off events. For 834/834 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 9912 event pairs, 258 based on Foata normal form. 41/1814 useless extension candidates. Maximal degree in co-relation 1304. Up to 667 conditions per place. [2025-02-08 08:45:13,635 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 59 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-02-08 08:45:13,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 75 transitions, 380 flow [2025-02-08 08:45:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-02-08 08:45:13,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6802325581395349 [2025-02-08 08:45:13,636 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 122 flow. Second operand 4 states and 117 transitions. [2025-02-08 08:45:13,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 75 transitions, 380 flow [2025-02-08 08:45:13,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 75 transitions, 362 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:13,639 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 132 flow [2025-02-08 08:45:13,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-02-08 08:45:13,639 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-02-08 08:45:13,639 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 132 flow [2025-02-08 08:45:13,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:13,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:13,640 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:13,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:45:13,640 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:13,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:13,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1287642824, now seen corresponding path program 4 times [2025-02-08 08:45:13,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:13,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053464932] [2025-02-08 08:45:13,641 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:45:13,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:13,781 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-02-08 08:45:13,784 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 38 statements. [2025-02-08 08:45:13,785 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 08:45:13,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 08:45:13,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:13,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053464932] [2025-02-08 08:45:13,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053464932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:13,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:13,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:13,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444669026] [2025-02-08 08:45:13,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:13,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:13,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:13,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:13,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:13,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-02-08 08:45:13,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:13,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:13,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-02-08 08:45:13,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:13,970 INFO L124 PetriNetUnfolderBase]: 870/1810 cut-off events. [2025-02-08 08:45:13,971 INFO L125 PetriNetUnfolderBase]: For 861/861 co-relation queries the response was YES. [2025-02-08 08:45:13,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4311 conditions, 1810 events. 870/1810 cut-off events. For 861/861 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 9858 event pairs, 566 based on Foata normal form. 1/1789 useless extension candidates. Maximal degree in co-relation 1523. Up to 1348 conditions per place. [2025-02-08 08:45:13,979 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 39 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2025-02-08 08:45:13,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 255 flow [2025-02-08 08:45:13,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-02-08 08:45:13,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5968992248062015 [2025-02-08 08:45:13,981 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 132 flow. Second operand 3 states and 77 transitions. [2025-02-08 08:45:13,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 255 flow [2025-02-08 08:45:13,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 249 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:13,983 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 126 flow [2025-02-08 08:45:13,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2025-02-08 08:45:13,983 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-02-08 08:45:13,983 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 126 flow [2025-02-08 08:45:13,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:13,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:13,984 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:13,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:45:13,984 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:13,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash 605938396, now seen corresponding path program 1 times [2025-02-08 08:45:13,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:13,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760448644] [2025-02-08 08:45:13,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:13,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:14,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 08:45:14,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 08:45:14,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:14,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:45:14,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:14,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760448644] [2025-02-08 08:45:14,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760448644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:14,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:14,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:45:14,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111913654] [2025-02-08 08:45:14,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:14,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:14,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:14,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:14,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:14,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-02-08 08:45:14,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:14,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:14,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-02-08 08:45:14,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:14,287 INFO L124 PetriNetUnfolderBase]: 874/1808 cut-off events. [2025-02-08 08:45:14,287 INFO L125 PetriNetUnfolderBase]: For 702/702 co-relation queries the response was YES. [2025-02-08 08:45:14,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4254 conditions, 1808 events. 874/1808 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 9879 event pairs, 626 based on Foata normal form. 1/1778 useless extension candidates. Maximal degree in co-relation 3852. Up to 1470 conditions per place. [2025-02-08 08:45:14,294 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 27 selfloop transitions, 1 changer transitions 2/39 dead transitions. [2025-02-08 08:45:14,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 180 flow [2025-02-08 08:45:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-02-08 08:45:14,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2025-02-08 08:45:14,295 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 126 flow. Second operand 3 states and 67 transitions. [2025-02-08 08:45:14,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 180 flow [2025-02-08 08:45:14,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:14,297 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 121 flow [2025-02-08 08:45:14,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-02-08 08:45:14,298 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-02-08 08:45:14,298 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 121 flow [2025-02-08 08:45:14,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:14,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:14,298 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:14,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:45:14,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:14,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:14,298 INFO L85 PathProgramCache]: Analyzing trace with hash 27523851, now seen corresponding path program 1 times [2025-02-08 08:45:14,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:14,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337132783] [2025-02-08 08:45:14,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:14,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:14,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 08:45:14,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 08:45:14,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:14,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:45:14,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:14,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337132783] [2025-02-08 08:45:14,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337132783] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:45:14,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764797329] [2025-02-08 08:45:14,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:14,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:14,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:14,569 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-02-08 08:45:14,570 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-02-08 08:45:14,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 08:45:14,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 08:45:14,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:14,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:14,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:45:14,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:45:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:45:14,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:45:15,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:45:15,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764797329] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:45:15,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:45:15,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-02-08 08:45:15,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115587358] [2025-02-08 08:45:15,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:45:15,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:45:15,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:15,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:45:15,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:45:15,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-02-08 08:45:15,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:15,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:15,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-02-08 08:45:15,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:15,294 INFO L124 PetriNetUnfolderBase]: 1123/2188 cut-off events. [2025-02-08 08:45:15,295 INFO L125 PetriNetUnfolderBase]: For 807/807 co-relation queries the response was YES. [2025-02-08 08:45:15,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5142 conditions, 2188 events. 1123/2188 cut-off events. For 807/807 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 11522 event pairs, 185 based on Foata normal form. 42/2214 useless extension candidates. Maximal degree in co-relation 5131. Up to 547 conditions per place. [2025-02-08 08:45:15,305 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 76 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2025-02-08 08:45:15,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 89 transitions, 461 flow [2025-02-08 08:45:15,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:45:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:45:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2025-02-08 08:45:15,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6697674418604651 [2025-02-08 08:45:15,306 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 121 flow. Second operand 5 states and 144 transitions. [2025-02-08 08:45:15,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 89 transitions, 461 flow [2025-02-08 08:45:15,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:15,308 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 142 flow [2025-02-08 08:45:15,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2025-02-08 08:45:15,309 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2025-02-08 08:45:15,309 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 142 flow [2025-02-08 08:45:15,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:15,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:15,309 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:15,318 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-02-08 08:45:15,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:15,514 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:15,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:15,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1004656115, now seen corresponding path program 2 times [2025-02-08 08:45:15,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:15,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715693943] [2025-02-08 08:45:15,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:45:15,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:15,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-08 08:45:15,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 08:45:15,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:45:15,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 08:45:15,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:15,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715693943] [2025-02-08 08:45:15,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715693943] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:45:15,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881611922] [2025-02-08 08:45:15,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:45:15,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:15,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:15,845 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-02-08 08:45:15,847 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-02-08 08:45:16,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-08 08:45:16,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 08:45:16,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:45:16,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:16,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:45:16,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:45:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 08:45:16,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:45:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 08:45:16,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881611922] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:45:16,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:45:16,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-02-08 08:45:16,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790262301] [2025-02-08 08:45:16,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:45:16,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:45:16,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:16,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:45:16,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:45:16,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-02-08 08:45:16,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-02-08 08:45:16,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:16,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-02-08 08:45:16,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:16,493 INFO L124 PetriNetUnfolderBase]: 1159/2258 cut-off events. [2025-02-08 08:45:16,493 INFO L125 PetriNetUnfolderBase]: For 1679/1679 co-relation queries the response was YES. [2025-02-08 08:45:16,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5635 conditions, 2258 events. 1159/2258 cut-off events. For 1679/1679 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 12067 event pairs, 165 based on Foata normal form. 43/2287 useless extension candidates. Maximal degree in co-relation 5623. Up to 554 conditions per place. [2025-02-08 08:45:16,504 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 73 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2025-02-08 08:45:16,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 509 flow [2025-02-08 08:45:16,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:45:16,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:45:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2025-02-08 08:45:16,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6558139534883721 [2025-02-08 08:45:16,505 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 142 flow. Second operand 5 states and 141 transitions. [2025-02-08 08:45:16,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 509 flow [2025-02-08 08:45:16,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 477 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:16,509 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 156 flow [2025-02-08 08:45:16,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2025-02-08 08:45:16,510 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2025-02-08 08:45:16,511 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 156 flow [2025-02-08 08:45:16,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-02-08 08:45:16,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:16,511 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:16,518 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-02-08 08:45:16,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:16,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:16,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:16,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1651603669, now seen corresponding path program 3 times [2025-02-08 08:45:16,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:16,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530505310] [2025-02-08 08:45:16,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:45:16,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:16,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 4 equivalence classes. [2025-02-08 08:45:16,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 08:45:16,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 08:45:16,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 08:45:17,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:17,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530505310] [2025-02-08 08:45:17,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530505310] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:45:17,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868102914] [2025-02-08 08:45:17,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:45:17,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:17,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:17,143 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-02-08 08:45:17,145 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-02-08 08:45:17,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 4 equivalence classes. [2025-02-08 08:45:17,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 08:45:17,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 08:45:17,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:17,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:45:17,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:45:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 08:45:17,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:45:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 08:45:17,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868102914] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:45:17,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:45:17,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2025-02-08 08:45:17,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689904401] [2025-02-08 08:45:17,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:45:17,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:45:17,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:17,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:45:17,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:45:17,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-02-08 08:45:17,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:17,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:17,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-02-08 08:45:17,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:17,710 INFO L124 PetriNetUnfolderBase]: 447/985 cut-off events. [2025-02-08 08:45:17,710 INFO L125 PetriNetUnfolderBase]: For 994/996 co-relation queries the response was YES. [2025-02-08 08:45:17,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2660 conditions, 985 events. 447/985 cut-off events. For 994/996 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4047 event pairs, 122 based on Foata normal form. 0/983 useless extension candidates. Maximal degree in co-relation 2646. Up to 436 conditions per place. [2025-02-08 08:45:17,717 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 46 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-02-08 08:45:17,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 348 flow [2025-02-08 08:45:17,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:17,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-02-08 08:45:17,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563953488372093 [2025-02-08 08:45:17,718 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 156 flow. Second operand 4 states and 97 transitions. [2025-02-08 08:45:17,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 348 flow [2025-02-08 08:45:17,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 332 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:17,720 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 163 flow [2025-02-08 08:45:17,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2025-02-08 08:45:17,720 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2025-02-08 08:45:17,720 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 163 flow [2025-02-08 08:45:17,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:17,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:17,720 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:17,727 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-02-08 08:45:17,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:17,925 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:17,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:17,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1390839611, now seen corresponding path program 4 times [2025-02-08 08:45:17,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:17,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466078488] [2025-02-08 08:45:17,925 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:45:17,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:18,098 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-02-08 08:45:18,116 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 08:45:18,116 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:45:18,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:45:18,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:45:18,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 08:45:18,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 08:45:18,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:18,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:45:18,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:45:18,176 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:45:18,177 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2025-02-08 08:45:18,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-02-08 08:45:18,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-02-08 08:45:18,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-02-08 08:45:18,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:45:18,179 INFO L422 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1] [2025-02-08 08:45:18,231 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:45:18,231 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:45:18,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:45:18 BasicIcfg [2025-02-08 08:45:18,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:45:18,235 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:45:18,235 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:45:18,235 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:45:18,236 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:10" (3/4) ... [2025-02-08 08:45:18,237 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:45:18,238 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:45:18,238 INFO L158 Benchmark]: Toolchain (without parser) took 9172.62ms. Allocated memory was 142.6MB in the beginning and 880.8MB in the end (delta: 738.2MB). Free memory was 111.9MB in the beginning and 643.0MB in the end (delta: -531.1MB). Peak memory consumption was 210.9MB. Max. memory is 16.1GB. [2025-02-08 08:45:18,238 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:45:18,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.24ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 84.4MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:45:18,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.04ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 81.8MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:45:18,239 INFO L158 Benchmark]: Boogie Preprocessor took 49.93ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 78.6MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:45:18,239 INFO L158 Benchmark]: IcfgBuilder took 932.92ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 78.6MB in the beginning and 276.5MB in the end (delta: -197.9MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2025-02-08 08:45:18,239 INFO L158 Benchmark]: TraceAbstraction took 7763.18ms. Allocated memory was 402.7MB in the beginning and 880.8MB in the end (delta: 478.2MB). Free memory was 275.6MB in the beginning and 643.1MB in the end (delta: -367.5MB). Peak memory consumption was 109.4MB. Max. memory is 16.1GB. [2025-02-08 08:45:18,239 INFO L158 Benchmark]: Witness Printer took 2.48ms. Allocated memory is still 880.8MB. Free memory was 643.1MB in the beginning and 643.0MB in the end (delta: 117.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:45:18,240 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.24ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 84.4MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.04ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 81.8MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.93ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 78.6MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 932.92ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 78.6MB in the beginning and 276.5MB in the end (delta: -197.9MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7763.18ms. Allocated memory was 402.7MB in the beginning and 880.8MB in the end (delta: 478.2MB). Free memory was 275.6MB in the beginning and 643.1MB in the end (delta: -367.5MB). Peak memory consumption was 109.4MB. Max. memory is 16.1GB. * Witness Printer took 2.48ms. Allocated memory is still 880.8MB. Free memory was 643.1MB in the beginning and 643.0MB in the end (delta: 117.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=-1, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1=-1, t2=0, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, t1=-1, t2=0, total=1] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-1, t2=0, total=6] [L917] COND TRUE 0 \read(flag) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-1, t2=0, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) [L919] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] [L18] 0 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] - UnprovableResult [Line: 906]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 914]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 59 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.6s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 777 IncrementalHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 2 mSDtfsCounter, 777 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 273 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=10, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 516 NumberOfCodeBlocks, 503 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1282 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1409 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 156/209 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 08:45:18,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:45:20,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:45:20,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-08 08:45:20,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:45:20,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:45:20,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:45:20,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:45:20,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:45:20,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:45:20,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:45:20,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:45:20,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:45:20,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:45:20,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:45:20,257 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:45:20,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:45:20,257 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:45:20,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:45:20,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:45:20,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:45:20,258 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:45:20,258 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:45:20,258 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:45:20,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:45:20,258 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:45:20,258 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 08:45:20,258 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 08:45:20,258 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:45:20,258 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:45:20,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:45:20,258 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:45:20,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:45:20,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:45:20,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:45:20,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:45:20,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:45:20,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:45:20,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:45:20,259 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 08:45:20,259 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 08:45:20,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:45:20,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:45:20,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:45:20,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:45:20,259 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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 [2025-02-08 08:45:20,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:45:20,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:45:20,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:45:20,506 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:45:20,506 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:45:20,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2025-02-08 08:45:21,731 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5fdd373c/4d217c15a93d43879de5f4262e5be4a2/FLAGce59b40c2 [2025-02-08 08:45:22,000 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:45:22,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2025-02-08 08:45:22,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5fdd373c/4d217c15a93d43879de5f4262e5be4a2/FLAGce59b40c2 [2025-02-08 08:45:22,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5fdd373c/4d217c15a93d43879de5f4262e5be4a2 [2025-02-08 08:45:22,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:45:22,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:45:22,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:45:22,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:45:22,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:45:22,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:45:22" (1/1) ... [2025-02-08 08:45:22,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea90af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:22, skipping insertion in model container [2025-02-08 08:45:22,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:45:22" (1/1) ... [2025-02-08 08:45:22,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:45:22,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:45:22,601 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:45:22,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:45:22,701 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:45:22,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:22 WrapperNode [2025-02-08 08:45:22,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:45:22,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:45:22,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:45:22,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:45:22,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:22" (1/1) ... [2025-02-08 08:45:22,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:22" (1/1) ... [2025-02-08 08:45:22,746 INFO L138 Inliner]: procedures = 250, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 263 [2025-02-08 08:45:22,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:45:22,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:45:22,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:45:22,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:45:22,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:22" (1/1) ... [2025-02-08 08:45:22,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:22" (1/1) ... [2025-02-08 08:45:22,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:22" (1/1) ... [2025-02-08 08:45:22,782 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2025-02-08 08:45:22,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:22" (1/1) ... [2025-02-08 08:45:22,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:22" (1/1) ... [2025-02-08 08:45:22,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:22" (1/1) ... [2025-02-08 08:45:22,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:22" (1/1) ... [2025-02-08 08:45:22,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:22" (1/1) ... [2025-02-08 08:45:22,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:22" (1/1) ... [2025-02-08 08:45:22,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:45:22,803 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:45:22,803 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:45:22,803 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:45:22,804 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:22" (1/1) ... [2025-02-08 08:45:22,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:45:22,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:22,830 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-02-08 08:45:22,833 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-02-08 08:45:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 08:45:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 08:45:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 08:45:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-08 08:45:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-08 08:45:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-08 08:45:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 08:45:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-08 08:45:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-08 08:45:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-08 08:45:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-08 08:45:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-08 08:45:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:45:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:45:22,855 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:45:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:45:22,855 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:45:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:45:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:45:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:45:22,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:45:22,856 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:45:23,011 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:45:23,013 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:45:23,372 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:45:23,372 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:45:23,853 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:45:23,853 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:45:23,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:23 BoogieIcfgContainer [2025-02-08 08:45:23,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:45:23,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:45:23,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:45:23,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:45:23,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:45:22" (1/3) ... [2025-02-08 08:45:23,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316b0bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:45:23, skipping insertion in model container [2025-02-08 08:45:23,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:22" (2/3) ... [2025-02-08 08:45:23,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316b0bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:45:23, skipping insertion in model container [2025-02-08 08:45:23,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:23" (3/3) ... [2025-02-08 08:45:23,884 INFO L128 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2025-02-08 08:45:23,895 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:45:23,896 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG arithmetic_prog_bad.i that has 3 procedures, 37 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-02-08 08:45:23,896 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:45:23,947 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:45:23,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 43 transitions, 100 flow [2025-02-08 08:45:24,001 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2025-02-08 08:45:24,002 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:45:24,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 7/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2025-02-08 08:45:24,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 43 transitions, 100 flow [2025-02-08 08:45:24,009 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 40 transitions, 92 flow [2025-02-08 08:45:24,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:45:24,027 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;@65e27010, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:45:24,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 08:45:24,045 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:45:24,045 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2025-02-08 08:45:24,045 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:45:24,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:24,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:24,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:24,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:24,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1676815400, now seen corresponding path program 1 times [2025-02-08 08:45:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:45:24,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429352882] [2025-02-08 08:45:24,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:24,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:24,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:24,062 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-02-08 08:45:24,063 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-02-08 08:45:24,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:45:24,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:45:24,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:24,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:24,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:45:24,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:45:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:24,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:45:24,576 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:45:24,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429352882] [2025-02-08 08:45:24,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429352882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:24,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:24,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:45:24,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307736914] [2025-02-08 08:45:24,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:24,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:24,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:45:24,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:24,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:24,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-02-08 08:45:24,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-02-08 08:45:24,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:24,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-02-08 08:45:24,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:24,769 INFO L124 PetriNetUnfolderBase]: 251/456 cut-off events. [2025-02-08 08:45:24,769 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 08:45:24,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 456 events. 251/456 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1911 event pairs, 159 based on Foata normal form. 3/447 useless extension candidates. Maximal degree in co-relation 812. Up to 391 conditions per place. [2025-02-08 08:45:24,773 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 23 selfloop transitions, 1 changer transitions 3/36 dead transitions. [2025-02-08 08:45:24,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 132 flow [2025-02-08 08:45:24,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-02-08 08:45:24,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2025-02-08 08:45:24,782 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 92 flow. Second operand 3 states and 69 transitions. [2025-02-08 08:45:24,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 132 flow [2025-02-08 08:45:24,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:45:24,790 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 72 flow [2025-02-08 08:45:24,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2025-02-08 08:45:24,796 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-02-08 08:45:24,796 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 72 flow [2025-02-08 08:45:24,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-02-08 08:45:24,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:24,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:24,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 08:45:24,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:24,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:24,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:24,998 INFO L85 PathProgramCache]: Analyzing trace with hash -23498753, now seen corresponding path program 1 times [2025-02-08 08:45:24,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:45:24,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090524905] [2025-02-08 08:45:24,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:24,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:24,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:25,000 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-02-08 08:45:25,001 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-02-08 08:45:25,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:45:25,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:45:25,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:25,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:25,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:45:25,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:45:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:25,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:45:25,370 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:45:25,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090524905] [2025-02-08 08:45:25,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090524905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:25,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:25,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:25,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910589465] [2025-02-08 08:45:25,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:25,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:25,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:45:25,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:25,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:25,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-02-08 08:45:25,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:25,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:25,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-02-08 08:45:25,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:25,624 INFO L124 PetriNetUnfolderBase]: 533/970 cut-off events. [2025-02-08 08:45:25,625 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 08:45:25,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1792 conditions, 970 events. 533/970 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4382 event pairs, 90 based on Foata normal form. 17/977 useless extension candidates. Maximal degree in co-relation 1786. Up to 335 conditions per place. [2025-02-08 08:45:25,633 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 50 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2025-02-08 08:45:25,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 64 transitions, 246 flow [2025-02-08 08:45:25,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-02-08 08:45:25,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2025-02-08 08:45:25,635 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 72 flow. Second operand 4 states and 116 transitions. [2025-02-08 08:45:25,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 64 transitions, 246 flow [2025-02-08 08:45:25,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 64 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:25,636 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 102 flow [2025-02-08 08:45:25,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2025-02-08 08:45:25,637 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-02-08 08:45:25,637 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 102 flow [2025-02-08 08:45:25,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:25,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:25,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:25,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:45:25,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:25,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:25,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:25,843 INFO L85 PathProgramCache]: Analyzing trace with hash 254783189, now seen corresponding path program 1 times [2025-02-08 08:45:25,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:45:25,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1819033973] [2025-02-08 08:45:25,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:25,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:25,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:25,845 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-02-08 08:45:25,846 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-02-08 08:45:26,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 08:45:26,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 08:45:26,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:26,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:26,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:45:26,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:45:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:26,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:45:26,235 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:45:26,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819033973] [2025-02-08 08:45:26,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819033973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:26,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:26,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:26,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978053599] [2025-02-08 08:45:26,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:26,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:26,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:45:26,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:26,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:26,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-02-08 08:45:26,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-02-08 08:45:26,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:26,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-02-08 08:45:26,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:26,443 INFO L124 PetriNetUnfolderBase]: 868/1507 cut-off events. [2025-02-08 08:45:26,443 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2025-02-08 08:45:26,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3148 conditions, 1507 events. 868/1507 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6293 event pairs, 288 based on Foata normal form. 53/1497 useless extension candidates. Maximal degree in co-relation 3139. Up to 899 conditions per place. [2025-02-08 08:45:26,449 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 40 selfloop transitions, 3 changer transitions 2/52 dead transitions. [2025-02-08 08:45:26,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 52 transitions, 230 flow [2025-02-08 08:45:26,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-02-08 08:45:26,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-02-08 08:45:26,450 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 102 flow. Second operand 3 states and 83 transitions. [2025-02-08 08:45:26,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 52 transitions, 230 flow [2025-02-08 08:45:26,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:26,452 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 125 flow [2025-02-08 08:45:26,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-02-08 08:45:26,453 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2025-02-08 08:45:26,453 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 125 flow [2025-02-08 08:45:26,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-02-08 08:45:26,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:26,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:26,460 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-02-08 08:45:26,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:26,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:26,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:26,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2086625019, now seen corresponding path program 1 times [2025-02-08 08:45:26,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:45:26,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581351348] [2025-02-08 08:45:26,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:26,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:26,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:26,657 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-02-08 08:45:26,659 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-02-08 08:45:26,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:45:26,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:45:26,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:26,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:26,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:45:26,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:45:26,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-02-08 08:45:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:26,969 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:45:26,969 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:45:26,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581351348] [2025-02-08 08:45:26,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581351348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:26,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:26,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:26,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002672205] [2025-02-08 08:45:26,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:26,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:26,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:45:26,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:26,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:26,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-02-08 08:45:26,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-08 08:45:26,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:26,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-02-08 08:45:26,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:27,157 INFO L124 PetriNetUnfolderBase]: 393/837 cut-off events. [2025-02-08 08:45:27,157 INFO L125 PetriNetUnfolderBase]: For 297/297 co-relation queries the response was YES. [2025-02-08 08:45:27,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1831 conditions, 837 events. 393/837 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3444 event pairs, 134 based on Foata normal form. 64/900 useless extension candidates. Maximal degree in co-relation 1819. Up to 341 conditions per place. [2025-02-08 08:45:27,161 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 32 selfloop transitions, 8 changer transitions 0/50 dead transitions. [2025-02-08 08:45:27,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 247 flow [2025-02-08 08:45:27,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-02-08 08:45:27,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-02-08 08:45:27,164 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 125 flow. Second operand 3 states and 83 transitions. [2025-02-08 08:45:27,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 247 flow [2025-02-08 08:45:27,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:27,168 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 135 flow [2025-02-08 08:45:27,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-02-08 08:45:27,168 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2025-02-08 08:45:27,169 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 135 flow [2025-02-08 08:45:27,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-08 08:45:27,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:27,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:27,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 08:45:27,370 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 [2025-02-08 08:45:27,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:27,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:27,371 INFO L85 PathProgramCache]: Analyzing trace with hash -429234663, now seen corresponding path program 2 times [2025-02-08 08:45:27,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:45:27,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025182077] [2025-02-08 08:45:27,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:45:27,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:27,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:27,377 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-02-08 08:45:27,379 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-02-08 08:45:27,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:45:27,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:45:27,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:45:27,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:27,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:45:27,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:45:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:27,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:45:27,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:45:27,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025182077] [2025-02-08 08:45:27,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025182077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:27,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:27,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:45:27,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95094863] [2025-02-08 08:45:27,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:27,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:45:27,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:45:27,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:45:27,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:45:27,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-02-08 08:45:27,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:27,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:27,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-02-08 08:45:27,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:28,093 INFO L124 PetriNetUnfolderBase]: 512/1090 cut-off events. [2025-02-08 08:45:28,093 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-02-08 08:45:28,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 1090 events. 512/1090 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4700 event pairs, 35 based on Foata normal form. 15/1101 useless extension candidates. Maximal degree in co-relation 2640. Up to 244 conditions per place. [2025-02-08 08:45:28,100 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 77 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2025-02-08 08:45:28,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 93 transitions, 497 flow [2025-02-08 08:45:28,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:45:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:45:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2025-02-08 08:45:28,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6550387596899225 [2025-02-08 08:45:28,103 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 135 flow. Second operand 6 states and 169 transitions. [2025-02-08 08:45:28,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 93 transitions, 497 flow [2025-02-08 08:45:28,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 93 transitions, 462 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:28,106 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 154 flow [2025-02-08 08:45:28,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2025-02-08 08:45:28,107 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-02-08 08:45:28,107 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 154 flow [2025-02-08 08:45:28,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:28,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:28,107 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:28,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:45:28,308 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 [2025-02-08 08:45:28,308 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:28,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:28,308 INFO L85 PathProgramCache]: Analyzing trace with hash 58296363, now seen corresponding path program 3 times [2025-02-08 08:45:28,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:45:28,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143128836] [2025-02-08 08:45:28,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:45:28,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:28,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:28,311 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-02-08 08:45:28,312 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-02-08 08:45:28,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-02-08 08:45:28,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 33 statements. [2025-02-08 08:45:28,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:45:28,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:28,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:45:28,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:45:28,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 08:45:28,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:45:28,643 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:45:28,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143128836] [2025-02-08 08:45:28,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143128836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:28,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:28,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:45:28,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224195116] [2025-02-08 08:45:28,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:28,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:28,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:45:28,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:28,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:28,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-02-08 08:45:28,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:28,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:28,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-02-08 08:45:28,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:28,987 INFO L124 PetriNetUnfolderBase]: 901/1889 cut-off events. [2025-02-08 08:45:28,987 INFO L125 PetriNetUnfolderBase]: For 1433/1434 co-relation queries the response was YES. [2025-02-08 08:45:28,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4588 conditions, 1889 events. 901/1889 cut-off events. For 1433/1434 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 10046 event pairs, 227 based on Foata normal form. 64/1940 useless extension candidates. Maximal degree in co-relation 4574. Up to 868 conditions per place. [2025-02-08 08:45:28,997 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 67 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2025-02-08 08:45:28,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 80 transitions, 492 flow [2025-02-08 08:45:28,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-02-08 08:45:28,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.686046511627907 [2025-02-08 08:45:28,998 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 154 flow. Second operand 4 states and 118 transitions. [2025-02-08 08:45:28,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 80 transitions, 492 flow [2025-02-08 08:45:29,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 80 transitions, 453 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 08:45:29,001 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 159 flow [2025-02-08 08:45:29,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2025-02-08 08:45:29,002 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2025-02-08 08:45:29,002 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 159 flow [2025-02-08 08:45:29,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:29,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:29,002 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:29,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:45:29,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:29,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:29,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:29,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1275189987, now seen corresponding path program 4 times [2025-02-08 08:45:29,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:45:29,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [13474174] [2025-02-08 08:45:29,204 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:45:29,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:29,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:29,206 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:45:29,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:45:29,462 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-02-08 08:45:29,473 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 39 statements. [2025-02-08 08:45:29,473 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 08:45:29,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:29,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:45:29,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:45:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:45:29,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:45:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:45:29,577 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:45:29,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13474174] [2025-02-08 08:45:29,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13474174] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:45:29,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:45:29,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-02-08 08:45:29,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212828907] [2025-02-08 08:45:29,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:45:29,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:45:29,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:45:29,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:45:29,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:45:29,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-02-08 08:45:29,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 159 flow. Second operand has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 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-02-08 08:45:29,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:29,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-02-08 08:45:29,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:30,072 INFO L124 PetriNetUnfolderBase]: 1159/2275 cut-off events. [2025-02-08 08:45:30,072 INFO L125 PetriNetUnfolderBase]: For 1337/1345 co-relation queries the response was YES. [2025-02-08 08:45:30,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5821 conditions, 2275 events. 1159/2275 cut-off events. For 1337/1345 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 11874 event pairs, 121 based on Foata normal form. 29/2294 useless extension candidates. Maximal degree in co-relation 5807. Up to 490 conditions per place. [2025-02-08 08:45:30,083 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 92 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2025-02-08 08:45:30,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 107 transitions, 596 flow [2025-02-08 08:45:30,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:45:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:45:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2025-02-08 08:45:30,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2025-02-08 08:45:30,085 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 159 flow. Second operand 6 states and 168 transitions. [2025-02-08 08:45:30,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 107 transitions, 596 flow [2025-02-08 08:45:30,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 107 transitions, 596 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:45:30,089 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 181 flow [2025-02-08 08:45:30,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2025-02-08 08:45:30,090 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2025-02-08 08:45:30,090 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 181 flow [2025-02-08 08:45:30,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 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-02-08 08:45:30,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:30,090 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:30,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:45:30,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:30,294 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:30,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:30,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1278386723, now seen corresponding path program 5 times [2025-02-08 08:45:30,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:45:30,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186704474] [2025-02-08 08:45:30,295 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:45:30,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:30,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:30,297 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:45:30,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 08:45:30,542 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 4 equivalence classes. [2025-02-08 08:45:30,577 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 08:45:30,577 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 08:45:30,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:30,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:45:30,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:45:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:45:30,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:45:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:45:30,651 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:45:30,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186704474] [2025-02-08 08:45:30,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186704474] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:45:30,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:45:30,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2025-02-08 08:45:30,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622581424] [2025-02-08 08:45:30,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:45:30,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:30,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:45:30,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:30,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:30,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-02-08 08:45:30,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:30,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:30,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-02-08 08:45:30,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:30,886 INFO L124 PetriNetUnfolderBase]: 605/1299 cut-off events. [2025-02-08 08:45:30,886 INFO L125 PetriNetUnfolderBase]: For 1482/1484 co-relation queries the response was YES. [2025-02-08 08:45:30,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3531 conditions, 1299 events. 605/1299 cut-off events. For 1482/1484 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5560 event pairs, 167 based on Foata normal form. 72/1365 useless extension candidates. Maximal degree in co-relation 3516. Up to 570 conditions per place. [2025-02-08 08:45:30,892 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 49 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2025-02-08 08:45:30,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 383 flow [2025-02-08 08:45:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-02-08 08:45:30,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563953488372093 [2025-02-08 08:45:30,894 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 181 flow. Second operand 4 states and 97 transitions. [2025-02-08 08:45:30,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 383 flow [2025-02-08 08:45:30,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 367 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:30,897 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 200 flow [2025-02-08 08:45:30,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2025-02-08 08:45:30,898 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2025-02-08 08:45:30,899 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 200 flow [2025-02-08 08:45:30,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:45:30,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:30,899 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:30,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 08:45:31,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:31,100 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:45:31,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash 404407421, now seen corresponding path program 6 times [2025-02-08 08:45:31,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:45:31,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [828266989] [2025-02-08 08:45:31,101 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 08:45:31,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:31,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:31,103 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:45:31,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 08:45:31,364 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 3 equivalence classes. [2025-02-08 08:45:31,593 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 08:45:31,593 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-08 08:45:31,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:45:31,593 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:45:31,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 08:45:31,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 08:45:31,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:31,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:45:31,750 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 08:45:31,751 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:45:31,751 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2025-02-08 08:45:31,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-02-08 08:45:31,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-02-08 08:45:31,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-02-08 08:45:31,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 08:45:31,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:31,961 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2025-02-08 08:45:32,020 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:45:32,020 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:45:32,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:45:32 BasicIcfg [2025-02-08 08:45:32,029 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:45:32,029 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:45:32,029 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:45:32,029 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:45:32,030 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:23" (3/4) ... [2025-02-08 08:45:32,031 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:45:32,034 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:45:32,035 INFO L158 Benchmark]: Toolchain (without parser) took 9735.24ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 91.0MB in the beginning and 224.3MB in the end (delta: -133.3MB). Peak memory consumption was 181.8MB. Max. memory is 16.1GB. [2025-02-08 08:45:32,035 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:45:32,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.39ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 62.0MB in the end (delta: 28.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:45:32,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.92ms. Allocated memory is still 117.4MB. Free memory was 61.7MB in the beginning and 58.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:45:32,035 INFO L158 Benchmark]: Boogie Preprocessor took 55.76ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 55.4MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:45:32,035 INFO L158 Benchmark]: IcfgBuilder took 1050.79ms. Allocated memory is still 117.4MB. Free memory was 55.4MB in the beginning and 30.9MB in the end (delta: 24.5MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2025-02-08 08:45:32,035 INFO L158 Benchmark]: TraceAbstraction took 8150.38ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 67.8MB in the beginning and 228.6MB in the end (delta: -160.8MB). Peak memory consumption was 146.3MB. Max. memory is 16.1GB. [2025-02-08 08:45:32,035 INFO L158 Benchmark]: Witness Printer took 4.72ms. Allocated memory is still 427.8MB. Free memory was 224.4MB in the beginning and 224.3MB in the end (delta: 40.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:45:32,036 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.39ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 62.0MB in the end (delta: 28.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.92ms. Allocated memory is still 117.4MB. Free memory was 61.7MB in the beginning and 58.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.76ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 55.4MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1050.79ms. Allocated memory is still 117.4MB. Free memory was 55.4MB in the beginning and 30.9MB in the end (delta: 24.5MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8150.38ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 67.8MB in the beginning and 228.6MB in the end (delta: -160.8MB). Peak memory consumption was 146.3MB. Max. memory is 16.1GB. * Witness Printer took 4.72ms. Allocated memory is still 427.8MB. Free memory was 224.4MB in the beginning and 224.3MB in the end (delta: 40.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=-1, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1=-1, t2=0, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, t1=-1, t2=0, total=1] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-1, t2=0, total=6] [L917] COND TRUE 0 \read(flag) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-1, t2=0, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) [L919] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] [L18] 0 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] - UnprovableResult [Line: 906]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 914]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 59 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.0s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 926 IncrementalHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 3 mSDtfsCounter, 926 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 295 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=8, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 272 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 713 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1592 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 57/77 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 08:45:32,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample