./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/stack_longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/stack_longer-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:34:29,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:34:29,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:34:29,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:34:29,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:34:29,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:34:29,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:34:29,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:34:29,710 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:34:29,710 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:34:29,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:34:29,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:34:29,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:34:29,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:34:29,712 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:34:29,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:34:29,712 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:34:29,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:34:29,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:34:29,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:34:29,713 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:34:29,713 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:34:29,713 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:34:29,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:34:29,713 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:34:29,713 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:34:29,713 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:34:29,713 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:34:29,714 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:34:29,714 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:34:29,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:34:29,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:34:29,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:34:29,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:34:29,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:34:29,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:34:29,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:34:29,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:34:29,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:34:29,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:34:29,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:34:29,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:34:29,716 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 [2025-02-06 12:34:30,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:34:30,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:34:30,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:34:30,019 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:34:30,019 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:34:30,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longer-1.i [2025-02-06 12:34:31,334 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b1f0a664/28778b23ee114848a784e5d7c61e5750/FLAG52911ac3f [2025-02-06 12:34:31,646 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:34:31,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2025-02-06 12:34:31,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b1f0a664/28778b23ee114848a784e5d7c61e5750/FLAG52911ac3f [2025-02-06 12:34:31,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b1f0a664/28778b23ee114848a784e5d7c61e5750 [2025-02-06 12:34:31,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:34:31,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:34:31,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:34:31,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:34:31,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:34:31,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:34:31" (1/1) ... [2025-02-06 12:34:31,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec176d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:34:31, skipping insertion in model container [2025-02-06 12:34:31,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:34:31" (1/1) ... [2025-02-06 12:34:31,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:34:32,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:34:32,230 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:34:32,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:34:32,395 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:34:32,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:34:32 WrapperNode [2025-02-06 12:34:32,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:34:32,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:34:32,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:34:32,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:34:32,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:34:32" (1/1) ... [2025-02-06 12:34:32,431 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:34:32" (1/1) ... [2025-02-06 12:34:32,468 INFO L138 Inliner]: procedures = 277, calls = 432, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 550 [2025-02-06 12:34:32,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:34:32,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:34:32,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:34:32,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:34:32,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:34:32" (1/1) ... [2025-02-06 12:34:32,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:34:32" (1/1) ... [2025-02-06 12:34:32,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:34:32" (1/1) ... [2025-02-06 12:34:32,530 INFO L175 MemorySlicer]: Split 409 memory accesses to 3 slices as follows [2, 5, 402]. 98 percent of accesses are in the largest equivalence class. The 407 initializations are split as follows [2, 5, 400]. The 1 writes are split as follows [0, 0, 1]. [2025-02-06 12:34:32,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:34:32" (1/1) ... [2025-02-06 12:34:32,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:34:32" (1/1) ... [2025-02-06 12:34:32,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:34:32" (1/1) ... [2025-02-06 12:34:32,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:34:32" (1/1) ... [2025-02-06 12:34:32,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:34:32" (1/1) ... [2025-02-06 12:34:32,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:34:32" (1/1) ... [2025-02-06 12:34:32,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:34:32,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:34:32,570 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:34:32,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:34:32,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:34:32" (1/1) ... [2025-02-06 12:34:32,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:34:32,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:34:32,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:34:32,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:34:32,627 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 12:34:32,627 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 12:34:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 12:34:32,628 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 12:34:32,628 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:34:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:34:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:34:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:34:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:34:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:34:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:34:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:34:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:34:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:34:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:34:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:34:32,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:34:32,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:34:32,631 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:34:32,760 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:34:32,762 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:34:33,584 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L982: havoc pop_#t~mem38#1; [2025-02-06 12:34:33,584 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L982-1: havoc pop_#t~ret37#1; [2025-02-06 12:34:33,584 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: pop_#res#1 := 0; [2025-02-06 12:34:33,585 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:34:33,585 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:34:38,232 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:34:38,232 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:34:38,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:34:38 BoogieIcfgContainer [2025-02-06 12:34:38,233 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:34:38,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:34:38,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:34:38,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:34:38,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:34:31" (1/3) ... [2025-02-06 12:34:38,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f282c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:34:38, skipping insertion in model container [2025-02-06 12:34:38,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:34:32" (2/3) ... [2025-02-06 12:34:38,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f282c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:34:38, skipping insertion in model container [2025-02-06 12:34:38,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:34:38" (3/3) ... [2025-02-06 12:34:38,242 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2025-02-06 12:34:38,258 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:34:38,260 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longer-1.i that has 3 procedures, 47 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-02-06 12:34:38,261 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:34:38,332 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 12:34:38,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2025-02-06 12:34:38,415 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2025-02-06 12:34:38,420 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:34:38,424 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 133 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-02-06 12:34:38,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2025-02-06 12:34:38,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2025-02-06 12:34:38,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:34:38,451 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;@4a96c743, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:34:38,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-06 12:34:38,472 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:34:38,472 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-02-06 12:34:38,472 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:34:38,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:38,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:38,474 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-02-06 12:34:38,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:38,479 INFO L85 PathProgramCache]: Analyzing trace with hash -604214011, now seen corresponding path program 1 times [2025-02-06 12:34:38,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:38,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383820013] [2025-02-06 12:34:38,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:38,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:38,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:34:38,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:34:38,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:38,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:39,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-02-06 12:34:39,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:39,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383820013] [2025-02-06 12:34:39,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383820013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:39,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:39,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:34:39,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510380401] [2025-02-06 12:34:39,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:39,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:34:39,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:39,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:34:39,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:34:39,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-06 12:34:39,296 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-02-06 12:34:39,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:39,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-06 12:34:39,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:39,716 INFO L124 PetriNetUnfolderBase]: 454/883 cut-off events. [2025-02-06 12:34:39,716 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-02-06 12:34:39,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 883 events. 454/883 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4519 event pairs, 242 based on Foata normal form. 90/851 useless extension candidates. Maximal degree in co-relation 1570. Up to 512 conditions per place. [2025-02-06 12:34:39,725 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2025-02-06 12:34:39,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2025-02-06 12:34:39,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:34:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:34:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-02-06 12:34:39,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2025-02-06 12:34:39,740 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2025-02-06 12:34:39,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2025-02-06 12:34:39,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:34:39,748 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2025-02-06 12:34:39,751 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-02-06 12:34:39,754 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2025-02-06 12:34:39,754 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2025-02-06 12:34:39,754 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-02-06 12:34:39,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:39,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:39,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:34:39,755 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-02-06 12:34:39,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:39,756 INFO L85 PathProgramCache]: Analyzing trace with hash -604214010, now seen corresponding path program 1 times [2025-02-06 12:34:39,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:39,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574286988] [2025-02-06 12:34:39,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:39,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:39,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:34:39,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:34:39,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:39,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:40,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:40,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574286988] [2025-02-06 12:34:40,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574286988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:40,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:40,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:34:40,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248071222] [2025-02-06 12:34:40,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:40,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:34:40,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:40,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:34:40,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:34:40,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-06 12:34:40,392 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-02-06 12:34:40,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:40,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-06 12:34:40,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:40,883 INFO L124 PetriNetUnfolderBase]: 750/1388 cut-off events. [2025-02-06 12:34:40,884 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-06 12:34:40,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1388 events. 750/1388 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7421 event pairs, 125 based on Foata normal form. 0/1220 useless extension candidates. Maximal degree in co-relation 807. Up to 848 conditions per place. [2025-02-06 12:34:40,900 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2025-02-06 12:34:40,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2025-02-06 12:34:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:34:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:34:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2025-02-06 12:34:40,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2025-02-06 12:34:40,903 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2025-02-06 12:34:40,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2025-02-06 12:34:40,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:34:40,907 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2025-02-06 12:34:40,907 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-02-06 12:34:40,908 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-02-06 12:34:40,908 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2025-02-06 12:34:40,908 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-02-06 12:34:40,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:40,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:40,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:34:40,909 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-02-06 12:34:40,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1606378108, now seen corresponding path program 1 times [2025-02-06 12:34:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:40,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365941638] [2025-02-06 12:34:40,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:40,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:40,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:34:40,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:34:40,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:40,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:41,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:41,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365941638] [2025-02-06 12:34:41,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365941638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:41,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:41,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:34:41,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009149219] [2025-02-06 12:34:41,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:41,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:34:41,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:41,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:34:41,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:34:41,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-02-06 12:34:41,099 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-02-06 12:34:41,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:41,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-02-06 12:34:41,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:41,402 INFO L124 PetriNetUnfolderBase]: 663/1274 cut-off events. [2025-02-06 12:34:41,403 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2025-02-06 12:34:41,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1274 events. 663/1274 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6557 event pairs, 176 based on Foata normal form. 34/1197 useless extension candidates. Maximal degree in co-relation 2591. Up to 721 conditions per place. [2025-02-06 12:34:41,412 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 67 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2025-02-06 12:34:41,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 376 flow [2025-02-06 12:34:41,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:34:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:34:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-02-06 12:34:41,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2025-02-06 12:34:41,414 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 5 states and 160 transitions. [2025-02-06 12:34:41,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 376 flow [2025-02-06 12:34:41,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 87 transitions, 374 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:34:41,419 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 161 flow [2025-02-06 12:34:41,419 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-02-06 12:34:41,420 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2025-02-06 12:34:41,420 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 161 flow [2025-02-06 12:34:41,420 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-02-06 12:34:41,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:41,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:41,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:34:41,421 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-02-06 12:34:41,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:41,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2138198452, now seen corresponding path program 1 times [2025-02-06 12:34:41,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:41,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702086733] [2025-02-06 12:34:41,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:41,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:41,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:34:41,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:34:41,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:41,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:41,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:41,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702086733] [2025-02-06 12:34:41,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702086733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:41,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:41,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:34:41,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769304774] [2025-02-06 12:34:41,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:41,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:34:41,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:41,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:34:41,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:34:41,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-02-06 12:34:41,578 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-02-06 12:34:41,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:41,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-02-06 12:34:41,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:41,963 INFO L124 PetriNetUnfolderBase]: 971/1835 cut-off events. [2025-02-06 12:34:41,964 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2025-02-06 12:34:41,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4026 conditions, 1835 events. 971/1835 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 9713 event pairs, 464 based on Foata normal form. 0/1713 useless extension candidates. Maximal degree in co-relation 3355. Up to 1051 conditions per place. [2025-02-06 12:34:41,980 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 73 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2025-02-06 12:34:41,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 429 flow [2025-02-06 12:34:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:34:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:34:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-02-06 12:34:41,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2025-02-06 12:34:41,983 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 161 flow. Second operand 4 states and 139 transitions. [2025-02-06 12:34:41,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 429 flow [2025-02-06 12:34:41,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 429 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:34:41,990 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 197 flow [2025-02-06 12:34:41,991 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-02-06 12:34:41,992 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2025-02-06 12:34:41,993 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 197 flow [2025-02-06 12:34:41,993 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-02-06 12:34:41,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:41,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:41,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:34:41,993 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-02-06 12:34:41,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:41,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1562818447, now seen corresponding path program 1 times [2025-02-06 12:34:41,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:41,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506466446] [2025-02-06 12:34:41,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:41,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:42,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:34:42,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:34:42,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:42,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:42,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:42,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506466446] [2025-02-06 12:34:42,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506466446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:42,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:42,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:34:42,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218382609] [2025-02-06 12:34:42,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:42,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:34:42,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:42,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:34:42,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:34:42,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-02-06 12:34:42,108 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-02-06 12:34:42,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:42,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-02-06 12:34:42,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:42,399 INFO L124 PetriNetUnfolderBase]: 1096/2029 cut-off events. [2025-02-06 12:34:42,402 INFO L125 PetriNetUnfolderBase]: For 579/579 co-relation queries the response was YES. [2025-02-06 12:34:42,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4873 conditions, 2029 events. 1096/2029 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10865 event pairs, 514 based on Foata normal form. 22/1932 useless extension candidates. Maximal degree in co-relation 4011. Up to 1284 conditions per place. [2025-02-06 12:34:42,420 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 62 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-02-06 12:34:42,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 397 flow [2025-02-06 12:34:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:34:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:34:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-02-06 12:34:42,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2025-02-06 12:34:42,423 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 197 flow. Second operand 3 states and 106 transitions. [2025-02-06 12:34:42,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 397 flow [2025-02-06 12:34:42,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 391 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:34:42,435 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 203 flow [2025-02-06 12:34:42,435 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-02-06 12:34:42,437 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2025-02-06 12:34:42,437 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 203 flow [2025-02-06 12:34:42,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:42,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:42,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:42,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:34:42,438 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-02-06 12:34:42,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1086820866, now seen corresponding path program 1 times [2025-02-06 12:34:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:42,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322048523] [2025-02-06 12:34:42,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:42,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:42,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 12:34:42,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 12:34:42,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:42,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:42,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:42,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322048523] [2025-02-06 12:34:42,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322048523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:42,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:42,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:34:42,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013616532] [2025-02-06 12:34:42,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:42,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:34:42,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:42,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:34:42,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:34:42,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-06 12:34:42,644 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-02-06 12:34:42,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:42,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-06 12:34:42,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:42,908 INFO L124 PetriNetUnfolderBase]: 1006/1857 cut-off events. [2025-02-06 12:34:42,908 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-02-06 12:34:42,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4371 conditions, 1857 events. 1006/1857 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9908 event pairs, 361 based on Foata normal form. 14/1753 useless extension candidates. Maximal degree in co-relation 3872. Up to 1410 conditions per place. [2025-02-06 12:34:42,924 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 49 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-02-06 12:34:42,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 313 flow [2025-02-06 12:34:42,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:34:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:34:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-02-06 12:34:42,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2025-02-06 12:34:42,927 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 203 flow. Second operand 3 states and 96 transitions. [2025-02-06 12:34:42,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 313 flow [2025-02-06 12:34:42,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 303 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 12:34:42,933 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 180 flow [2025-02-06 12:34:42,933 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-02-06 12:34:42,935 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2025-02-06 12:34:42,935 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 180 flow [2025-02-06 12:34:42,936 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-02-06 12:34:42,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:42,936 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:42,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:34:42,936 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-02-06 12:34:42,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:42,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1068464610, now seen corresponding path program 1 times [2025-02-06 12:34:42,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:42,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067673411] [2025-02-06 12:34:42,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:42,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:42,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:34:42,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:34:42,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:42,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:43,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:43,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067673411] [2025-02-06 12:34:43,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067673411] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:34:43,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006643993] [2025-02-06 12:34:43,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:43,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:34:43,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:34:43,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:34:43,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:34:43,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:34:43,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:34:43,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:43,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:43,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 12:34:43,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:34:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:43,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:34:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:44,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006643993] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:34:44,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:34:44,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-02-06 12:34:44,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142121098] [2025-02-06 12:34:44,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:34:44,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:34:44,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:44,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:34:44,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:34:44,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-06 12:34:44,155 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-02-06 12:34:44,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:44,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-06 12:34:44,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:45,876 INFO L124 PetriNetUnfolderBase]: 4128/7722 cut-off events. [2025-02-06 12:34:45,876 INFO L125 PetriNetUnfolderBase]: For 2485/2485 co-relation queries the response was YES. [2025-02-06 12:34:45,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17864 conditions, 7722 events. 4128/7722 cut-off events. For 2485/2485 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 50435 event pairs, 309 based on Foata normal form. 192/7404 useless extension candidates. Maximal degree in co-relation 7413. Up to 1423 conditions per place. [2025-02-06 12:34:45,949 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 327 selfloop transitions, 45 changer transitions 0/386 dead transitions. [2025-02-06 12:34:45,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 386 transitions, 1892 flow [2025-02-06 12:34:45,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 12:34:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 12:34:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 685 transitions. [2025-02-06 12:34:45,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2025-02-06 12:34:45,952 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 180 flow. Second operand 20 states and 685 transitions. [2025-02-06 12:34:45,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 386 transitions, 1892 flow [2025-02-06 12:34:45,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 386 transitions, 1850 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-02-06 12:34:45,971 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 592 flow [2025-02-06 12:34:45,971 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-02-06 12:34:45,972 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2025-02-06 12:34:45,973 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 592 flow [2025-02-06 12:34:45,973 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-02-06 12:34:45,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:45,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:45,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:34:46,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:34:46,178 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-02-06 12:34:46,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1486767657, now seen corresponding path program 1 times [2025-02-06 12:34:46,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:46,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077838616] [2025-02-06 12:34:46,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:46,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:34:46,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:34:46,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:46,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:46,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:46,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077838616] [2025-02-06 12:34:46,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077838616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:46,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:46,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:34:46,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116482772] [2025-02-06 12:34:46,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:46,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:34:46,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:46,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:34:46,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:34:46,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-02-06 12:34:46,352 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-02-06 12:34:46,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:46,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-02-06 12:34:46,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:46,836 INFO L124 PetriNetUnfolderBase]: 1833/3828 cut-off events. [2025-02-06 12:34:46,836 INFO L125 PetriNetUnfolderBase]: For 2279/2279 co-relation queries the response was YES. [2025-02-06 12:34:46,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9379 conditions, 3828 events. 1833/3828 cut-off events. For 2279/2279 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 22294 event pairs, 372 based on Foata normal form. 234/3906 useless extension candidates. Maximal degree in co-relation 9177. Up to 2311 conditions per place. [2025-02-06 12:34:46,858 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2025-02-06 12:34:46,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 609 flow [2025-02-06 12:34:46,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:34:46,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:34:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-02-06 12:34:46,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2025-02-06 12:34:46,860 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 592 flow. Second operand 3 states and 94 transitions. [2025-02-06 12:34:46,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 609 flow [2025-02-06 12:34:46,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 561 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-02-06 12:34:46,874 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 389 flow [2025-02-06 12:34:46,874 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-02-06 12:34:46,875 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2025-02-06 12:34:46,875 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 389 flow [2025-02-06 12:34:46,876 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-02-06 12:34:46,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:46,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:46,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:34:46,876 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-02-06 12:34:46,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:46,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1170798616, now seen corresponding path program 1 times [2025-02-06 12:34:46,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:46,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964011323] [2025-02-06 12:34:46,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:46,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:46,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:34:46,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:34:46,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:46,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:47,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:47,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964011323] [2025-02-06 12:34:47,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964011323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:47,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:47,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:34:47,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664494673] [2025-02-06 12:34:47,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:47,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:34:47,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:47,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:34:47,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:34:47,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-06 12:34:47,079 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-02-06 12:34:47,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:47,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-06 12:34:47,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:47,479 INFO L124 PetriNetUnfolderBase]: 1838/3730 cut-off events. [2025-02-06 12:34:47,480 INFO L125 PetriNetUnfolderBase]: For 1489/1489 co-relation queries the response was YES. [2025-02-06 12:34:47,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9363 conditions, 3730 events. 1838/3730 cut-off events. For 1489/1489 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 21406 event pairs, 1214 based on Foata normal form. 0/3605 useless extension candidates. Maximal degree in co-relation 7894. Up to 2670 conditions per place. [2025-02-06 12:34:47,513 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 65 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2025-02-06 12:34:47,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 540 flow [2025-02-06 12:34:47,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:34:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:34:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-02-06 12:34:47,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-02-06 12:34:47,516 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 389 flow. Second operand 4 states and 100 transitions. [2025-02-06 12:34:47,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 540 flow [2025-02-06 12:34:47,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 82 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:34:47,526 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 389 flow [2025-02-06 12:34:47,526 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-02-06 12:34:47,527 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 34 predicate places. [2025-02-06 12:34:47,528 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 389 flow [2025-02-06 12:34:47,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:47,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:47,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:47,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:34:47,528 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-02-06 12:34:47,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:47,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1942171851, now seen corresponding path program 1 times [2025-02-06 12:34:47,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:47,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068392673] [2025-02-06 12:34:47,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:47,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:34:47,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:34:47,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:47,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:47,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:47,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068392673] [2025-02-06 12:34:47,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068392673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:47,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:47,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:34:47,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227800971] [2025-02-06 12:34:47,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:47,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:34:47,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:47,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:34:47,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:34:48,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-06 12:34:48,000 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-02-06 12:34:48,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:48,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-06 12:34:48,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:48,549 INFO L124 PetriNetUnfolderBase]: 1961/3997 cut-off events. [2025-02-06 12:34:48,549 INFO L125 PetriNetUnfolderBase]: For 1679/1679 co-relation queries the response was YES. [2025-02-06 12:34:48,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9865 conditions, 3997 events. 1961/3997 cut-off events. For 1679/1679 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 23159 event pairs, 461 based on Foata normal form. 0/3837 useless extension candidates. Maximal degree in co-relation 8395. Up to 2936 conditions per place. [2025-02-06 12:34:48,580 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 105 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2025-02-06 12:34:48,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 126 transitions, 772 flow [2025-02-06 12:34:48,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:34:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:34:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2025-02-06 12:34:48,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5116883116883116 [2025-02-06 12:34:48,583 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 389 flow. Second operand 7 states and 197 transitions. [2025-02-06 12:34:48,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 126 transitions, 772 flow [2025-02-06 12:34:48,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 126 transitions, 762 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:34:48,594 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 440 flow [2025-02-06 12:34:48,595 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-02-06 12:34:48,595 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2025-02-06 12:34:48,595 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 440 flow [2025-02-06 12:34:48,595 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-02-06 12:34:48,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:48,595 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-02-06 12:34:48,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:34:48,595 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-02-06 12:34:48,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:48,596 INFO L85 PathProgramCache]: Analyzing trace with hash -844659777, now seen corresponding path program 1 times [2025-02-06 12:34:48,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:48,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508397953] [2025-02-06 12:34:48,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:48,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:48,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:34:48,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:34:48,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:48,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:48,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:48,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508397953] [2025-02-06 12:34:48,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508397953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:48,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:48,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:34:48,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224594341] [2025-02-06 12:34:48,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:48,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:34:48,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:48,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:34:48,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:34:48,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-02-06 12:34:48,692 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-02-06 12:34:48,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:48,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-02-06 12:34:48,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:49,304 INFO L124 PetriNetUnfolderBase]: 2879/6069 cut-off events. [2025-02-06 12:34:49,305 INFO L125 PetriNetUnfolderBase]: For 3094/3094 co-relation queries the response was YES. [2025-02-06 12:34:49,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15013 conditions, 6069 events. 2879/6069 cut-off events. For 3094/3094 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 40477 event pairs, 1373 based on Foata normal form. 137/5984 useless extension candidates. Maximal degree in co-relation 12986. Up to 3403 conditions per place. [2025-02-06 12:34:49,358 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 124 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2025-02-06 12:34:49,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 140 transitions, 1050 flow [2025-02-06 12:34:49,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:34:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:34:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-02-06 12:34:49,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2025-02-06 12:34:49,360 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 440 flow. Second operand 3 states and 107 transitions. [2025-02-06 12:34:49,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 140 transitions, 1050 flow [2025-02-06 12:34:49,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 140 transitions, 1038 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:34:49,379 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 445 flow [2025-02-06 12:34:49,379 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-02-06 12:34:49,380 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2025-02-06 12:34:49,380 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 445 flow [2025-02-06 12:34:49,380 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-02-06 12:34:49,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:49,380 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-02-06 12:34:49,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:34:49,380 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-02-06 12:34:49,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1222957098, now seen corresponding path program 1 times [2025-02-06 12:34:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:49,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414947573] [2025-02-06 12:34:49,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:49,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:49,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:34:49,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:34:49,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:49,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:49,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:49,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:49,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414947573] [2025-02-06 12:34:49,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414947573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:49,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:49,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:34:49,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828381607] [2025-02-06 12:34:49,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:49,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:34:49,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:49,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:34:49,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:34:49,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-02-06 12:34:49,508 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-02-06 12:34:49,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:49,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-02-06 12:34:49,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:50,170 INFO L124 PetriNetUnfolderBase]: 3194/6480 cut-off events. [2025-02-06 12:34:50,171 INFO L125 PetriNetUnfolderBase]: For 4317/4317 co-relation queries the response was YES. [2025-02-06 12:34:50,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17913 conditions, 6480 events. 3194/6480 cut-off events. For 4317/4317 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 42355 event pairs, 475 based on Foata normal form. 105/6399 useless extension candidates. Maximal degree in co-relation 14833. Up to 2632 conditions per place. [2025-02-06 12:34:50,235 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 109 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2025-02-06 12:34:50,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 133 transitions, 930 flow [2025-02-06 12:34:50,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:34:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:34:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2025-02-06 12:34:50,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5527272727272727 [2025-02-06 12:34:50,238 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 445 flow. Second operand 5 states and 152 transitions. [2025-02-06 12:34:50,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 133 transitions, 930 flow [2025-02-06 12:34:50,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 923 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:34:50,259 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 519 flow [2025-02-06 12:34:50,259 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-02-06 12:34:50,261 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 46 predicate places. [2025-02-06 12:34:50,261 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 519 flow [2025-02-06 12:34:50,261 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-02-06 12:34:50,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:50,261 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-02-06 12:34:50,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:34:50,262 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-02-06 12:34:50,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:50,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1944139375, now seen corresponding path program 1 times [2025-02-06 12:34:50,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:50,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597987470] [2025-02-06 12:34:50,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:50,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:50,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:34:50,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:34:50,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:50,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:51,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:51,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597987470] [2025-02-06 12:34:51,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597987470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:51,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:51,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:34:51,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113042658] [2025-02-06 12:34:51,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:51,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:34:51,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:51,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:34:51,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:34:51,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-02-06 12:34:51,381 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-02-06 12:34:51,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:51,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-02-06 12:34:51,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:52,857 INFO L124 PetriNetUnfolderBase]: 4726/9647 cut-off events. [2025-02-06 12:34:52,857 INFO L125 PetriNetUnfolderBase]: For 8701/8701 co-relation queries the response was YES. [2025-02-06 12:34:52,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26984 conditions, 9647 events. 4726/9647 cut-off events. For 8701/8701 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 67193 event pairs, 1022 based on Foata normal form. 24/9453 useless extension candidates. Maximal degree in co-relation 21479. Up to 4678 conditions per place. [2025-02-06 12:34:52,953 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 187 selfloop transitions, 25 changer transitions 0/226 dead transitions. [2025-02-06 12:34:52,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 226 transitions, 1602 flow [2025-02-06 12:34:52,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:34:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 12:34:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 339 transitions. [2025-02-06 12:34:52,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5136363636363637 [2025-02-06 12:34:52,955 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 519 flow. Second operand 12 states and 339 transitions. [2025-02-06 12:34:52,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 226 transitions, 1602 flow [2025-02-06 12:34:52,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 226 transitions, 1600 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:34:53,002 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 735 flow [2025-02-06 12:34:53,002 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=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=735, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2025-02-06 12:34:53,003 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 62 predicate places. [2025-02-06 12:34:53,003 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 735 flow [2025-02-06 12:34:53,003 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-02-06 12:34:53,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:53,003 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-02-06 12:34:53,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:34:53,004 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-02-06 12:34:53,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:53,004 INFO L85 PathProgramCache]: Analyzing trace with hash -49076563, now seen corresponding path program 1 times [2025-02-06 12:34:53,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:53,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829029016] [2025-02-06 12:34:53,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:53,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:53,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 12:34:53,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 12:34:53,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:53,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829029016] [2025-02-06 12:34:53,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829029016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:34:53,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:34:53,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:34:53,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396075573] [2025-02-06 12:34:53,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:34:53,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:34:53,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:53,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:34:53,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:34:53,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-02-06 12:34:53,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 735 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-02-06 12:34:53,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:53,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-02-06 12:34:53,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:54,439 INFO L124 PetriNetUnfolderBase]: 6719/14114 cut-off events. [2025-02-06 12:34:54,440 INFO L125 PetriNetUnfolderBase]: For 17881/17881 co-relation queries the response was YES. [2025-02-06 12:34:54,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40969 conditions, 14114 events. 6719/14114 cut-off events. For 17881/17881 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 111126 event pairs, 2587 based on Foata normal form. 409/14196 useless extension candidates. Maximal degree in co-relation 33135. Up to 6552 conditions per place. [2025-02-06 12:34:54,559 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 222 selfloop transitions, 3 changer transitions 0/239 dead transitions. [2025-02-06 12:34:54,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 239 transitions, 2212 flow [2025-02-06 12:34:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:34:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:34:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-02-06 12:34:54,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6681818181818182 [2025-02-06 12:34:54,560 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 735 flow. Second operand 4 states and 147 transitions. [2025-02-06 12:34:54,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 239 transitions, 2212 flow [2025-02-06 12:34:54,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 239 transitions, 2166 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-02-06 12:34:54,635 INFO L231 Difference]: Finished difference. Result has 112 places, 106 transitions, 731 flow [2025-02-06 12:34:54,635 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-02-06 12:34:54,637 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 62 predicate places. [2025-02-06 12:34:54,637 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 106 transitions, 731 flow [2025-02-06 12:34:54,637 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-02-06 12:34:54,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:54,637 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-02-06 12:34:54,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:34:54,638 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-02-06 12:34:54,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:54,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1742419921, now seen corresponding path program 1 times [2025-02-06 12:34:54,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:54,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407263128] [2025-02-06 12:34:54,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:54,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:54,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:34:54,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:34:54,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:54,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:55,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:55,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407263128] [2025-02-06 12:34:55,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407263128] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:34:55,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707280235] [2025-02-06 12:34:55,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:55,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:34:55,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:34:55,179 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:34:55,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:34:55,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:34:55,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:34:55,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:55,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:55,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 12:34:55,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:34:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:55,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:34:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:55,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707280235] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:34:55,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:34:55,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2025-02-06 12:34:55,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813783022] [2025-02-06 12:34:55,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:34:55,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:34:55,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:34:55,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:34:55,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-02-06 12:34:56,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-06 12:34:56,071 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-02-06 12:34:56,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:56,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-06 12:34:56,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:00,261 INFO L124 PetriNetUnfolderBase]: 14081/28817 cut-off events. [2025-02-06 12:35:00,261 INFO L125 PetriNetUnfolderBase]: For 45199/45199 co-relation queries the response was YES. [2025-02-06 12:35:00,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89419 conditions, 28817 events. 14081/28817 cut-off events. For 45199/45199 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 241118 event pairs, 2136 based on Foata normal form. 268/28346 useless extension candidates. Maximal degree in co-relation 52748. Up to 4582 conditions per place. [2025-02-06 12:35:00,506 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 383 selfloop transitions, 94 changer transitions 0/490 dead transitions. [2025-02-06 12:35:00,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 490 transitions, 3889 flow [2025-02-06 12:35:00,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 12:35:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 12:35:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 670 transitions. [2025-02-06 12:35:00,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5537190082644629 [2025-02-06 12:35:00,509 INFO L175 Difference]: Start difference. First operand has 112 places, 106 transitions, 731 flow. Second operand 22 states and 670 transitions. [2025-02-06 12:35:00,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 490 transitions, 3889 flow [2025-02-06 12:35:00,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 490 transitions, 3822 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-02-06 12:35:00,650 INFO L231 Difference]: Finished difference. Result has 147 places, 172 transitions, 1686 flow [2025-02-06 12:35:00,650 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-02-06 12:35:00,651 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 97 predicate places. [2025-02-06 12:35:00,651 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 172 transitions, 1686 flow [2025-02-06 12:35:00,651 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-02-06 12:35:00,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:00,652 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-02-06 12:35:00,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:35:00,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 12:35:00,855 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-02-06 12:35:00,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:00,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1639701864, now seen corresponding path program 1 times [2025-02-06 12:35:00,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:00,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541965226] [2025-02-06 12:35:00,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:00,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:00,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:35:00,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:35:00,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:00,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:01,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:01,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541965226] [2025-02-06 12:35:01,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541965226] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:35:01,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810933006] [2025-02-06 12:35:01,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:01,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:01,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:01,162 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:01,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:35:01,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:35:01,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:35:01,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:01,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:01,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:35:01,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:01,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:35:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:01,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810933006] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:35:01,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:35:01,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-02-06 12:35:01,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709806010] [2025-02-06 12:35:01,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:35:01,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:35:01,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:01,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:35:01,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:35:01,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-02-06 12:35:01,505 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-02-06 12:35:01,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:01,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-02-06 12:35:01,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:04,572 INFO L124 PetriNetUnfolderBase]: 12530/25890 cut-off events. [2025-02-06 12:35:04,572 INFO L125 PetriNetUnfolderBase]: For 63995/63995 co-relation queries the response was YES. [2025-02-06 12:35:04,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85521 conditions, 25890 events. 12530/25890 cut-off events. For 63995/63995 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 208853 event pairs, 3718 based on Foata normal form. 21/25244 useless extension candidates. Maximal degree in co-relation 81392. Up to 19270 conditions per place. [2025-02-06 12:35:05,076 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 181 selfloop transitions, 15 changer transitions 0/210 dead transitions. [2025-02-06 12:35:05,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 210 transitions, 2153 flow [2025-02-06 12:35:05,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:35:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:35:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2025-02-06 12:35:05,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2025-02-06 12:35:05,077 INFO L175 Difference]: Start difference. First operand has 147 places, 172 transitions, 1686 flow. Second operand 6 states and 189 transitions. [2025-02-06 12:35:05,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 210 transitions, 2153 flow [2025-02-06 12:35:05,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 210 transitions, 2052 flow, removed 46 selfloop flow, removed 3 redundant places. [2025-02-06 12:35:05,380 INFO L231 Difference]: Finished difference. Result has 152 places, 158 transitions, 1492 flow [2025-02-06 12:35:05,380 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-02-06 12:35:05,380 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 102 predicate places. [2025-02-06 12:35:05,380 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 158 transitions, 1492 flow [2025-02-06 12:35:05,381 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-02-06 12:35:05,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:05,381 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-02-06 12:35:05,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:35:05,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:05,581 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-02-06 12:35:05,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:05,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1524496957, now seen corresponding path program 1 times [2025-02-06 12:35:05,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:05,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091249393] [2025-02-06 12:35:05,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:05,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:05,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:35:05,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:35:05,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:05,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:35:05,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:35:05,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:35:05,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:35:05,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:05,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:35:05,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:35:05,750 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:35:05,751 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2025-02-06 12:35:05,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-02-06 12:35:05,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2025-02-06 12:35:05,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2025-02-06 12:35:05,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-02-06 12:35:05,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-02-06 12:35:05,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2025-02-06 12:35:05,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-02-06 12:35:05,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-02-06 12:35:05,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2025-02-06 12:35:05,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-02-06 12:35:05,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-02-06 12:35:05,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-02-06 12:35:05,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-02-06 12:35:05,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2025-02-06 12:35:05,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:35:05,756 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:05,841 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:35:05,842 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:35:05,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:35:05 BasicIcfg [2025-02-06 12:35:05,851 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:35:05,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:35:05,852 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:35:05,852 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:35:05,853 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:34:38" (3/4) ... [2025-02-06 12:35:05,854 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:35:05,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:35:05,856 INFO L158 Benchmark]: Toolchain (without parser) took 34177.27ms. Allocated memory was 167.8MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 132.2MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 744.2MB. Max. memory is 16.1GB. [2025-02-06 12:35:05,856 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:35:05,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 716.43ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 98.8MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 12:35:05,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.30ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 93.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:35:05,857 INFO L158 Benchmark]: Boogie Preprocessor took 99.56ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 88.6MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:35:05,857 INFO L158 Benchmark]: IcfgBuilder took 5663.82ms. Allocated memory was 167.8MB in the beginning and 654.3MB in the end (delta: 486.5MB). Free memory was 88.6MB in the beginning and 308.3MB in the end (delta: -219.7MB). Peak memory consumption was 386.4MB. Max. memory is 16.1GB. [2025-02-06 12:35:05,857 INFO L158 Benchmark]: TraceAbstraction took 27616.13ms. Allocated memory was 654.3MB in the beginning and 5.9GB in the end (delta: 5.2GB). Free memory was 308.3MB in the beginning and 5.1GB in the end (delta: -4.8GB). Peak memory consumption was 424.9MB. Max. memory is 16.1GB. [2025-02-06 12:35:05,857 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 5.9GB. Free memory was 5.1GB in the beginning and 5.1GB in the end (delta: 162.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:35:05,859 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.39ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 716.43ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 98.8MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.30ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 93.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.56ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 88.6MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 5663.82ms. Allocated memory was 167.8MB in the beginning and 654.3MB in the end (delta: 486.5MB). Free memory was 88.6MB in the beginning and 308.3MB in the end (delta: -219.7MB). Peak memory consumption was 386.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27616.13ms. Allocated memory was 654.3MB in the beginning and 5.9GB in the end (delta: 5.2GB). Free memory was 308.3MB in the beginning and 5.1GB in the end (delta: -4.8GB). Peak memory consumption was 424.9MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 5.9GB. Free memory was 5.1GB in the beginning and 5.1GB in the end (delta: 162.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[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [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); [L1019] 0 pthread_t id1, id2; [L1021] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L988] 1 int i; [L989] 1 unsigned int tmp; [L990] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L990] COND TRUE 1 i<(400) VAL [arr={3:0}, flag=0, m={4:0}, top=0] [L1022] 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] [L1004] 2 int i; [L1005] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L993] 1 tmp = __VERIFIER_nondet_uint() [L994] CALL 1 assume_abort_if_not(tmp < (400)) [L23] COND FALSE 1 !(!cond) [L994] RET 1 assume_abort_if_not(tmp < (400)) [L995] CALL, EXPR 1 push(arr,tmp) [L960] COND FALSE 1 !(top==(400)) [L967] CALL, EXPR 1 get_top() [L952] 1 return top; [L967] RET, EXPR 1 get_top() [L967] 1 stack[get_top()] = x [L968] CALL 1 inc_top() [L944] 1 top++ [L968] RET 1 inc_top() [L970] 1 return 0; VAL [\old(stack)={3:0}, \old(x)=399, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, top=1, x=399] [L1005] COND TRUE 2 i<(400) VAL [arr={3:0}, flag=0, m={4:0}, top=1] [L995] RET, EXPR 1 push(arr,tmp) [L995] COND FALSE 1 !(push(arr,tmp)==(-1)) [L997] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=399, top=1] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND FALSE 2 !(get_top()==0) [L981] CALL 2 dec_top() [L948] 2 top-- [L981] RET 2 dec_top() [L982] CALL, EXPR 2 get_top() [L952] 2 return top; [L982] RET, EXPR 2 get_top() [L982] EXPR 2 stack[get_top()] [L982] 2 return stack[get_top()]; [L1010] RET, EXPR 2 pop(arr) [L1010] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1005] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1005] COND TRUE 2 i<(400) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND TRUE 2 get_top()==0 [L977] 2 return (-2); VAL [\old(stack)={3:0}, \result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, top=0] [L1010] RET, EXPR 2 pop(arr) [L1010] COND TRUE 2 !(pop(arr)!=(-2)) [L1011] CALL 2 error() [L940] 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_longer-1.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1017]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1022]: 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: 1021]: 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, 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: 27.4s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1553 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1504 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4620 IncrementalHoareTripleChecker+Invalid, 4661 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 1 mSDtfsCounter, 4620 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1686occurred in iteration=15, InterpolantAutomatonStates: 111, 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.9s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 447 ConstructedInterpolants, 0 QuantifiedInterpolants, 3823 SizeOfPredicates, 14 NumberOfNonLiveVariables, 3033 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 3/57 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:35:05,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/stack_longer-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:35:08,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:35:08,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 12:35:08,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:35:08,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:35:08,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:35:08,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:35:08,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:35:08,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:35:08,647 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:35:08,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:35:08,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:35:08,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:35:08,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:35:08,649 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:35:08,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:35:08,649 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:35:08,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:35:08,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:35:08,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:35:08,649 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:35:08,649 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:35:08,649 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:35:08,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:35:08,650 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:35:08,650 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:35:08,650 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:35:08,650 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:35:08,650 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:35:08,650 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:35:08,650 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:35:08,650 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:35:08,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:35:08,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:35:08,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:35:08,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:35:08,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:35:08,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:35:08,651 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:35:08,651 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:35:08,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:35:08,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:35:08,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:35:08,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:35:08,652 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 [2025-02-06 12:35:08,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:35:08,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:35:08,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:35:08,958 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:35:08,958 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:35:08,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longer-1.i [2025-02-06 12:35:10,396 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76583b86b/cc62390148c34f939a5a3a1a3307e184/FLAG23e7068a5 [2025-02-06 12:35:10,416 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-02-06 12:35:10,731 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:35:10,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2025-02-06 12:35:10,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76583b86b/cc62390148c34f939a5a3a1a3307e184/FLAG23e7068a5 [2025-02-06 12:35:10,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76583b86b/cc62390148c34f939a5a3a1a3307e184 [2025-02-06 12:35:10,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:35:10,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:35:10,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:35:10,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:35:10,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:35:10,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:35:10" (1/1) ... [2025-02-06 12:35:10,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@365b4408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:10, skipping insertion in model container [2025-02-06 12:35:10,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:35:10" (1/1) ... [2025-02-06 12:35:10,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:35:11,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:35:11,373 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:35:11,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:35:11,550 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:35:11,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:11 WrapperNode [2025-02-06 12:35:11,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:35:11,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:35:11,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:35:11,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:35:11,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:11" (1/1) ... [2025-02-06 12:35:11,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:11" (1/1) ... [2025-02-06 12:35:11,628 INFO L138 Inliner]: procedures = 281, calls = 432, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 546 [2025-02-06 12:35:11,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:35:11,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:35:11,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:35:11,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:35:11,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:11" (1/1) ... [2025-02-06 12:35:11,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:11" (1/1) ... [2025-02-06 12:35:11,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:11" (1/1) ... [2025-02-06 12:35:11,672 INFO L175 MemorySlicer]: Split 409 memory accesses to 3 slices as follows [2, 5, 402]. 98 percent of accesses are in the largest equivalence class. The 407 initializations are split as follows [2, 5, 400]. The 1 writes are split as follows [0, 0, 1]. [2025-02-06 12:35:11,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:11" (1/1) ... [2025-02-06 12:35:11,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:11" (1/1) ... [2025-02-06 12:35:11,712 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:11" (1/1) ... [2025-02-06 12:35:11,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:11" (1/1) ... [2025-02-06 12:35:11,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:11" (1/1) ... [2025-02-06 12:35:11,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:11" (1/1) ... [2025-02-06 12:35:11,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:35:11,723 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:35:11,723 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:35:11,723 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:35:11,724 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:11" (1/1) ... [2025-02-06 12:35:11,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:35:11,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:11,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:35:11,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:35:11,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 12:35:11,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 12:35:11,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 12:35:11,782 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 12:35:11,783 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 12:35:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 12:35:11,783 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 12:35:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 12:35:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 12:35:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 12:35:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:35:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 12:35:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 12:35:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 12:35:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 12:35:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 12:35:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:35:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:35:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:35:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:35:11,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:35:11,787 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:35:11,934 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:35:11,935 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:35:13,047 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L982: havoc pop_#t~mem38#1; [2025-02-06 12:35:13,048 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L982-1: havoc pop_#t~ret37#1; [2025-02-06 12:35:13,048 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: pop_#res#1 := 0bv32; [2025-02-06 12:35:13,049 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:35:13,049 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:35:20,024 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:35:20,024 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:35:20,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:35:20 BoogieIcfgContainer [2025-02-06 12:35:20,025 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:35:20,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:35:20,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:35:20,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:35:20,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:35:10" (1/3) ... [2025-02-06 12:35:20,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41922aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:35:20, skipping insertion in model container [2025-02-06 12:35:20,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:11" (2/3) ... [2025-02-06 12:35:20,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41922aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:35:20, skipping insertion in model container [2025-02-06 12:35:20,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:35:20" (3/3) ... [2025-02-06 12:35:20,033 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2025-02-06 12:35:20,047 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:35:20,049 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longer-1.i that has 3 procedures, 47 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-02-06 12:35:20,049 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:35:20,136 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 12:35:20,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2025-02-06 12:35:20,232 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2025-02-06 12:35:20,234 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:35:20,239 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 133 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-02-06 12:35:20,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2025-02-06 12:35:20,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2025-02-06 12:35:20,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:35:20,272 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;@52e3b314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:35:20,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-06 12:35:20,299 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:35:20,300 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-02-06 12:35:20,300 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:35:20,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:20,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:20,301 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-02-06 12:35:20,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:20,308 INFO L85 PathProgramCache]: Analyzing trace with hash -408557307, now seen corresponding path program 1 times [2025-02-06 12:35:20,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:35:20,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [722215507] [2025-02-06 12:35:20,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:20,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:20,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:20,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:20,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:35:20,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:35:20,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:35:20,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:20,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:20,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:35:20,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:21,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:35:21,022 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:35:21,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722215507] [2025-02-06 12:35:21,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722215507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:21,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:21,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:35:21,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78113850] [2025-02-06 12:35:21,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:21,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:35:21,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:35:21,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:35:21,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:35:21,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-06 12:35:21,081 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-02-06 12:35:21,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:21,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-06 12:35:21,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:21,435 INFO L124 PetriNetUnfolderBase]: 454/883 cut-off events. [2025-02-06 12:35:21,435 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-02-06 12:35:21,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 883 events. 454/883 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4539 event pairs, 242 based on Foata normal form. 90/851 useless extension candidates. Maximal degree in co-relation 1570. Up to 512 conditions per place. [2025-02-06 12:35:21,451 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2025-02-06 12:35:21,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2025-02-06 12:35:21,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:35:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:35:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-02-06 12:35:21,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2025-02-06 12:35:21,468 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2025-02-06 12:35:21,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2025-02-06 12:35:21,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:35:21,477 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2025-02-06 12:35:21,479 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-02-06 12:35:21,487 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2025-02-06 12:35:21,487 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2025-02-06 12:35:21,487 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-02-06 12:35:21,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:21,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:21,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 12:35:21,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:21,688 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-02-06 12:35:21,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:21,689 INFO L85 PathProgramCache]: Analyzing trace with hash -408557306, now seen corresponding path program 1 times [2025-02-06 12:35:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:35:21,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [449466483] [2025-02-06 12:35:21,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:21,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:21,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:21,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:21,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:35:21,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:35:22,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:35:22,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:22,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:22,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:35:22,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:22,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:22,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:35:22,301 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:35:22,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449466483] [2025-02-06 12:35:22,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449466483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:22,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:22,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:35:22,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918178781] [2025-02-06 12:35:22,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:22,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:35:22,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:35:22,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:35:22,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:35:22,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-06 12:35:22,338 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-02-06 12:35:22,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:22,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-06 12:35:22,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:22,833 INFO L124 PetriNetUnfolderBase]: 750/1388 cut-off events. [2025-02-06 12:35:22,833 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-06 12:35:22,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1388 events. 750/1388 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7425 event pairs, 125 based on Foata normal form. 0/1220 useless extension candidates. Maximal degree in co-relation 807. Up to 848 conditions per place. [2025-02-06 12:35:22,842 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2025-02-06 12:35:22,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2025-02-06 12:35:22,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:35:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:35:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2025-02-06 12:35:22,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2025-02-06 12:35:22,845 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2025-02-06 12:35:22,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2025-02-06 12:35:22,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:35:22,851 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2025-02-06 12:35:22,852 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-02-06 12:35:22,852 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-02-06 12:35:22,853 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2025-02-06 12:35:22,853 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-02-06 12:35:22,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:22,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:22,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:35:23,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:23,054 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-02-06 12:35:23,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:23,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2144618356, now seen corresponding path program 1 times [2025-02-06 12:35:23,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:35:23,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1751185898] [2025-02-06 12:35:23,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:23,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:23,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:23,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:23,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:35:23,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:35:23,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:35:23,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:23,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:23,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:35:23,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:23,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:23,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:35:23,491 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:35:23,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751185898] [2025-02-06 12:35:23,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751185898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:23,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:23,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:35:23,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303481923] [2025-02-06 12:35:23,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:23,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:35:23,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:35:23,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:35:23,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:35:23,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2025-02-06 12:35:23,499 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-02-06 12:35:23,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:23,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2025-02-06 12:35:23,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:23,769 INFO L124 PetriNetUnfolderBase]: 793/1531 cut-off events. [2025-02-06 12:35:23,769 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-02-06 12:35:23,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3149 conditions, 1531 events. 793/1531 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8000 event pairs, 348 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 3064. Up to 734 conditions per place. [2025-02-06 12:35:23,779 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 56 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2025-02-06 12:35:23,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 303 flow [2025-02-06 12:35:23,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:35:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:35:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-02-06 12:35:23,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2025-02-06 12:35:23,781 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 3 states and 102 transitions. [2025-02-06 12:35:23,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 303 flow [2025-02-06 12:35:23,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 301 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:35:23,784 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 148 flow [2025-02-06 12:35:23,784 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-02-06 12:35:23,785 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2025-02-06 12:35:23,785 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 148 flow [2025-02-06 12:35:23,785 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-02-06 12:35:23,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:23,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:23,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:35:23,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:23,987 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-02-06 12:35:23,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:23,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1662347340, now seen corresponding path program 1 times [2025-02-06 12:35:23,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:35:23,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [755957688] [2025-02-06 12:35:23,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:23,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:23,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:23,990 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:23,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:35:24,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:35:24,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:35:24,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:24,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:24,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:35:24,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:24,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:35:24,413 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:35:24,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755957688] [2025-02-06 12:35:24,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755957688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:24,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:24,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:35:24,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59908960] [2025-02-06 12:35:24,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:24,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:35:24,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:35:24,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:35:24,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:35:24,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-02-06 12:35:24,416 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-02-06 12:35:24,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:24,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-02-06 12:35:24,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:24,876 INFO L124 PetriNetUnfolderBase]: 1096/2111 cut-off events. [2025-02-06 12:35:24,877 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2025-02-06 12:35:24,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4374 conditions, 2111 events. 1096/2111 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12217 event pairs, 518 based on Foata normal form. 0/1975 useless extension candidates. Maximal degree in co-relation 1577. Up to 1077 conditions per place. [2025-02-06 12:35:24,896 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 68 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2025-02-06 12:35:24,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 386 flow [2025-02-06 12:35:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:35:24,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:35:24,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-02-06 12:35:24,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2025-02-06 12:35:24,899 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 148 flow. Second operand 4 states and 139 transitions. [2025-02-06 12:35:24,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 386 flow [2025-02-06 12:35:24,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:35:24,904 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 175 flow [2025-02-06 12:35:24,904 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-02-06 12:35:24,904 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2025-02-06 12:35:24,904 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 175 flow [2025-02-06 12:35:24,905 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-02-06 12:35:24,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:24,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:24,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 12:35:25,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:25,105 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-02-06 12:35:25,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:25,106 INFO L85 PathProgramCache]: Analyzing trace with hash 289984105, now seen corresponding path program 1 times [2025-02-06 12:35:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:35:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1497104277] [2025-02-06 12:35:25,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:25,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:25,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:25,109 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:25,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:35:25,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:35:25,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:35:25,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:25,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:25,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:35:25,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:25,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:35:25,526 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:35:25,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497104277] [2025-02-06 12:35:25,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497104277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:25,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:25,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:35:25,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041440259] [2025-02-06 12:35:25,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:25,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:35:25,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:35:25,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:35:25,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:35:25,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-06 12:35:25,533 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-02-06 12:35:25,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:25,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-06 12:35:25,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:25,806 INFO L124 PetriNetUnfolderBase]: 1073/2101 cut-off events. [2025-02-06 12:35:25,806 INFO L125 PetriNetUnfolderBase]: For 398/398 co-relation queries the response was YES. [2025-02-06 12:35:25,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4668 conditions, 2101 events. 1073/2101 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12297 event pairs, 864 based on Foata normal form. 5/1965 useless extension candidates. Maximal degree in co-relation 1711. Up to 1736 conditions per place. [2025-02-06 12:35:25,821 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 35 selfloop transitions, 1 changer transitions 2/52 dead transitions. [2025-02-06 12:35:25,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 247 flow [2025-02-06 12:35:25,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:35:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:35:25,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-02-06 12:35:25,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-02-06 12:35:25,823 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 175 flow. Second operand 3 states and 80 transitions. [2025-02-06 12:35:25,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 247 flow [2025-02-06 12:35:25,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 242 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:35:25,831 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 165 flow [2025-02-06 12:35:25,831 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-02-06 12:35:25,833 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2025-02-06 12:35:25,833 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 165 flow [2025-02-06 12:35:25,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:25,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:25,834 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:25,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:35:26,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:26,035 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-02-06 12:35:26,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:26,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1702265570, now seen corresponding path program 1 times [2025-02-06 12:35:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:35:26,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747152258] [2025-02-06 12:35:26,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:26,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:26,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:26,040 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:26,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:35:26,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:35:26,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:35:26,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:26,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:26,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 12:35:26,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:26,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:35:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:27,149 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:35:27,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747152258] [2025-02-06 12:35:27,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747152258] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:35:27,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:35:27,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-02-06 12:35:27,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663173081] [2025-02-06 12:35:27,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:35:27,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:35:27,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:35:27,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:35:27,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:35:27,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-06 12:35:27,229 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-02-06 12:35:27,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:27,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-06 12:35:27,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:31,329 INFO L124 PetriNetUnfolderBase]: 5287/10051 cut-off events. [2025-02-06 12:35:31,329 INFO L125 PetriNetUnfolderBase]: For 2265/2265 co-relation queries the response was YES. [2025-02-06 12:35:31,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22161 conditions, 10051 events. 5287/10051 cut-off events. For 2265/2265 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 69874 event pairs, 756 based on Foata normal form. 264/9718 useless extension candidates. Maximal degree in co-relation 22146. Up to 1753 conditions per place. [2025-02-06 12:35:31,409 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 317 selfloop transitions, 45 changer transitions 0/375 dead transitions. [2025-02-06 12:35:31,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 375 transitions, 1774 flow [2025-02-06 12:35:31,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 12:35:31,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 12:35:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 679 transitions. [2025-02-06 12:35:31,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6172727272727273 [2025-02-06 12:35:31,414 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 165 flow. Second operand 20 states and 679 transitions. [2025-02-06 12:35:31,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 375 transitions, 1774 flow [2025-02-06 12:35:31,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 375 transitions, 1773 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:35:31,430 INFO L231 Difference]: Finished difference. Result has 88 places, 95 transitions, 582 flow [2025-02-06 12:35:31,430 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-02-06 12:35:31,431 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2025-02-06 12:35:31,431 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 582 flow [2025-02-06 12:35:31,431 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-02-06 12:35:31,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:31,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:31,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 12:35:31,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:31,632 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-02-06 12:35:31,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:31,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1595039957, now seen corresponding path program 1 times [2025-02-06 12:35:31,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:35:31,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384134223] [2025-02-06 12:35:31,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:31,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:31,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:31,636 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:31,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:35:31,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:35:31,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:35:31,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:31,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:32,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:35:32,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:32,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:35:32,122 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:35:32,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384134223] [2025-02-06 12:35:32,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384134223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:32,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:32,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:35:32,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435732814] [2025-02-06 12:35:32,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:32,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:35:32,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:35:32,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:35:32,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:35:32,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-06 12:35:32,141 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-02-06 12:35:32,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:32,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-06 12:35:32,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:32,812 INFO L124 PetriNetUnfolderBase]: 5035/9503 cut-off events. [2025-02-06 12:35:32,812 INFO L125 PetriNetUnfolderBase]: For 9580/9580 co-relation queries the response was YES. [2025-02-06 12:35:32,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24521 conditions, 9503 events. 5035/9503 cut-off events. For 9580/9580 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 65952 event pairs, 3115 based on Foata normal form. 0/9133 useless extension candidates. Maximal degree in co-relation 24490. Up to 6346 conditions per place. [2025-02-06 12:35:32,898 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 121 selfloop transitions, 3 changer transitions 0/137 dead transitions. [2025-02-06 12:35:32,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 137 transitions, 1146 flow [2025-02-06 12:35:32,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:35:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:35:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-02-06 12:35:32,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-02-06 12:35:32,900 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 582 flow. Second operand 4 states and 108 transitions. [2025-02-06 12:35:32,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 137 transitions, 1146 flow [2025-02-06 12:35:32,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 137 transitions, 1054 flow, removed 45 selfloop flow, removed 1 redundant places. [2025-02-06 12:35:32,954 INFO L231 Difference]: Finished difference. Result has 89 places, 94 transitions, 522 flow [2025-02-06 12:35:32,954 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-02-06 12:35:32,955 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 39 predicate places. [2025-02-06 12:35:32,955 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 522 flow [2025-02-06 12:35:32,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:32,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:32,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:32,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 12:35:33,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:33,156 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-02-06 12:35:33,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:33,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1595039958, now seen corresponding path program 1 times [2025-02-06 12:35:33,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:35:33,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1209510846] [2025-02-06 12:35:33,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:33,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:33,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:33,160 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:33,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:35:33,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:35:33,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:35:33,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:33,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:33,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:35:33,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:33,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-02-06 12:35:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:33,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:35:33,583 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:35:33,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209510846] [2025-02-06 12:35:33,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209510846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:33,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:33,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:35:33,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977012147] [2025-02-06 12:35:33,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:33,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:35:33,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:35:33,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:35:33,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:35:33,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-02-06 12:35:33,584 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-02-06 12:35:33,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:33,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-02-06 12:35:33,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:34,069 INFO L124 PetriNetUnfolderBase]: 2498/5169 cut-off events. [2025-02-06 12:35:34,069 INFO L125 PetriNetUnfolderBase]: For 2568/2568 co-relation queries the response was YES. [2025-02-06 12:35:34,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12238 conditions, 5169 events. 2498/5169 cut-off events. For 2568/2568 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 32005 event pairs, 576 based on Foata normal form. 358/5396 useless extension candidates. Maximal degree in co-relation 12206. Up to 3021 conditions per place. [2025-02-06 12:35:34,101 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 67 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2025-02-06 12:35:34,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 84 transitions, 555 flow [2025-02-06 12:35:34,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:35:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:35:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-02-06 12:35:34,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5636363636363636 [2025-02-06 12:35:34,103 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 522 flow. Second operand 3 states and 93 transitions. [2025-02-06 12:35:34,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 84 transitions, 555 flow [2025-02-06 12:35:34,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 533 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-02-06 12:35:34,124 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 377 flow [2025-02-06 12:35:34,124 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-02-06 12:35:34,126 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 28 predicate places. [2025-02-06 12:35:34,126 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 377 flow [2025-02-06 12:35:34,126 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-02-06 12:35:34,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:34,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:34,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 12:35:34,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:34,328 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-02-06 12:35:34,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:34,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2058972703, now seen corresponding path program 1 times [2025-02-06 12:35:34,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:35:34,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1493740779] [2025-02-06 12:35:34,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:34,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:34,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:34,331 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:34,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:35:34,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:35:34,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:35:34,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:34,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:34,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 12:35:34,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:35,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:35:35,075 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:35:35,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493740779] [2025-02-06 12:35:35,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493740779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:35,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:35,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:35:35,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865508285] [2025-02-06 12:35:35,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:35,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:35:35,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:35:35,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:35:35,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:35:35,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-02-06 12:35:35,110 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-02-06 12:35:35,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:35,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-02-06 12:35:35,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:35,768 INFO L124 PetriNetUnfolderBase]: 2523/5170 cut-off events. [2025-02-06 12:35:35,768 INFO L125 PetriNetUnfolderBase]: For 2027/2027 co-relation queries the response was YES. [2025-02-06 12:35:35,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12423 conditions, 5170 events. 2523/5170 cut-off events. For 2027/2027 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 31647 event pairs, 901 based on Foata normal form. 0/5003 useless extension candidates. Maximal degree in co-relation 12397. Up to 3411 conditions per place. [2025-02-06 12:35:35,787 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 99 selfloop transitions, 9 changer transitions 0/120 dead transitions. [2025-02-06 12:35:35,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 120 transitions, 719 flow [2025-02-06 12:35:35,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:35:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:35:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2025-02-06 12:35:35,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2025-02-06 12:35:35,789 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 377 flow. Second operand 6 states and 182 transitions. [2025-02-06 12:35:35,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 120 transitions, 719 flow [2025-02-06 12:35:35,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 120 transitions, 708 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:35:35,800 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 417 flow [2025-02-06 12:35:35,801 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-02-06 12:35:35,801 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2025-02-06 12:35:35,801 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 417 flow [2025-02-06 12:35:35,801 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-02-06 12:35:35,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:35,802 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-02-06 12:35:35,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 12:35:36,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:36,002 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-02-06 12:35:36,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:36,003 INFO L85 PathProgramCache]: Analyzing trace with hash 479026948, now seen corresponding path program 1 times [2025-02-06 12:35:36,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:35:36,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744064191] [2025-02-06 12:35:36,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:36,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:36,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:36,005 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:36,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 12:35:36,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:35:36,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:35:36,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:36,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:36,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:35:36,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:36,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:35:36,409 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:35:36,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744064191] [2025-02-06 12:35:36,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744064191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:36,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:36,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:35:36,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828000707] [2025-02-06 12:35:36,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:36,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:35:36,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:35:36,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:35:36,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:35:36,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-02-06 12:35:36,410 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-02-06 12:35:36,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:36,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-02-06 12:35:36,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:36,855 INFO L124 PetriNetUnfolderBase]: 2452/5057 cut-off events. [2025-02-06 12:35:36,856 INFO L125 PetriNetUnfolderBase]: For 2166/2166 co-relation queries the response was YES. [2025-02-06 12:35:36,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12161 conditions, 5057 events. 2452/5057 cut-off events. For 2166/2166 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 31027 event pairs, 872 based on Foata normal form. 7/4932 useless extension candidates. Maximal degree in co-relation 12130. Up to 3351 conditions per place. [2025-02-06 12:35:36,875 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 92 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2025-02-06 12:35:36,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 112 transitions, 709 flow [2025-02-06 12:35:36,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:35:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:35:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-02-06 12:35:36,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5890909090909091 [2025-02-06 12:35:36,877 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 417 flow. Second operand 5 states and 162 transitions. [2025-02-06 12:35:36,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 112 transitions, 709 flow [2025-02-06 12:35:36,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 700 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 12:35:36,888 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 422 flow [2025-02-06 12:35:36,888 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-02-06 12:35:36,888 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2025-02-06 12:35:36,889 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 422 flow [2025-02-06 12:35:36,889 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-02-06 12:35:36,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:36,889 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-02-06 12:35:36,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 12:35:37,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:37,090 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-02-06 12:35:37,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:37,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1935320441, now seen corresponding path program 1 times [2025-02-06 12:35:37,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:35:37,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143499117] [2025-02-06 12:35:37,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:37,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:37,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:37,092 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:37,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 12:35:37,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.