./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/stack-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:55:46,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:55:46,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:55:46,792 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:55:46,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:55:46,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:55:46,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:55:46,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:55:46,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:55:46,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:55:46,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:55:46,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:55:46,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:55:46,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:55:46,811 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:55:46,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:55:46,812 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:55:46,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:55:46,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:55:46,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:55:46,812 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:55:46,812 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:55:46,812 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:55:46,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:55:46,812 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:55:46,813 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:55:46,813 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:55:46,813 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:55:46,813 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:55:46,813 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:55:46,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:55:46,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:55:46,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:55:46,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:46,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:55:46,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:55:46,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:55:46,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:55:46,814 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:55:46,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:55:46,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:55:46,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:55:46,814 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2025-03-09 00:55:47,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:55:47,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:55:47,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:55:47,058 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:55:47,058 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:55:47,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-2.i [2025-03-09 00:55:48,137 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3240938/da90de30aca945399ac34a386262985a/FLAG9041307d2 [2025-03-09 00:55:48,396 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:55:48,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2025-03-09 00:55:48,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3240938/da90de30aca945399ac34a386262985a/FLAG9041307d2 [2025-03-09 00:55:48,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3240938/da90de30aca945399ac34a386262985a [2025-03-09 00:55:48,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:55:48,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:55:48,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:48,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:55:48,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:55:48,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:48" (1/1) ... [2025-03-09 00:55:48,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55efa566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:48, skipping insertion in model container [2025-03-09 00:55:48,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:48" (1/1) ... [2025-03-09 00:55:48,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:55:49,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:49,102 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:55:49,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:49,191 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:55:49,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:49 WrapperNode [2025-03-09 00:55:49,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:49,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:49,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:55:49,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:55:49,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:49" (1/1) ... [2025-03-09 00:55:49,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:49" (1/1) ... [2025-03-09 00:55:49,225 INFO L138 Inliner]: procedures = 277, calls = 37, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 155 [2025-03-09 00:55:49,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:49,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:55:49,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:55:49,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:55:49,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:49" (1/1) ... [2025-03-09 00:55:49,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:49" (1/1) ... [2025-03-09 00:55:49,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:49" (1/1) ... [2025-03-09 00:55:49,246 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 7, 5]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 1, 0]. [2025-03-09 00:55:49,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:49" (1/1) ... [2025-03-09 00:55:49,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:49" (1/1) ... [2025-03-09 00:55:49,252 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:49" (1/1) ... [2025-03-09 00:55:49,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:49" (1/1) ... [2025-03-09 00:55:49,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:49" (1/1) ... [2025-03-09 00:55:49,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:49" (1/1) ... [2025-03-09 00:55:49,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:55:49,258 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:55:49,258 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:55:49,259 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:55:49,259 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:49" (1/1) ... [2025-03-09 00:55:49,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:49,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:49,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:55:49,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:55:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-09 00:55:49,304 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-09 00:55:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-09 00:55:49,304 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-09 00:55:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 00:55:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:55:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:55:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 00:55:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:55:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:55:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 00:55:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 00:55:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:55:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:55:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:55:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:55:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:55:49,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:55:49,305 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:55:49,405 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:55:49,407 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:55:49,609 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: pop_#res#1 := 0; [2025-03-09 00:55:49,609 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc pop_#t~mem38#1; [2025-03-09 00:55:49,609 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: havoc pop_#t~ret37#1; [2025-03-09 00:55:49,610 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:55:49,610 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:55:49,743 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:55:49,743 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:55:49,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:49 BoogieIcfgContainer [2025-03-09 00:55:49,745 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:55:49,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:55:49,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:55:49,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:55:49,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:55:48" (1/3) ... [2025-03-09 00:55:49,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da96eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:49, skipping insertion in model container [2025-03-09 00:55:49,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:49" (2/3) ... [2025-03-09 00:55:49,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da96eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:49, skipping insertion in model container [2025-03-09 00:55:49,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:49" (3/3) ... [2025-03-09 00:55:49,753 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-2.i [2025-03-09 00:55:49,763 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:55:49,764 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-2.i that has 3 procedures, 47 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-09 00:55:49,764 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:55:49,825 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 00:55:49,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2025-03-09 00:55:49,889 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2025-03-09 00:55:49,891 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 00:55:49,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 53 events. 9/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 142 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 48. Up to 3 conditions per place. [2025-03-09 00:55:49,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2025-03-09 00:55:49,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2025-03-09 00:55:49,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:55:49,913 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;@66101d41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:55:49,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-09 00:55:49,920 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:55:49,920 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-09 00:55:49,920 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 00:55:49,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:49,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:49,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:49,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:49,928 INFO L85 PathProgramCache]: Analyzing trace with hash 743830731, now seen corresponding path program 1 times [2025-03-09 00:55:49,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:49,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046626591] [2025-03-09 00:55:49,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:49,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:49,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:55:50,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:55:50,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:50,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:50,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:50,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046626591] [2025-03-09 00:55:50,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046626591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:50,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:50,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:50,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195402599] [2025-03-09 00:55:50,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:50,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:55:50,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:50,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:55:50,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:55:50,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:55:50,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:50,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:50,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:55:50,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:50,542 INFO L124 PetriNetUnfolderBase]: 459/880 cut-off events. [2025-03-09 00:55:50,542 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-09 00:55:50,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 880 events. 459/880 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4525 event pairs, 245 based on Foata normal form. 94/846 useless extension candidates. Maximal degree in co-relation 1574. Up to 520 conditions per place. [2025-03-09 00:55:50,550 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2025-03-09 00:55:50,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2025-03-09 00:55:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-09 00:55:50,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2025-03-09 00:55:50,563 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2025-03-09 00:55:50,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2025-03-09 00:55:50,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 00:55:50,570 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2025-03-09 00:55:50,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2025-03-09 00:55:50,577 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2025-03-09 00:55:50,577 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2025-03-09 00:55:50,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:50,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:50,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:50,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:55:50,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:50,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash 743830732, now seen corresponding path program 1 times [2025-03-09 00:55:50,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:50,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079456035] [2025-03-09 00:55:50,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:50,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:50,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:55:50,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:55:50,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:50,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:50,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:50,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079456035] [2025-03-09 00:55:50,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079456035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:50,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:50,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:50,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444872044] [2025-03-09 00:55:50,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:50,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:55:50,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:50,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:55:50,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:55:50,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:55:50,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:50,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:50,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:55:50,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:51,178 INFO L124 PetriNetUnfolderBase]: 755/1387 cut-off events. [2025-03-09 00:55:51,178 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-09 00:55:51,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1387 events. 755/1387 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7447 event pairs, 125 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 810. Up to 848 conditions per place. [2025-03-09 00:55:51,188 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2025-03-09 00:55:51,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2025-03-09 00:55:51,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:55:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:55:51,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2025-03-09 00:55:51,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2025-03-09 00:55:51,191 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2025-03-09 00:55:51,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2025-03-09 00:55:51,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 00:55:51,195 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2025-03-09 00:55:51,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2025-03-09 00:55:51,196 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-03-09 00:55:51,196 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2025-03-09 00:55:51,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:51,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:51,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:51,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:55:51,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:51,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:51,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1032682304, now seen corresponding path program 1 times [2025-03-09 00:55:51,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:51,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268890489] [2025-03-09 00:55:51,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:51,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:51,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:55:51,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:55:51,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:51,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268890489] [2025-03-09 00:55:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268890489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:51,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:51,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:51,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503189846] [2025-03-09 00:55:51,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:51,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:55:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:51,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:55:51,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:55:51,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:55:51,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:51,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:51,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:55:51,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:51,439 INFO L124 PetriNetUnfolderBase]: 668/1270 cut-off events. [2025-03-09 00:55:51,439 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2025-03-09 00:55:51,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2683 conditions, 1270 events. 668/1270 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6559 event pairs, 181 based on Foata normal form. 34/1183 useless extension candidates. Maximal degree in co-relation 2598. Up to 721 conditions per place. [2025-03-09 00:55:51,445 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 67 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2025-03-09 00:55:51,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 376 flow [2025-03-09 00:55:51,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:55:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:55:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-03-09 00:55:51,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2025-03-09 00:55:51,446 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 5 states and 160 transitions. [2025-03-09 00:55:51,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 376 flow [2025-03-09 00:55:51,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 87 transitions, 374 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:51,448 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 161 flow [2025-03-09 00:55:51,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-03-09 00:55:51,451 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2025-03-09 00:55:51,451 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 161 flow [2025-03-09 00:55:51,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:51,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:51,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:51,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:55:51,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:51,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:51,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1950272914, now seen corresponding path program 1 times [2025-03-09 00:55:51,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:51,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545512504] [2025-03-09 00:55:51,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:51,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:51,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 00:55:51,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 00:55:51,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:51,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:51,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:51,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545512504] [2025-03-09 00:55:51,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545512504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:51,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:51,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:55:51,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331241979] [2025-03-09 00:55:51,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:51,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:55:51,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:51,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:55:51,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:55:51,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:55:51,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:51,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:51,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:55:51,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:51,743 INFO L124 PetriNetUnfolderBase]: 976/1831 cut-off events. [2025-03-09 00:55:51,743 INFO L125 PetriNetUnfolderBase]: For 351/351 co-relation queries the response was YES. [2025-03-09 00:55:51,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4033 conditions, 1831 events. 976/1831 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 9708 event pairs, 469 based on Foata normal form. 0/1699 useless extension candidates. Maximal degree in co-relation 3362. Up to 1060 conditions per place. [2025-03-09 00:55:51,756 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 73 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2025-03-09 00:55:51,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 429 flow [2025-03-09 00:55:51,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-03-09 00:55:51,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2025-03-09 00:55:51,759 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 161 flow. Second operand 4 states and 139 transitions. [2025-03-09 00:55:51,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 429 flow [2025-03-09 00:55:51,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 429 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:55:51,764 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 197 flow [2025-03-09 00:55:51,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2025-03-09 00:55:51,765 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2025-03-09 00:55:51,765 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 197 flow [2025-03-09 00:55:51,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:51,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:51,765 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:51,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:55:51,765 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:51,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:51,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1794545639, now seen corresponding path program 1 times [2025-03-09 00:55:51,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:51,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665846966] [2025-03-09 00:55:51,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:51,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:51,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:55:51,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:55:51,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:51,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:51,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:51,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665846966] [2025-03-09 00:55:51,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665846966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:51,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:51,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:51,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377133662] [2025-03-09 00:55:51,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:51,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:51,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:51,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:51,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:51,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:55:51,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 197 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-03-09 00:55:51,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:51,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:55:51,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:52,026 INFO L124 PetriNetUnfolderBase]: 1100/2025 cut-off events. [2025-03-09 00:55:52,028 INFO L125 PetriNetUnfolderBase]: For 573/573 co-relation queries the response was YES. [2025-03-09 00:55:52,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4879 conditions, 2025 events. 1100/2025 cut-off events. For 573/573 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10940 event pairs, 511 based on Foata normal form. 22/1918 useless extension candidates. Maximal degree in co-relation 4019. Up to 1290 conditions per place. [2025-03-09 00:55:52,040 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 62 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-03-09 00:55:52,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 397 flow [2025-03-09 00:55:52,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:52,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:52,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-03-09 00:55:52,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2025-03-09 00:55:52,043 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 197 flow. Second operand 3 states and 106 transitions. [2025-03-09 00:55:52,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 397 flow [2025-03-09 00:55:52,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 391 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:52,052 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 203 flow [2025-03-09 00:55:52,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2025-03-09 00:55:52,054 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2025-03-09 00:55:52,055 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 203 flow [2025-03-09 00:55:52,055 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-03-09 00:55:52,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:52,055 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:52,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:55:52,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:52,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:52,056 INFO L85 PathProgramCache]: Analyzing trace with hash 211688617, now seen corresponding path program 1 times [2025-03-09 00:55:52,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:52,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247581079] [2025-03-09 00:55:52,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:52,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:52,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:55:52,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:55:52,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:52,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:52,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:52,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247581079] [2025-03-09 00:55:52,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247581079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:52,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:52,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:52,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813143037] [2025-03-09 00:55:52,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:52,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:52,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:52,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:52,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:52,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:55:52,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:52,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:52,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:55:52,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:52,304 INFO L124 PetriNetUnfolderBase]: 1006/1848 cut-off events. [2025-03-09 00:55:52,304 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-03-09 00:55:52,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4362 conditions, 1848 events. 1006/1848 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9870 event pairs, 361 based on Foata normal form. 12/1737 useless extension candidates. Maximal degree in co-relation 3863. Up to 1410 conditions per place. [2025-03-09 00:55:52,312 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 49 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-03-09 00:55:52,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 313 flow [2025-03-09 00:55:52,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-09 00:55:52,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2025-03-09 00:55:52,314 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 203 flow. Second operand 3 states and 96 transitions. [2025-03-09 00:55:52,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 313 flow [2025-03-09 00:55:52,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 303 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 00:55:52,318 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 180 flow [2025-03-09 00:55:52,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2025-03-09 00:55:52,319 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2025-03-09 00:55:52,319 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 180 flow [2025-03-09 00:55:52,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:52,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:52,320 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:52,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:55:52,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:52,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:52,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1381925028, now seen corresponding path program 1 times [2025-03-09 00:55:52,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:52,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668464272] [2025-03-09 00:55:52,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:52,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:52,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:55:52,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:55:52,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:52,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:52,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:52,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668464272] [2025-03-09 00:55:52,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668464272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:55:52,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089665933] [2025-03-09 00:55:52,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:52,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:55:52,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:52,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:55:52,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:55:52,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:55:52,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:55:52,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:52,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:52,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 00:55:52,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:55:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:52,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:55:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:53,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089665933] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:55:53,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:55:53,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-03-09 00:55:53,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428704723] [2025-03-09 00:55:53,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:55:53,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:55:53,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:53,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:55:53,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:55:53,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:55:53,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 180 flow. Second operand has 15 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:53,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:53,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:55:53,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:54,388 INFO L124 PetriNetUnfolderBase]: 4128/7713 cut-off events. [2025-03-09 00:55:54,388 INFO L125 PetriNetUnfolderBase]: For 2485/2485 co-relation queries the response was YES. [2025-03-09 00:55:54,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17855 conditions, 7713 events. 4128/7713 cut-off events. For 2485/2485 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 50361 event pairs, 309 based on Foata normal form. 192/7388 useless extension candidates. Maximal degree in co-relation 7413. Up to 1423 conditions per place. [2025-03-09 00:55:54,420 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 327 selfloop transitions, 45 changer transitions 0/386 dead transitions. [2025-03-09 00:55:54,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 386 transitions, 1892 flow [2025-03-09 00:55:54,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 00:55:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-09 00:55:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 685 transitions. [2025-03-09 00:55:54,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2025-03-09 00:55:54,423 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 180 flow. Second operand 20 states and 685 transitions. [2025-03-09 00:55:54,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 386 transitions, 1892 flow [2025-03-09 00:55:54,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 386 transitions, 1850 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:54,430 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 592 flow [2025-03-09 00:55:54,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=592, PETRI_PLACES=92, PETRI_TRANSITIONS=98} [2025-03-09 00:55:54,431 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2025-03-09 00:55:54,431 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 592 flow [2025-03-09 00:55:54,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:54,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:54,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:54,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 00:55:54,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:55:54,637 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:54,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:54,638 INFO L85 PathProgramCache]: Analyzing trace with hash -671755547, now seen corresponding path program 1 times [2025-03-09 00:55:54,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:54,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240861739] [2025-03-09 00:55:54,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:54,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:54,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 00:55:54,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 00:55:54,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:54,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:54,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:54,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240861739] [2025-03-09 00:55:54,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240861739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:54,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:54,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:54,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322363588] [2025-03-09 00:55:54,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:54,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:54,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:54,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:54,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:54,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:55:54,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 98 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:54,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:54,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:55:54,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:55,010 INFO L124 PetriNetUnfolderBase]: 1833/3825 cut-off events. [2025-03-09 00:55:55,011 INFO L125 PetriNetUnfolderBase]: For 2279/2279 co-relation queries the response was YES. [2025-03-09 00:55:55,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9376 conditions, 3825 events. 1833/3825 cut-off events. For 2279/2279 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 22288 event pairs, 372 based on Foata normal form. 234/3900 useless extension candidates. Maximal degree in co-relation 9174. Up to 2311 conditions per place. [2025-03-09 00:55:55,035 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2025-03-09 00:55:55,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 609 flow [2025-03-09 00:55:55,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-03-09 00:55:55,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2025-03-09 00:55:55,037 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 592 flow. Second operand 3 states and 94 transitions. [2025-03-09 00:55:55,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 609 flow [2025-03-09 00:55:55,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 561 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-03-09 00:55:55,047 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 389 flow [2025-03-09 00:55:55,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2025-03-09 00:55:55,047 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2025-03-09 00:55:55,047 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 389 flow [2025-03-09 00:55:55,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:55,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:55,048 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-03-09 00:55:55,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:55:55,048 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:55,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:55,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1121959788, now seen corresponding path program 1 times [2025-03-09 00:55:55,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:55,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972674264] [2025-03-09 00:55:55,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:55,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:55,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:55:55,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:55:55,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:55,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:55,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:55,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972674264] [2025-03-09 00:55:55,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972674264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:55,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:55,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:55,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169744207] [2025-03-09 00:55:55,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:55,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:55:55,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:55,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:55:55,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:55:55,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:55:55,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 389 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-03-09 00:55:55,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:55,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:55:55,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:55,401 INFO L124 PetriNetUnfolderBase]: 1838/3723 cut-off events. [2025-03-09 00:55:55,402 INFO L125 PetriNetUnfolderBase]: For 1490/1490 co-relation queries the response was YES. [2025-03-09 00:55:55,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9356 conditions, 3723 events. 1838/3723 cut-off events. For 1490/1490 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 21360 event pairs, 1214 based on Foata normal form. 0/3594 useless extension candidates. Maximal degree in co-relation 7887. Up to 2670 conditions per place. [2025-03-09 00:55:55,419 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 65 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2025-03-09 00:55:55,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 540 flow [2025-03-09 00:55:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-03-09 00:55:55,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-03-09 00:55:55,420 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 389 flow. Second operand 4 states and 100 transitions. [2025-03-09 00:55:55,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 540 flow [2025-03-09 00:55:55,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 82 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:55,427 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 389 flow [2025-03-09 00:55:55,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2025-03-09 00:55:55,429 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 34 predicate places. [2025-03-09 00:55:55,429 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 389 flow [2025-03-09 00:55:55,429 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-03-09 00:55:55,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:55,429 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-03-09 00:55:55,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:55:55,429 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:55,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:55,430 INFO L85 PathProgramCache]: Analyzing trace with hash -97213901, now seen corresponding path program 1 times [2025-03-09 00:55:55,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:55,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257085334] [2025-03-09 00:55:55,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:55,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:55,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:55:55,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:55:55,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:55,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:55,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:55,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257085334] [2025-03-09 00:55:55,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257085334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:55,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:55,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:55:55,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116182193] [2025-03-09 00:55:55,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:55,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:55:55,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:55,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:55:55,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:55:55,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:55:55,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 389 flow. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:55,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:55,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:55:55,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:56,037 INFO L124 PetriNetUnfolderBase]: 1961/3990 cut-off events. [2025-03-09 00:55:56,037 INFO L125 PetriNetUnfolderBase]: For 1680/1680 co-relation queries the response was YES. [2025-03-09 00:55:56,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9858 conditions, 3990 events. 1961/3990 cut-off events. For 1680/1680 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 23092 event pairs, 461 based on Foata normal form. 0/3826 useless extension candidates. Maximal degree in co-relation 8388. Up to 2936 conditions per place. [2025-03-09 00:55:56,053 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 105 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2025-03-09 00:55:56,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 126 transitions, 772 flow [2025-03-09 00:55:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:55:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 00:55:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2025-03-09 00:55:56,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5116883116883116 [2025-03-09 00:55:56,055 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 389 flow. Second operand 7 states and 197 transitions. [2025-03-09 00:55:56,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 126 transitions, 772 flow [2025-03-09 00:55:56,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 126 transitions, 762 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 00:55:56,061 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 440 flow [2025-03-09 00:55:56,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2025-03-09 00:55:56,062 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2025-03-09 00:55:56,063 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 440 flow [2025-03-09 00:55:56,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:56,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:56,063 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:56,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:55:56,063 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:56,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash 814042361, now seen corresponding path program 1 times [2025-03-09 00:55:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:56,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318872124] [2025-03-09 00:55:56,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:56,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:56,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 00:55:56,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 00:55:56,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:56,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:56,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:56,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318872124] [2025-03-09 00:55:56,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318872124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:56,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:56,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:56,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814173967] [2025-03-09 00:55:56,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:56,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:56,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:56,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:56,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:56,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:55:56,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:56,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:56,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:55:56,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:56,460 INFO L124 PetriNetUnfolderBase]: 2879/6063 cut-off events. [2025-03-09 00:55:56,460 INFO L125 PetriNetUnfolderBase]: For 3095/3095 co-relation queries the response was YES. [2025-03-09 00:55:56,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15007 conditions, 6063 events. 2879/6063 cut-off events. For 3095/3095 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 40456 event pairs, 1373 based on Foata normal form. 137/5974 useless extension candidates. Maximal degree in co-relation 12980. Up to 3403 conditions per place. [2025-03-09 00:55:56,488 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 124 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2025-03-09 00:55:56,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 140 transitions, 1050 flow [2025-03-09 00:55:56,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-09 00:55:56,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2025-03-09 00:55:56,489 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 440 flow. Second operand 3 states and 107 transitions. [2025-03-09 00:55:56,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 140 transitions, 1050 flow [2025-03-09 00:55:56,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 140 transitions, 1038 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 00:55:56,500 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 445 flow [2025-03-09 00:55:56,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2025-03-09 00:55:56,501 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2025-03-09 00:55:56,501 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 445 flow [2025-03-09 00:55:56,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:56,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:56,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:56,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:55:56,501 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:56,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:56,502 INFO L85 PathProgramCache]: Analyzing trace with hash -525003459, now seen corresponding path program 1 times [2025-03-09 00:55:56,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:56,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288692664] [2025-03-09 00:55:56,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:56,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:56,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 00:55:56,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 00:55:56,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:56,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:56,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:56,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288692664] [2025-03-09 00:55:56,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288692664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:56,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:56,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:55:56,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875925356] [2025-03-09 00:55:56,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:56,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:55:56,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:56,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:55:56,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:55:56,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:55:56,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 445 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:56,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:56,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:55:56,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:57,099 INFO L124 PetriNetUnfolderBase]: 3194/6487 cut-off events. [2025-03-09 00:55:57,099 INFO L125 PetriNetUnfolderBase]: For 4314/4314 co-relation queries the response was YES. [2025-03-09 00:55:57,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17920 conditions, 6487 events. 3194/6487 cut-off events. For 4314/4314 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 42422 event pairs, 475 based on Foata normal form. 105/6410 useless extension candidates. Maximal degree in co-relation 14840. Up to 2632 conditions per place. [2025-03-09 00:55:57,137 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 109 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2025-03-09 00:55:57,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 133 transitions, 930 flow [2025-03-09 00:55:57,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:55:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:55:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2025-03-09 00:55:57,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5527272727272727 [2025-03-09 00:55:57,138 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 445 flow. Second operand 5 states and 152 transitions. [2025-03-09 00:55:57,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 133 transitions, 930 flow [2025-03-09 00:55:57,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 923 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:57,153 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 519 flow [2025-03-09 00:55:57,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=519, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2025-03-09 00:55:57,154 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 46 predicate places. [2025-03-09 00:55:57,154 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 519 flow [2025-03-09 00:55:57,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:57,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:57,154 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:57,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:55:57,154 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:57,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:57,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1020885159, now seen corresponding path program 1 times [2025-03-09 00:55:57,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:57,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70724689] [2025-03-09 00:55:57,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:57,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:57,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 00:55:57,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 00:55:57,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:57,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:57,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:57,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70724689] [2025-03-09 00:55:57,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70724689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:57,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:57,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 00:55:57,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475249109] [2025-03-09 00:55:57,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:57,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 00:55:57,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:57,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 00:55:57,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:55:57,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:55:57,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 519 flow. Second operand has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:57,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:57,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:55:57,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:58,751 INFO L124 PetriNetUnfolderBase]: 4726/9654 cut-off events. [2025-03-09 00:55:58,751 INFO L125 PetriNetUnfolderBase]: For 8698/8698 co-relation queries the response was YES. [2025-03-09 00:55:58,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26991 conditions, 9654 events. 4726/9654 cut-off events. For 8698/8698 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 67247 event pairs, 1022 based on Foata normal form. 24/9464 useless extension candidates. Maximal degree in co-relation 21486. Up to 4678 conditions per place. [2025-03-09 00:55:58,801 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 181 selfloop transitions, 24 changer transitions 0/219 dead transitions. [2025-03-09 00:55:58,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 219 transitions, 1565 flow [2025-03-09 00:55:58,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:55:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 00:55:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 316 transitions. [2025-03-09 00:55:58,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5223140495867769 [2025-03-09 00:55:58,803 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 519 flow. Second operand 11 states and 316 transitions. [2025-03-09 00:55:58,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 219 transitions, 1565 flow [2025-03-09 00:55:58,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 219 transitions, 1563 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:58,827 INFO L231 Difference]: Finished difference. Result has 111 places, 105 transitions, 733 flow [2025-03-09 00:55:58,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=733, PETRI_PLACES=111, PETRI_TRANSITIONS=105} [2025-03-09 00:55:58,828 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 61 predicate places. [2025-03-09 00:55:58,828 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 105 transitions, 733 flow [2025-03-09 00:55:58,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:58,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:58,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:58,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:55:58,828 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:58,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:58,829 INFO L85 PathProgramCache]: Analyzing trace with hash 600345905, now seen corresponding path program 1 times [2025-03-09 00:55:58,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:58,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208458494] [2025-03-09 00:55:58,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:58,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:58,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 00:55:58,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 00:55:58,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:58,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:58,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:58,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208458494] [2025-03-09 00:55:58,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208458494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:58,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:58,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:55:58,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996184446] [2025-03-09 00:55:58,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:58,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:55:58,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:58,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:55:58,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:55:58,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:55:58,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 105 transitions, 733 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:58,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:58,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:55:58,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:00,070 INFO L124 PetriNetUnfolderBase]: 6719/14120 cut-off events. [2025-03-09 00:56:00,070 INFO L125 PetriNetUnfolderBase]: For 17900/17900 co-relation queries the response was YES. [2025-03-09 00:56:00,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40957 conditions, 14120 events. 6719/14120 cut-off events. For 17900/17900 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 111167 event pairs, 2587 based on Foata normal form. 409/14206 useless extension candidates. Maximal degree in co-relation 33123. Up to 6552 conditions per place. [2025-03-09 00:56:00,164 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 222 selfloop transitions, 3 changer transitions 0/239 dead transitions. [2025-03-09 00:56:00,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 239 transitions, 2206 flow [2025-03-09 00:56:00,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:56:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:56:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-03-09 00:56:00,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6681818181818182 [2025-03-09 00:56:00,165 INFO L175 Difference]: Start difference. First operand has 111 places, 105 transitions, 733 flow. Second operand 4 states and 147 transitions. [2025-03-09 00:56:00,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 239 transitions, 2206 flow [2025-03-09 00:56:00,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 239 transitions, 2166 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-03-09 00:56:00,216 INFO L231 Difference]: Finished difference. Result has 112 places, 106 transitions, 731 flow [2025-03-09 00:56:00,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=731, PETRI_PLACES=112, PETRI_TRANSITIONS=106} [2025-03-09 00:56:00,216 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 62 predicate places. [2025-03-09 00:56:00,216 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 106 transitions, 731 flow [2025-03-09 00:56:00,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:00,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:00,217 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:00,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:56:00,217 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:00,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1030747285, now seen corresponding path program 1 times [2025-03-09 00:56:00,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:00,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924056818] [2025-03-09 00:56:00,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:00,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 00:56:00,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 00:56:00,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:00,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:00,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:00,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924056818] [2025-03-09 00:56:00,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924056818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:56:00,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717824443] [2025-03-09 00:56:00,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:00,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:00,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:00,486 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:00,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:56:00,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 00:56:00,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 00:56:00,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:00,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:00,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 00:56:00,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:00,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:00,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717824443] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:00,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:56:00,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2025-03-09 00:56:00,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502953396] [2025-03-09 00:56:00,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:00,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 00:56:00,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:00,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 00:56:00,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-09 00:56:01,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:01,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 106 transitions, 731 flow. Second operand has 19 states, 19 states have (on average 19.94736842105263) internal successors, (379), 19 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:01,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:01,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:01,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:04,419 INFO L124 PetriNetUnfolderBase]: 14081/28810 cut-off events. [2025-03-09 00:56:04,419 INFO L125 PetriNetUnfolderBase]: For 45206/45206 co-relation queries the response was YES. [2025-03-09 00:56:04,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89412 conditions, 28810 events. 14081/28810 cut-off events. For 45206/45206 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 241156 event pairs, 2136 based on Foata normal form. 268/28335 useless extension candidates. Maximal degree in co-relation 52741. Up to 4582 conditions per place. [2025-03-09 00:56:04,675 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 383 selfloop transitions, 94 changer transitions 0/490 dead transitions. [2025-03-09 00:56:04,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 490 transitions, 3889 flow [2025-03-09 00:56:04,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 00:56:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 00:56:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 670 transitions. [2025-03-09 00:56:04,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5537190082644629 [2025-03-09 00:56:04,678 INFO L175 Difference]: Start difference. First operand has 112 places, 106 transitions, 731 flow. Second operand 22 states and 670 transitions. [2025-03-09 00:56:04,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 490 transitions, 3889 flow [2025-03-09 00:56:04,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 490 transitions, 3822 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-03-09 00:56:04,787 INFO L231 Difference]: Finished difference. Result has 147 places, 172 transitions, 1686 flow [2025-03-09 00:56:04,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1686, PETRI_PLACES=147, PETRI_TRANSITIONS=172} [2025-03-09 00:56:04,788 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 97 predicate places. [2025-03-09 00:56:04,788 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 172 transitions, 1686 flow [2025-03-09 00:56:04,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 19.94736842105263) internal successors, (379), 19 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:04,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:04,788 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:04,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:04,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 00:56:04,993 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:04,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:04,993 INFO L85 PathProgramCache]: Analyzing trace with hash -661189034, now seen corresponding path program 1 times [2025-03-09 00:56:04,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:04,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355720559] [2025-03-09 00:56:04,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:04,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:05,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 00:56:05,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 00:56:05,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:05,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:05,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:05,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355720559] [2025-03-09 00:56:05,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355720559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:56:05,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520454570] [2025-03-09 00:56:05,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:05,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:05,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:05,140 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:05,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:56:05,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 00:56:05,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 00:56:05,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:05,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:05,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 00:56:05,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:05,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:05,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520454570] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:05,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:56:05,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-03-09 00:56:05,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143876551] [2025-03-09 00:56:05,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:05,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:56:05,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:05,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:56:05,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:56:05,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:56:05,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 172 transitions, 1686 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:05,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:05,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:56:05,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:08,248 INFO L124 PetriNetUnfolderBase]: 12530/25897 cut-off events. [2025-03-09 00:56:08,249 INFO L125 PetriNetUnfolderBase]: For 63990/63990 co-relation queries the response was YES. [2025-03-09 00:56:08,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85528 conditions, 25897 events. 12530/25897 cut-off events. For 63990/63990 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 209003 event pairs, 3718 based on Foata normal form. 21/25255 useless extension candidates. Maximal degree in co-relation 81399. Up to 19270 conditions per place. [2025-03-09 00:56:08,487 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 181 selfloop transitions, 15 changer transitions 0/210 dead transitions. [2025-03-09 00:56:08,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 210 transitions, 2153 flow [2025-03-09 00:56:08,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:56:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:56:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2025-03-09 00:56:08,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2025-03-09 00:56:08,489 INFO L175 Difference]: Start difference. First operand has 147 places, 172 transitions, 1686 flow. Second operand 6 states and 189 transitions. [2025-03-09 00:56:08,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 210 transitions, 2153 flow [2025-03-09 00:56:08,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 210 transitions, 2052 flow, removed 46 selfloop flow, removed 3 redundant places. [2025-03-09 00:56:08,705 INFO L231 Difference]: Finished difference. Result has 152 places, 158 transitions, 1492 flow [2025-03-09 00:56:08,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=152, PETRI_TRANSITIONS=158} [2025-03-09 00:56:08,705 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 102 predicate places. [2025-03-09 00:56:08,705 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 158 transitions, 1492 flow [2025-03-09 00:56:08,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:08,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:08,706 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:08,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:08,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:08,906 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:08,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:08,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2069999334, now seen corresponding path program 1 times [2025-03-09 00:56:08,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:08,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900331020] [2025-03-09 00:56:08,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:08,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:08,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 00:56:08,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:56:08,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:08,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:56:08,926 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:56:08,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 00:56:08,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:56:08,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:08,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:56:08,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:56:08,968 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:56:08,969 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2025-03-09 00:56:08,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-03-09 00:56:08,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2025-03-09 00:56:08,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2025-03-09 00:56:08,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-09 00:56:08,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-09 00:56:08,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2025-03-09 00:56:08,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-09 00:56:08,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-09 00:56:08,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2025-03-09 00:56:08,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-09 00:56:08,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-03-09 00:56:08,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-03-09 00:56:08,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-03-09 00:56:08,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2025-03-09 00:56:08,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 00:56:08,972 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:09,010 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 00:56:09,011 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 00:56:09,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 12:56:09 BasicIcfg [2025-03-09 00:56:09,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 00:56:09,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 00:56:09,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 00:56:09,018 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 00:56:09,019 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:49" (3/4) ... [2025-03-09 00:56:09,020 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 00:56:09,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 00:56:09,021 INFO L158 Benchmark]: Toolchain (without parser) took 20319.75ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 109.1MB in the beginning and 550.1MB in the end (delta: -441.0MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-03-09 00:56:09,021 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:56:09,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.98ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 80.1MB in the end (delta: 29.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 00:56:09,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.08ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 77.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:56:09,022 INFO L158 Benchmark]: Boogie Preprocessor took 30.77ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 75.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:56:09,022 INFO L158 Benchmark]: IcfgBuilder took 486.28ms. Allocated memory is still 142.6MB. Free memory was 75.5MB in the beginning and 106.2MB in the end (delta: -30.6MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2025-03-09 00:56:09,023 INFO L158 Benchmark]: TraceAbstraction took 19271.32ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 106.2MB in the beginning and 550.3MB in the end (delta: -444.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-03-09 00:56:09,023 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 1.6GB. Free memory was 550.3MB in the beginning and 550.1MB in the end (delta: 174.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 00:56:09,024 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.25ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.98ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 80.1MB in the end (delta: 29.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.08ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 77.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.77ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 75.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 486.28ms. Allocated memory is still 142.6MB. Free memory was 75.5MB in the beginning and 106.2MB in the end (delta: -30.6MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19271.32ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 106.2MB in the beginning and 550.3MB in the end (delta: -444.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 1.6GB. Free memory was 550.3MB in the beginning and 550.1MB in the end (delta: 174.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [arr={3:0}, flag=0, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, id2=0, m={4:0}, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; VAL [\old(stack)={3:0}, \old(x)=4, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, top=1, x=4] [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=4, top=1] [L1007] COND TRUE 2 i<(5) VAL [arr={3:0}, flag=1, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); VAL [\old(stack)={3:0}, \result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, top=0] [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] CALL 2 reach_error() [L20] COND FALSE 2 !(0) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L20] 2 __assert_fail ("0", "stack-2.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: 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: 1024]: 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 locations, 102 edges, 15 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: 19.1s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1562 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1513 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4691 IncrementalHoareTripleChecker+Invalid, 4734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 9 mSDtfsCounter, 4691 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1686occurred in iteration=15, InterpolantAutomatonStates: 110, 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.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 447 ConstructedInterpolants, 0 QuantifiedInterpolants, 3924 SizeOfPredicates, 14 NumberOfNonLiveVariables, 663 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 3/54 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-03-09 00:56:09,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/stack-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:56:11,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:56:11,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-09 00:56:11,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:56:11,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:56:11,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:56:11,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:56:11,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:56:11,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:56:11,143 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:56:11,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:56:11,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:56:11,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:56:11,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:56:11,145 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:56:11,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:56:11,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:56:11,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:56:11,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:56:11,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:56:11,145 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:56:11,145 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:56:11,145 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:56:11,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:56:11,145 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:56:11,145 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 00:56:11,145 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 00:56:11,145 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:56:11,145 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:56:11,145 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:56:11,146 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:56:11,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:56:11,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:56:11,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:56:11,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:56:11,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:56:11,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:56:11,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:56:11,146 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 00:56:11,146 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 00:56:11,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:56:11,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:56:11,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:56:11,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:56:11,146 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2025-03-09 00:56:11,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:56:11,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:56:11,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:56:11,392 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:56:11,393 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:56:11,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-2.i [2025-03-09 00:56:12,569 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e64ef90/83642afa00084e75918cf0b578def7ec/FLAG50f5e32ed [2025-03-09 00:56:12,824 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:56:12,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2025-03-09 00:56:12,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e64ef90/83642afa00084e75918cf0b578def7ec/FLAG50f5e32ed [2025-03-09 00:56:12,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e64ef90/83642afa00084e75918cf0b578def7ec [2025-03-09 00:56:12,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:56:12,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:56:12,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:56:12,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:56:12,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:56:12,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:56:12" (1/1) ... [2025-03-09 00:56:12,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2757b2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:12, skipping insertion in model container [2025-03-09 00:56:12,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:56:12" (1/1) ... [2025-03-09 00:56:12,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:56:13,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:56:13,217 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:56:13,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:56:13,310 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:56:13,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:13 WrapperNode [2025-03-09 00:56:13,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:56:13,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:56:13,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:56:13,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:56:13,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:13" (1/1) ... [2025-03-09 00:56:13,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:13" (1/1) ... [2025-03-09 00:56:13,361 INFO L138 Inliner]: procedures = 281, calls = 37, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 151 [2025-03-09 00:56:13,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:56:13,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:56:13,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:56:13,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:56:13,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:13" (1/1) ... [2025-03-09 00:56:13,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:13" (1/1) ... [2025-03-09 00:56:13,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:13" (1/1) ... [2025-03-09 00:56:13,396 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 0, 1]. [2025-03-09 00:56:13,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:13" (1/1) ... [2025-03-09 00:56:13,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:13" (1/1) ... [2025-03-09 00:56:13,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:13" (1/1) ... [2025-03-09 00:56:13,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:13" (1/1) ... [2025-03-09 00:56:13,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:13" (1/1) ... [2025-03-09 00:56:13,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:13" (1/1) ... [2025-03-09 00:56:13,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:56:13,420 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:56:13,420 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:56:13,420 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:56:13,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:13" (1/1) ... [2025-03-09 00:56:13,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:56:13,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:13,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:56:13,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:56:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-09 00:56:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-09 00:56:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-09 00:56:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-09 00:56:13,500 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-09 00:56:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-09 00:56:13,500 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-09 00:56:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-09 00:56:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-09 00:56:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-09 00:56:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 00:56:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-09 00:56:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-09 00:56:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-09 00:56:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-09 00:56:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-09 00:56:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 00:56:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 00:56:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:56:13,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:56:13,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:56:13,503 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:56:13,632 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:56:13,633 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:56:13,898 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: pop_#res#1 := 0bv32; [2025-03-09 00:56:13,899 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc pop_#t~mem38#1; [2025-03-09 00:56:13,899 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: havoc pop_#t~ret37#1; [2025-03-09 00:56:13,900 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:56:13,900 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:56:14,077 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:56:14,077 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:56:14,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:56:14 BoogieIcfgContainer [2025-03-09 00:56:14,077 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:56:14,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:56:14,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:56:14,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:56:14,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:56:12" (1/3) ... [2025-03-09 00:56:14,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afc5feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:56:14, skipping insertion in model container [2025-03-09 00:56:14,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:13" (2/3) ... [2025-03-09 00:56:14,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afc5feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:56:14, skipping insertion in model container [2025-03-09 00:56:14,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:56:14" (3/3) ... [2025-03-09 00:56:14,087 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-2.i [2025-03-09 00:56:14,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:56:14,099 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-2.i that has 3 procedures, 47 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-09 00:56:14,099 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:56:14,145 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 00:56:14,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2025-03-09 00:56:14,187 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2025-03-09 00:56:14,189 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 00:56:14,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 53 events. 9/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 142 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 48. Up to 3 conditions per place. [2025-03-09 00:56:14,195 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2025-03-09 00:56:14,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2025-03-09 00:56:14,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:56:14,233 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;@f517c37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:56:14,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-09 00:56:14,243 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:56:14,244 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-09 00:56:14,244 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 00:56:14,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:14,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:14,245 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:14,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:14,249 INFO L85 PathProgramCache]: Analyzing trace with hash 939487435, now seen corresponding path program 1 times [2025-03-09 00:56:14,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:14,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048392267] [2025-03-09 00:56:14,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:14,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:14,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:14,260 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:14,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:56:14,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:56:14,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:56:14,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:14,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:14,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:56:14,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:14,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:14,439 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:14,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048392267] [2025-03-09 00:56:14,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048392267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:14,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:14,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:56:14,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179677601] [2025-03-09 00:56:14,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:14,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:56:14,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:14,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:56:14,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:56:14,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:14,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:14,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:14,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:14,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:14,766 INFO L124 PetriNetUnfolderBase]: 459/880 cut-off events. [2025-03-09 00:56:14,766 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-09 00:56:14,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 880 events. 459/880 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4532 event pairs, 245 based on Foata normal form. 94/846 useless extension candidates. Maximal degree in co-relation 1574. Up to 520 conditions per place. [2025-03-09 00:56:14,777 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2025-03-09 00:56:14,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2025-03-09 00:56:14,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:56:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:56:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-09 00:56:14,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2025-03-09 00:56:14,788 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2025-03-09 00:56:14,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2025-03-09 00:56:14,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 00:56:14,796 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2025-03-09 00:56:14,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2025-03-09 00:56:14,801 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2025-03-09 00:56:14,801 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2025-03-09 00:56:14,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:14,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:14,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:14,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:56:15,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:15,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:15,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash 939487436, now seen corresponding path program 1 times [2025-03-09 00:56:15,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:15,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [759476608] [2025-03-09 00:56:15,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:15,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:15,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:15,006 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:15,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:56:15,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:56:15,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:56:15,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:15,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:15,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 00:56:15,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:15,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:15,234 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:15,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759476608] [2025-03-09 00:56:15,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759476608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:15,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:15,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:56:15,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057127165] [2025-03-09 00:56:15,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:15,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:56:15,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:15,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:56:15,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:56:15,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:15,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:15,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:15,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:15,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:15,571 INFO L124 PetriNetUnfolderBase]: 755/1387 cut-off events. [2025-03-09 00:56:15,571 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-09 00:56:15,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1387 events. 755/1387 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7430 event pairs, 125 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 810. Up to 848 conditions per place. [2025-03-09 00:56:15,582 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2025-03-09 00:56:15,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2025-03-09 00:56:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:56:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:56:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2025-03-09 00:56:15,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2025-03-09 00:56:15,584 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2025-03-09 00:56:15,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2025-03-09 00:56:15,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 00:56:15,602 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2025-03-09 00:56:15,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2025-03-09 00:56:15,603 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-03-09 00:56:15,603 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2025-03-09 00:56:15,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:15,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:15,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:15,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:56:15,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:15,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:15,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:15,804 INFO L85 PathProgramCache]: Analyzing trace with hash -494442056, now seen corresponding path program 1 times [2025-03-09 00:56:15,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:15,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012725252] [2025-03-09 00:56:15,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:15,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:15,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:15,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:15,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:56:15,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:56:15,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:56:15,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:15,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:15,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 00:56:15,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:15,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:15,893 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:15,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012725252] [2025-03-09 00:56:15,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012725252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:15,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:15,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:56:15,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921139452] [2025-03-09 00:56:15,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:15,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:56:15,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:15,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:56:15,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:56:15,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2025-03-09 00:56:15,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:15,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:15,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2025-03-09 00:56:15,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:16,071 INFO L124 PetriNetUnfolderBase]: 793/1518 cut-off events. [2025-03-09 00:56:16,072 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-09 00:56:16,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3136 conditions, 1518 events. 793/1518 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7894 event pairs, 348 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 3051. Up to 734 conditions per place. [2025-03-09 00:56:16,078 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 56 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2025-03-09 00:56:16,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 303 flow [2025-03-09 00:56:16,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:56:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:56:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-09 00:56:16,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2025-03-09 00:56:16,080 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 3 states and 102 transitions. [2025-03-09 00:56:16,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 303 flow [2025-03-09 00:56:16,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 301 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 00:56:16,082 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 148 flow [2025-03-09 00:56:16,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2025-03-09 00:56:16,083 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2025-03-09 00:56:16,083 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 148 flow [2025-03-09 00:56:16,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:16,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:16,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:16,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:56:16,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:16,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:16,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:16,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1455851410, now seen corresponding path program 1 times [2025-03-09 00:56:16,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:16,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1237924952] [2025-03-09 00:56:16,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:16,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:16,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:16,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:16,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:56:16,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 00:56:16,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 00:56:16,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:16,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:16,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:56:16,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:16,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:16,362 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:16,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237924952] [2025-03-09 00:56:16,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237924952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:16,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:16,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:56:16,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570870628] [2025-03-09 00:56:16,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:16,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:56:16,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:16,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:56:16,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:56:16,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:56:16,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:16,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:16,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:56:16,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:16,629 INFO L124 PetriNetUnfolderBase]: 1096/2098 cut-off events. [2025-03-09 00:56:16,630 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2025-03-09 00:56:16,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4357 conditions, 2098 events. 1096/2098 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12179 event pairs, 518 based on Foata normal form. 0/1954 useless extension candidates. Maximal degree in co-relation 1577. Up to 1077 conditions per place. [2025-03-09 00:56:16,643 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 68 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2025-03-09 00:56:16,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 386 flow [2025-03-09 00:56:16,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:56:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:56:16,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-03-09 00:56:16,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2025-03-09 00:56:16,647 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 148 flow. Second operand 4 states and 139 transitions. [2025-03-09 00:56:16,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 386 flow [2025-03-09 00:56:16,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:56:16,650 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 175 flow [2025-03-09 00:56:16,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2025-03-09 00:56:16,650 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2025-03-09 00:56:16,650 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 175 flow [2025-03-09 00:56:16,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:16,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:16,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:16,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 00:56:16,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:16,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:16,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:16,852 INFO L85 PathProgramCache]: Analyzing trace with hash -647619105, now seen corresponding path program 1 times [2025-03-09 00:56:16,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:16,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581765248] [2025-03-09 00:56:16,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:16,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:16,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:16,856 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:16,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:56:16,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:56:16,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:56:16,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:16,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:16,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 00:56:16,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:16,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:16,941 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:16,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581765248] [2025-03-09 00:56:16,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581765248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:16,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:16,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:56:16,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190847108] [2025-03-09 00:56:16,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:16,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:56:16,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:16,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:56:16,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:56:16,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:16,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 175 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-03-09 00:56:16,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:16,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:16,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:17,094 INFO L124 PetriNetUnfolderBase]: 1073/2088 cut-off events. [2025-03-09 00:56:17,094 INFO L125 PetriNetUnfolderBase]: For 403/403 co-relation queries the response was YES. [2025-03-09 00:56:17,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 2088 events. 1073/2088 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 12307 event pairs, 864 based on Foata normal form. 5/1944 useless extension candidates. Maximal degree in co-relation 1711. Up to 1736 conditions per place. [2025-03-09 00:56:17,102 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 35 selfloop transitions, 1 changer transitions 2/52 dead transitions. [2025-03-09 00:56:17,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 247 flow [2025-03-09 00:56:17,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:56:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:56:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-03-09 00:56:17,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-03-09 00:56:17,104 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 175 flow. Second operand 3 states and 80 transitions. [2025-03-09 00:56:17,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 247 flow [2025-03-09 00:56:17,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 242 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 00:56:17,110 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 165 flow [2025-03-09 00:56:17,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-03-09 00:56:17,111 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2025-03-09 00:56:17,112 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 165 flow [2025-03-09 00:56:17,112 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-03-09 00:56:17,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:17,112 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:17,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:17,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:17,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:17,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:17,313 INFO L85 PathProgramCache]: Analyzing trace with hash 748124068, now seen corresponding path program 1 times [2025-03-09 00:56:17,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:17,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379097812] [2025-03-09 00:56:17,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:17,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:17,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:17,315 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:17,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:56:17,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:56:17,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:56:17,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:17,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:17,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 00:56:17,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:17,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:17,815 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:17,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379097812] [2025-03-09 00:56:17,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379097812] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:17,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:56:17,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-03-09 00:56:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896583429] [2025-03-09 00:56:17,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:17,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 00:56:17,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:17,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 00:56:17,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:56:17,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:17,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 165 flow. Second operand has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:17,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:17,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:17,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:21,551 INFO L124 PetriNetUnfolderBase]: 5287/10032 cut-off events. [2025-03-09 00:56:21,551 INFO L125 PetriNetUnfolderBase]: For 2264/2264 co-relation queries the response was YES. [2025-03-09 00:56:21,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22136 conditions, 10032 events. 5287/10032 cut-off events. For 2264/2264 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 69726 event pairs, 756 based on Foata normal form. 264/9688 useless extension candidates. Maximal degree in co-relation 22121. Up to 1753 conditions per place. [2025-03-09 00:56:21,619 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 317 selfloop transitions, 45 changer transitions 0/375 dead transitions. [2025-03-09 00:56:21,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 375 transitions, 1774 flow [2025-03-09 00:56:21,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 00:56:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-09 00:56:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 679 transitions. [2025-03-09 00:56:21,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6172727272727273 [2025-03-09 00:56:21,622 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 165 flow. Second operand 20 states and 679 transitions. [2025-03-09 00:56:21,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 375 transitions, 1774 flow [2025-03-09 00:56:21,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 375 transitions, 1773 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:56:21,631 INFO L231 Difference]: Finished difference. Result has 88 places, 95 transitions, 582 flow [2025-03-09 00:56:21,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=582, PETRI_PLACES=88, PETRI_TRANSITIONS=95} [2025-03-09 00:56:21,632 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2025-03-09 00:56:21,632 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 582 flow [2025-03-09 00:56:21,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:21,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:21,632 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:21,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 00:56:21,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:21,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:21,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:21,833 INFO L85 PathProgramCache]: Analyzing trace with hash 633992643, now seen corresponding path program 1 times [2025-03-09 00:56:21,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:21,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [322122922] [2025-03-09 00:56:21,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:21,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:21,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:21,836 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:21,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:56:21,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 00:56:21,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 00:56:21,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:21,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:21,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:56:21,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:21,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:21,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:21,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322122922] [2025-03-09 00:56:21,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322122922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:21,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:21,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:56:21,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113088487] [2025-03-09 00:56:21,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:21,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:56:21,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:21,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:56:21,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:56:21,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:21,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 95 transitions, 582 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-03-09 00:56:21,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:21,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:21,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:22,821 INFO L124 PetriNetUnfolderBase]: 5035/9490 cut-off events. [2025-03-09 00:56:22,821 INFO L125 PetriNetUnfolderBase]: For 9599/9599 co-relation queries the response was YES. [2025-03-09 00:56:22,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24504 conditions, 9490 events. 5035/9490 cut-off events. For 9599/9599 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 66025 event pairs, 3115 based on Foata normal form. 0/9112 useless extension candidates. Maximal degree in co-relation 24473. Up to 6346 conditions per place. [2025-03-09 00:56:22,866 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 121 selfloop transitions, 3 changer transitions 0/137 dead transitions. [2025-03-09 00:56:22,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 137 transitions, 1146 flow [2025-03-09 00:56:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:56:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:56:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-09 00:56:22,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-03-09 00:56:22,868 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 582 flow. Second operand 4 states and 108 transitions. [2025-03-09 00:56:22,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 137 transitions, 1146 flow [2025-03-09 00:56:22,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 137 transitions, 1054 flow, removed 45 selfloop flow, removed 1 redundant places. [2025-03-09 00:56:22,897 INFO L231 Difference]: Finished difference. Result has 89 places, 94 transitions, 522 flow [2025-03-09 00:56:22,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=522, PETRI_PLACES=89, PETRI_TRANSITIONS=94} [2025-03-09 00:56:22,898 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 39 predicate places. [2025-03-09 00:56:22,899 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 522 flow [2025-03-09 00:56:22,899 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-03-09 00:56:22,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:22,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:22,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 00:56:23,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:23,100 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:23,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:23,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1023411002, now seen corresponding path program 1 times [2025-03-09 00:56:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:23,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [132538780] [2025-03-09 00:56:23,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:23,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:23,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:23,107 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:23,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:56:23,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 00:56:23,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 00:56:23,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:23,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:23,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:56:23,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:23,192 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-03-09 00:56:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:23,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:23,208 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:23,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132538780] [2025-03-09 00:56:23,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132538780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:23,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:23,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:56:23,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560327143] [2025-03-09 00:56:23,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:23,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:56:23,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:23,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:56:23,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:56:23,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:56:23,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 94 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:23,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:23,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:56:23,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:23,634 INFO L124 PetriNetUnfolderBase]: 2498/5164 cut-off events. [2025-03-09 00:56:23,634 INFO L125 PetriNetUnfolderBase]: For 2566/2566 co-relation queries the response was YES. [2025-03-09 00:56:23,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12233 conditions, 5164 events. 2498/5164 cut-off events. For 2566/2566 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 32183 event pairs, 576 based on Foata normal form. 358/5387 useless extension candidates. Maximal degree in co-relation 12201. Up to 3021 conditions per place. [2025-03-09 00:56:23,669 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 67 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2025-03-09 00:56:23,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 84 transitions, 555 flow [2025-03-09 00:56:23,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:56:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:56:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-09 00:56:23,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5636363636363636 [2025-03-09 00:56:23,671 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 522 flow. Second operand 3 states and 93 transitions. [2025-03-09 00:56:23,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 84 transitions, 555 flow [2025-03-09 00:56:23,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 533 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-03-09 00:56:23,684 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 377 flow [2025-03-09 00:56:23,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=377, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2025-03-09 00:56:23,685 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 28 predicate places. [2025-03-09 00:56:23,685 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 377 flow [2025-03-09 00:56:23,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:23,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:23,685 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-03-09 00:56:23,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 00:56:23,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:23,889 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:23,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:23,889 INFO L85 PathProgramCache]: Analyzing trace with hash -189585459, now seen corresponding path program 1 times [2025-03-09 00:56:23,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:23,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700923312] [2025-03-09 00:56:23,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:23,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:23,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:23,891 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:23,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 00:56:23,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:56:23,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:56:23,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:23,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:23,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 00:56:23,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:24,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:24,198 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:24,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700923312] [2025-03-09 00:56:24,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700923312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:24,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:24,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:56:24,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529440168] [2025-03-09 00:56:24,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:24,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:56:24,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:24,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:56:24,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:56:24,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:24,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 377 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:24,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:24,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:24,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:24,792 INFO L124 PetriNetUnfolderBase]: 2523/5159 cut-off events. [2025-03-09 00:56:24,792 INFO L125 PetriNetUnfolderBase]: For 2045/2045 co-relation queries the response was YES. [2025-03-09 00:56:24,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12409 conditions, 5159 events. 2523/5159 cut-off events. For 2045/2045 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 31572 event pairs, 901 based on Foata normal form. 0/4986 useless extension candidates. Maximal degree in co-relation 12383. Up to 3411 conditions per place. [2025-03-09 00:56:24,807 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 99 selfloop transitions, 9 changer transitions 0/120 dead transitions. [2025-03-09 00:56:24,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 120 transitions, 719 flow [2025-03-09 00:56:24,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:56:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:56:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2025-03-09 00:56:24,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2025-03-09 00:56:24,809 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 377 flow. Second operand 6 states and 182 transitions. [2025-03-09 00:56:24,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 120 transitions, 719 flow [2025-03-09 00:56:24,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 120 transitions, 708 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:56:24,817 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 417 flow [2025-03-09 00:56:24,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=417, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2025-03-09 00:56:24,817 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2025-03-09 00:56:24,817 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 417 flow [2025-03-09 00:56:24,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:24,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:24,818 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:24,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 00:56:25,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:25,022 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:25,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:25,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1411777781, now seen corresponding path program 1 times [2025-03-09 00:56:25,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:25,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426954235] [2025-03-09 00:56:25,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:25,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:25,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:25,026 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:25,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 00:56:25,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 00:56:25,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 00:56:25,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:25,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:25,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:56:25,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:25,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:25,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:25,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426954235] [2025-03-09 00:56:25,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426954235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:25,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:25,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:56:25,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637326557] [2025-03-09 00:56:25,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:25,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:56:25,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:25,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:56:25,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:56:25,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:56:25,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 417 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:25,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:25,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:56:25,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:25,449 INFO L124 PetriNetUnfolderBase]: 2452/5046 cut-off events. [2025-03-09 00:56:25,449 INFO L125 PetriNetUnfolderBase]: For 2184/2184 co-relation queries the response was YES. [2025-03-09 00:56:25,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12147 conditions, 5046 events. 2452/5046 cut-off events. For 2184/2184 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 30967 event pairs, 872 based on Foata normal form. 7/4915 useless extension candidates. Maximal degree in co-relation 12116. Up to 3351 conditions per place. [2025-03-09 00:56:25,472 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 92 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2025-03-09 00:56:25,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 112 transitions, 709 flow [2025-03-09 00:56:25,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:56:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:56:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-03-09 00:56:25,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5890909090909091 [2025-03-09 00:56:25,474 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 417 flow. Second operand 5 states and 162 transitions. [2025-03-09 00:56:25,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 112 transitions, 709 flow [2025-03-09 00:56:25,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 700 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 00:56:25,482 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 422 flow [2025-03-09 00:56:25,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-03-09 00:56:25,483 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2025-03-09 00:56:25,483 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 422 flow [2025-03-09 00:56:25,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:25,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:25,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:25,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:25,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:25,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:25,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:25,684 INFO L85 PathProgramCache]: Analyzing trace with hash 846716245, now seen corresponding path program 1 times [2025-03-09 00:56:25,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:25,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [905507821] [2025-03-09 00:56:25,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:25,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:25,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:25,687 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:25,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 00:56:25,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 00:56:25,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 00:56:25,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:25,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:25,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 00:56:25,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:25,924 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 15 treesize of output 1 [2025-03-09 00:56:26,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 00:56:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:26,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:26,086 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:26,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905507821] [2025-03-09 00:56:26,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905507821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:26,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:26,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 00:56:26,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100338706] [2025-03-09 00:56:26,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:26,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 00:56:26,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:26,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 00:56:26,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:56:26,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2025-03-09 00:56:26,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 422 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:26,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:26,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2025-03-09 00:56:26,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:27,091 INFO L124 PetriNetUnfolderBase]: 3822/7704 cut-off events. [2025-03-09 00:56:27,091 INFO L125 PetriNetUnfolderBase]: For 3627/3627 co-relation queries the response was YES. [2025-03-09 00:56:27,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18786 conditions, 7704 events. 3822/7704 cut-off events. For 3627/3627 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 48420 event pairs, 1169 based on Foata normal form. 0/7488 useless extension candidates. Maximal degree in co-relation 18754. Up to 3514 conditions per place. [2025-03-09 00:56:27,120 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 170 selfloop transitions, 21 changer transitions 0/202 dead transitions. [2025-03-09 00:56:27,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 202 transitions, 1289 flow [2025-03-09 00:56:27,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:56:27,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 00:56:27,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 365 transitions. [2025-03-09 00:56:27,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.474025974025974 [2025-03-09 00:56:27,123 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 422 flow. Second operand 14 states and 365 transitions. [2025-03-09 00:56:27,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 202 transitions, 1289 flow [2025-03-09 00:56:27,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 202 transitions, 1269 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 00:56:27,134 INFO L231 Difference]: Finished difference. Result has 100 places, 85 transitions, 530 flow [2025-03-09 00:56:27,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=530, PETRI_PLACES=100, PETRI_TRANSITIONS=85} [2025-03-09 00:56:27,135 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 50 predicate places. [2025-03-09 00:56:27,135 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 85 transitions, 530 flow [2025-03-09 00:56:27,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:27,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:27,135 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:27,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:27,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:27,336 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:27,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:27,336 INFO L85 PathProgramCache]: Analyzing trace with hash -83066837, now seen corresponding path program 1 times [2025-03-09 00:56:27,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:27,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805833315] [2025-03-09 00:56:27,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:27,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:27,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:27,338 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:27,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 00:56:27,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 00:56:27,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 00:56:27,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:27,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:27,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 00:56:27,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:27,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:27,975 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:27,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805833315] [2025-03-09 00:56:27,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805833315] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:27,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:56:27,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2025-03-09 00:56:27,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707201548] [2025-03-09 00:56:27,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:27,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 00:56:27,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:27,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 00:56:27,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:56:28,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:28,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 85 transitions, 530 flow. Second operand has 12 states, 12 states have (on average 20.166666666666668) internal successors, (242), 12 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:28,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:28,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:28,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:32,380 INFO L124 PetriNetUnfolderBase]: 8991/18496 cut-off events. [2025-03-09 00:56:32,380 INFO L125 PetriNetUnfolderBase]: For 10335/10335 co-relation queries the response was YES. [2025-03-09 00:56:32,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45482 conditions, 18496 events. 8991/18496 cut-off events. For 10335/10335 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 139913 event pairs, 2624 based on Foata normal form. 88/18080 useless extension candidates. Maximal degree in co-relation 45447. Up to 2996 conditions per place. [2025-03-09 00:56:32,484 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 308 selfloop transitions, 63 changer transitions 0/383 dead transitions. [2025-03-09 00:56:32,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 383 transitions, 2539 flow [2025-03-09 00:56:32,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 00:56:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-09 00:56:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 616 transitions. [2025-03-09 00:56:32,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-03-09 00:56:32,487 INFO L175 Difference]: Start difference. First operand has 100 places, 85 transitions, 530 flow. Second operand 20 states and 616 transitions. [2025-03-09 00:56:32,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 383 transitions, 2539 flow [2025-03-09 00:56:32,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 383 transitions, 2477 flow, removed 9 selfloop flow, removed 8 redundant places. [2025-03-09 00:56:32,537 INFO L231 Difference]: Finished difference. Result has 126 places, 130 transitions, 996 flow [2025-03-09 00:56:32,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=996, PETRI_PLACES=126, PETRI_TRANSITIONS=130} [2025-03-09 00:56:32,537 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 76 predicate places. [2025-03-09 00:56:32,537 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 130 transitions, 996 flow [2025-03-09 00:56:32,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.166666666666668) internal successors, (242), 12 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:32,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:32,538 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:32,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 00:56:32,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:32,738 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:32,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:32,739 INFO L85 PathProgramCache]: Analyzing trace with hash 670266654, now seen corresponding path program 1 times [2025-03-09 00:56:32,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:32,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [940039994] [2025-03-09 00:56:32,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:32,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:32,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:32,741 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:32,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 00:56:32,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 00:56:32,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 00:56:32,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:32,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:32,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 00:56:32,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:32,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:33,307 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:33,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940039994] [2025-03-09 00:56:33,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940039994] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:33,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:56:33,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-03-09 00:56:33,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581924176] [2025-03-09 00:56:33,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:33,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 00:56:33,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:33,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 00:56:33,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:56:33,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:33,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 130 transitions, 996 flow. Second operand has 12 states, 12 states have (on average 19.5) internal successors, (234), 12 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:33,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:33,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:33,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:35,093 INFO L124 PetriNetUnfolderBase]: 8149/16803 cut-off events. [2025-03-09 00:56:35,093 INFO L125 PetriNetUnfolderBase]: For 18689/18689 co-relation queries the response was YES. [2025-03-09 00:56:35,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44162 conditions, 16803 events. 8149/16803 cut-off events. For 18689/18689 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 124584 event pairs, 3233 based on Foata normal form. 7/16402 useless extension candidates. Maximal degree in co-relation 44113. Up to 12397 conditions per place. [2025-03-09 00:56:35,176 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 149 selfloop transitions, 16 changer transitions 0/177 dead transitions. [2025-03-09 00:56:35,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 177 transitions, 1453 flow [2025-03-09 00:56:35,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:56:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 00:56:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions. [2025-03-09 00:56:35,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2025-03-09 00:56:35,178 INFO L175 Difference]: Start difference. First operand has 126 places, 130 transitions, 996 flow. Second operand 9 states and 237 transitions. [2025-03-09 00:56:35,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 177 transitions, 1453 flow [2025-03-09 00:56:35,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 177 transitions, 1403 flow, removed 21 selfloop flow, removed 2 redundant places. [2025-03-09 00:56:35,247 INFO L231 Difference]: Finished difference. Result has 135 places, 128 transitions, 998 flow [2025-03-09 00:56:35,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=998, PETRI_PLACES=135, PETRI_TRANSITIONS=128} [2025-03-09 00:56:35,248 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 85 predicate places. [2025-03-09 00:56:35,248 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 128 transitions, 998 flow [2025-03-09 00:56:35,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.5) internal successors, (234), 12 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:35,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:35,248 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:35,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 00:56:35,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:35,449 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:35,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:35,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1281406051, now seen corresponding path program 1 times [2025-03-09 00:56:35,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:35,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [893444385] [2025-03-09 00:56:35,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:35,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:35,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:35,452 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:35,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 00:56:35,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 00:56:35,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:56:35,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:35,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:35,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:56:35,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:35,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:35,626 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:35,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893444385] [2025-03-09 00:56:35,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893444385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:35,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:56:35,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-09 00:56:35,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787675875] [2025-03-09 00:56:35,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:35,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 00:56:35,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:35,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 00:56:35,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:56:35,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:56:35,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 128 transitions, 998 flow. Second operand has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:35,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:35,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:56:35,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:38,134 INFO L124 PetriNetUnfolderBase]: 11670/23932 cut-off events. [2025-03-09 00:56:38,135 INFO L125 PetriNetUnfolderBase]: For 33224/33230 co-relation queries the response was YES. [2025-03-09 00:56:38,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64877 conditions, 23932 events. 11670/23932 cut-off events. For 33224/33230 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 186876 event pairs, 2868 based on Foata normal form. 175/23718 useless extension candidates. Maximal degree in co-relation 64825. Up to 5680 conditions per place. [2025-03-09 00:56:38,477 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 274 selfloop transitions, 104 changer transitions 0/391 dead transitions. [2025-03-09 00:56:38,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 391 transitions, 3135 flow [2025-03-09 00:56:38,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 00:56:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-09 00:56:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 577 transitions. [2025-03-09 00:56:38,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5828282828282828 [2025-03-09 00:56:38,479 INFO L175 Difference]: Start difference. First operand has 135 places, 128 transitions, 998 flow. Second operand 18 states and 577 transitions. [2025-03-09 00:56:38,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 391 transitions, 3135 flow [2025-03-09 00:56:38,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 391 transitions, 3005 flow, removed 46 selfloop flow, removed 7 redundant places. [2025-03-09 00:56:38,580 INFO L231 Difference]: Finished difference. Result has 155 places, 180 transitions, 1761 flow [2025-03-09 00:56:38,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1761, PETRI_PLACES=155, PETRI_TRANSITIONS=180} [2025-03-09 00:56:38,581 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 105 predicate places. [2025-03-09 00:56:38,581 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 180 transitions, 1761 flow [2025-03-09 00:56:38,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:38,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:38,581 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:38,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:38,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:38,782 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:38,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:38,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1290024468, now seen corresponding path program 1 times [2025-03-09 00:56:38,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:38,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558756050] [2025-03-09 00:56:38,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:38,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:38,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:38,786 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:38,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 00:56:38,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 00:56:38,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:56:38,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:38,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:56:38,857 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:56:38,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 00:56:38,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:56:38,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:38,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:56:38,929 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-09 00:56:38,929 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:56:38,930 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2025-03-09 00:56:38,932 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-03-09 00:56:38,932 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2025-03-09 00:56:38,932 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2025-03-09 00:56:38,932 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-09 00:56:38,932 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-09 00:56:38,932 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2025-03-09 00:56:38,932 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-09 00:56:38,933 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-09 00:56:38,933 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2025-03-09 00:56:38,933 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-09 00:56:38,933 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-03-09 00:56:38,933 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-03-09 00:56:38,933 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-03-09 00:56:38,933 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2025-03-09 00:56:38,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 00:56:39,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:39,134 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:39,164 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 00:56:39,164 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 00:56:39,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 12:56:39 BasicIcfg [2025-03-09 00:56:39,167 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 00:56:39,168 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 00:56:39,168 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 00:56:39,168 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 00:56:39,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:56:14" (3/4) ... [2025-03-09 00:56:39,169 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 00:56:39,170 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 00:56:39,171 INFO L158 Benchmark]: Toolchain (without parser) took 26305.05ms. Allocated memory was 83.9MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 58.2MB in the beginning and 721.8MB in the end (delta: -663.6MB). Peak memory consumption was 612.1MB. Max. memory is 16.1GB. [2025-03-09 00:56:39,171 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 83.9MB. Free memory was 62.7MB in the beginning and 62.6MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:56:39,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.47ms. Allocated memory is still 83.9MB. Free memory was 57.9MB in the beginning and 27.7MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 00:56:39,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.75ms. Allocated memory is still 83.9MB. Free memory was 27.7MB in the beginning and 25.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:56:39,171 INFO L158 Benchmark]: Boogie Preprocessor took 56.83ms. Allocated memory is still 83.9MB. Free memory was 25.3MB in the beginning and 22.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:56:39,171 INFO L158 Benchmark]: IcfgBuilder took 657.72ms. Allocated memory is still 83.9MB. Free memory was 22.8MB in the beginning and 40.5MB in the end (delta: -17.7MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2025-03-09 00:56:39,172 INFO L158 Benchmark]: TraceAbstraction took 25087.64ms. Allocated memory was 83.9MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 39.7MB in the beginning and 721.8MB in the end (delta: -682.1MB). Peak memory consumption was 589.3MB. Max. memory is 16.1GB. [2025-03-09 00:56:39,172 INFO L158 Benchmark]: Witness Printer took 2.46ms. Allocated memory is still 1.4GB. Free memory was 721.8MB in the beginning and 721.8MB in the end (delta: 49.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:56:39,173 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.96ms. Allocated memory is still 83.9MB. Free memory was 62.7MB in the beginning and 62.6MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.47ms. Allocated memory is still 83.9MB. Free memory was 57.9MB in the beginning and 27.7MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.75ms. Allocated memory is still 83.9MB. Free memory was 27.7MB in the beginning and 25.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.83ms. Allocated memory is still 83.9MB. Free memory was 25.3MB in the beginning and 22.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 657.72ms. Allocated memory is still 83.9MB. Free memory was 22.8MB in the beginning and 40.5MB in the end (delta: -17.7MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * TraceAbstraction took 25087.64ms. Allocated memory was 83.9MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 39.7MB in the beginning and 721.8MB in the end (delta: -682.1MB). Peak memory consumption was 589.3MB. Max. memory is 16.1GB. * Witness Printer took 2.46ms. Allocated memory is still 1.4GB. Free memory was 721.8MB in the beginning and 721.8MB in the end (delta: 49.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [arr={3:0}, flag=0, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, id2=0, m={4:0}, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [arr={3:0}, flag=0, m={4:0}, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; VAL [\old(stack)={3:0}, \old(x)=0, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, top=1, x=0] [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); VAL [\old(stack)={3:0}, \result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, top=0] [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] CALL 2 reach_error() [L20] COND FALSE 2 !(0) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L20] 2 __assert_fail ("0", "stack-2.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: 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: 1024]: 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 locations, 102 edges, 15 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: 25.0s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1583 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1538 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4434 IncrementalHoareTripleChecker+Invalid, 4499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 6 mSDtfsCounter, 4434 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1761occurred in iteration=14, InterpolantAutomatonStates: 119, 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.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 4242 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1389 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 2/52 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-03-09 00:56:39,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample