./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym.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 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:38:55,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:38:55,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:38:55,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:38:55,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:38:55,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:38:55,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:38:55,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:38:55,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:38:55,406 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:38:55,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:38:55,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:38:55,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:38:55,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:38:55,407 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:38:55,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:38:55,407 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:38:55,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:38:55,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:38:55,408 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:55,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:55,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:55,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:38:55,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:38:55,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:38:55,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:38:55,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:38:55,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:38:55,409 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:38:55,409 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:38:55,409 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 -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-01-10 00:38:55,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:38:55,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:38:55,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:38:55,608 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:38:55,608 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:38:55,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-01-10 00:38:56,713 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5be0e1fdc/96459f340b0f4d2db9d4f4e0434b26ff/FLAGa42a080ee [2025-01-10 00:38:56,958 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:38:56,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-01-10 00:38:56,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5be0e1fdc/96459f340b0f4d2db9d4f4e0434b26ff/FLAGa42a080ee [2025-01-10 00:38:56,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5be0e1fdc/96459f340b0f4d2db9d4f4e0434b26ff [2025-01-10 00:38:56,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:38:56,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:38:56,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:56,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:38:57,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:38:57,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:56" (1/1) ... [2025-01-10 00:38:57,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755a91b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57, skipping insertion in model container [2025-01-10 00:38:57,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:56" (1/1) ... [2025-01-10 00:38:57,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:38:57,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:57,294 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:38:57,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:57,350 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:38:57,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57 WrapperNode [2025-01-10 00:38:57,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:57,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:57,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:38:57,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:38:57,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57" (1/1) ... [2025-01-10 00:38:57,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57" (1/1) ... [2025-01-10 00:38:57,385 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2025-01-10 00:38:57,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:57,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:38:57,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:38:57,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:38:57,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57" (1/1) ... [2025-01-10 00:38:57,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57" (1/1) ... [2025-01-10 00:38:57,396 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57" (1/1) ... [2025-01-10 00:38:57,416 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-01-10 00:38:57,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57" (1/1) ... [2025-01-10 00:38:57,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57" (1/1) ... [2025-01-10 00:38:57,425 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57" (1/1) ... [2025-01-10 00:38:57,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57" (1/1) ... [2025-01-10 00:38:57,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57" (1/1) ... [2025-01-10 00:38:57,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57" (1/1) ... [2025-01-10 00:38:57,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57" (1/1) ... [2025-01-10 00:38:57,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:38:57,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:38:57,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:38:57,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:38:57,434 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57" (1/1) ... [2025-01-10 00:38:57,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:57,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:57,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:38:57,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:38:57,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:38:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:38:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:38:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 00:38:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 00:38:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:38:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:38:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:38:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:38:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:38:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:38:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:38:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:38:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:38:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:38:57,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:38:57,485 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:38:57,574 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:38:57,576 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:38:57,710 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:38:57,711 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:38:57,809 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:38:57,809 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 00:38:57,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:57 BoogieIcfgContainer [2025-01-10 00:38:57,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:38:57,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:38:57,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:38:57,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:38:57,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:38:56" (1/3) ... [2025-01-10 00:38:57,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee6e7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:57, skipping insertion in model container [2025-01-10 00:38:57,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:57" (2/3) ... [2025-01-10 00:38:57,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee6e7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:57, skipping insertion in model container [2025-01-10 00:38:57,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:57" (3/3) ... [2025-01-10 00:38:57,818 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-01-10 00:38:57,827 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:38:57,829 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym.i that has 2 procedures, 30 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-01-10 00:38:57,829 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:38:57,865 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:38:57,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 34 transitions, 72 flow [2025-01-10 00:38:57,909 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-01-10 00:38:57,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:57,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 38 events. 4/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 65 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-01-10 00:38:57,914 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 34 transitions, 72 flow [2025-01-10 00:38:57,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 34 transitions, 72 flow [2025-01-10 00:38:57,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:38:57,931 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;@8e7672a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:38:57,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 00:38:57,934 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:38:57,935 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 00:38:57,935 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:57,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:57,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:38:57,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-01-10 00:38:57,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:57,939 INFO L85 PathProgramCache]: Analyzing trace with hash 274962, now seen corresponding path program 1 times [2025-01-10 00:38:57,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:57,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128056220] [2025-01-10 00:38:57,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:57,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:58,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:38:58,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:38:58,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:58,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:58,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:58,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128056220] [2025-01-10 00:38:58,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128056220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:58,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:58,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:38:58,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953152824] [2025-01-10 00:38:58,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:58,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:58,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:58,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:58,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:58,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 00:38:58,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:58,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:58,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 00:38:58,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:58,247 INFO L124 PetriNetUnfolderBase]: 22/77 cut-off events. [2025-01-10 00:38:58,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:58,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 77 events. 22/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 171 event pairs, 18 based on Foata normal form. 6/81 useless extension candidates. Maximal degree in co-relation 117. Up to 56 conditions per place. [2025-01-10 00:38:58,250 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 16 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-01-10 00:38:58,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 90 flow [2025-01-10 00:38:58,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-01-10 00:38:58,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2025-01-10 00:38:58,265 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 72 flow. Second operand 3 states and 52 transitions. [2025-01-10 00:38:58,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 90 flow [2025-01-10 00:38:58,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 90 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:38:58,272 INFO L231 Difference]: Finished difference. Result has 29 places, 26 transitions, 58 flow [2025-01-10 00:38:58,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=26} [2025-01-10 00:38:58,278 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -4 predicate places. [2025-01-10 00:38:58,279 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 58 flow [2025-01-10 00:38:58,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:58,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:58,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:38:58,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:38:58,280 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-01-10 00:38:58,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:58,281 INFO L85 PathProgramCache]: Analyzing trace with hash 274963, now seen corresponding path program 1 times [2025-01-10 00:38:58,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:58,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976165322] [2025-01-10 00:38:58,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:58,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:58,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:38:58,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:38:58,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:58,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:58,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:58,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976165322] [2025-01-10 00:38:58,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976165322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:58,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:58,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:38:58,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574253635] [2025-01-10 00:38:58,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:58,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:58,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:58,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:58,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:58,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-01-10 00:38:58,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:58,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:58,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-01-10 00:38:58,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:58,453 INFO L124 PetriNetUnfolderBase]: 22/79 cut-off events. [2025-01-10 00:38:58,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:58,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 79 events. 22/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 171 event pairs, 18 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 138. Up to 58 conditions per place. [2025-01-10 00:38:58,454 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 18 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2025-01-10 00:38:58,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 102 flow [2025-01-10 00:38:58,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-01-10 00:38:58,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5392156862745098 [2025-01-10 00:38:58,455 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 58 flow. Second operand 3 states and 55 transitions. [2025-01-10 00:38:58,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 102 flow [2025-01-10 00:38:58,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 101 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:38:58,456 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 71 flow [2025-01-10 00:38:58,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2025-01-10 00:38:58,457 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2025-01-10 00:38:58,457 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 71 flow [2025-01-10 00:38:58,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:58,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:58,457 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 00:38:58,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:38:58,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-01-10 00:38:58,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:58,459 INFO L85 PathProgramCache]: Analyzing trace with hash 264248209, now seen corresponding path program 1 times [2025-01-10 00:38:58,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:58,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935887593] [2025-01-10 00:38:58,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:58,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:38:58,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:38:58,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:58,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:58,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:58,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935887593] [2025-01-10 00:38:58,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935887593] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:58,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283869119] [2025-01-10 00:38:58,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:58,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:58,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:58,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:38:58,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:38:58,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:38:58,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:38:58,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:58,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:58,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 00:38:58,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:58,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:38:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:58,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283869119] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:38:58,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:38:58,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-01-10 00:38:58,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360167236] [2025-01-10 00:38:58,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:38:58,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:38:58,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:58,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:38:58,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:38:58,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-01-10 00:38:58,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 71 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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-01-10 00:38:58,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:58,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-01-10 00:38:58,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:58,967 INFO L124 PetriNetUnfolderBase]: 24/87 cut-off events. [2025-01-10 00:38:58,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:38:58,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 87 events. 24/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 195 event pairs, 18 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 164. Up to 60 conditions per place. [2025-01-10 00:38:58,970 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 21 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2025-01-10 00:38:58,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 155 flow [2025-01-10 00:38:58,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:38:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:38:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-01-10 00:38:58,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-01-10 00:38:58,974 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 71 flow. Second operand 6 states and 98 transitions. [2025-01-10 00:38:58,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 155 flow [2025-01-10 00:38:58,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:38:58,976 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 121 flow [2025-01-10 00:38:58,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-01-10 00:38:58,977 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2025-01-10 00:38:58,977 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 121 flow [2025-01-10 00:38:58,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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-01-10 00:38:58,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:58,977 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-01-10 00:38:58,986 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-01-10 00:38:59,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:59,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-01-10 00:38:59,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:59,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1634790155, now seen corresponding path program 2 times [2025-01-10 00:38:59,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:59,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272693125] [2025-01-10 00:38:59,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:38:59,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:59,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 00:38:59,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:38:59,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:38:59,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:59,381 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:59,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:59,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272693125] [2025-01-10 00:38:59,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272693125] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:59,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764498201] [2025-01-10 00:38:59,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:38:59,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:59,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:59,384 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:38:59,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:38:59,423 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 00:38:59,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:38:59,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:38:59,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:59,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 00:38:59,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:38:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:59,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:38:59,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764498201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:59,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 00:38:59,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-01-10 00:38:59,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881823587] [2025-01-10 00:38:59,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:59,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:38:59,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:59,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:38:59,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:38:59,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-01-10 00:38:59,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 121 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:59,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:59,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-01-10 00:38:59,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:59,707 INFO L124 PetriNetUnfolderBase]: 24/86 cut-off events. [2025-01-10 00:38:59,708 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-10 00:38:59,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 86 events. 24/86 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 193 event pairs, 18 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 173. Up to 56 conditions per place. [2025-01-10 00:38:59,708 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 17 selfloop transitions, 10 changer transitions 0/35 dead transitions. [2025-01-10 00:38:59,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 173 flow [2025-01-10 00:38:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:38:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:38:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2025-01-10 00:38:59,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2025-01-10 00:38:59,710 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 121 flow. Second operand 8 states and 116 transitions. [2025-01-10 00:38:59,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 173 flow [2025-01-10 00:38:59,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 147 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-01-10 00:38:59,711 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 113 flow [2025-01-10 00:38:59,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=113, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-01-10 00:38:59,712 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-01-10 00:38:59,712 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 113 flow [2025-01-10 00:38:59,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:59,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:59,712 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 00:38:59,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:38:59,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:59,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-01-10 00:38:59,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:59,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1653353394, now seen corresponding path program 1 times [2025-01-10 00:38:59,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:59,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717351063] [2025-01-10 00:38:59,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:59,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:59,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:38:59,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:38:59,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:59,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:59,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:59,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:59,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717351063] [2025-01-10 00:38:59,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717351063] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:38:59,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492212980] [2025-01-10 00:38:59,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:59,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:38:59,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:59,963 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:38:59,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:39:00,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:39:00,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:39:00,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:00,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:00,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:39:00,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:00,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:39:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:00,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492212980] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:39:00,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:39:00,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-10 00:39:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262249833] [2025-01-10 00:39:00,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:39:00,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:39:00,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:00,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:39:00,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:39:00,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-01-10 00:39:00,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 113 flow. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:00,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:00,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-01-10 00:39:00,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:00,125 INFO L124 PetriNetUnfolderBase]: 22/87 cut-off events. [2025-01-10 00:39:00,125 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 00:39:00,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 87 events. 22/87 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 168 event pairs, 18 based on Foata normal form. 4/90 useless extension candidates. Maximal degree in co-relation 179. Up to 55 conditions per place. [2025-01-10 00:39:00,126 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 20 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2025-01-10 00:39:00,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 186 flow [2025-01-10 00:39:00,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:39:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:39:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2025-01-10 00:39:00,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-01-10 00:39:00,127 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 113 flow. Second operand 8 states and 128 transitions. [2025-01-10 00:39:00,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 186 flow [2025-01-10 00:39:00,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 168 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 00:39:00,129 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 125 flow [2025-01-10 00:39:00,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=125, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-01-10 00:39:00,129 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2025-01-10 00:39:00,129 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 125 flow [2025-01-10 00:39:00,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:00,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:00,130 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1] [2025-01-10 00:39:00,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 00:39:00,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:00,330 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-01-10 00:39:00,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:00,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1779199146, now seen corresponding path program 2 times [2025-01-10 00:39:00,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:00,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713137721] [2025-01-10 00:39:00,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:39:00,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:00,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 00:39:00,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:39:00,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:39:00,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:39:00,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:39:00,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:39:00,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:39:00,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:00,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:39:00,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:39:00,391 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:39:00,392 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-10 00:39:00,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2025-01-10 00:39:00,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2025-01-10 00:39:00,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2025-01-10 00:39:00,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2025-01-10 00:39:00,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2025-01-10 00:39:00,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2025-01-10 00:39:00,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2025-01-10 00:39:00,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2025-01-10 00:39:00,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2025-01-10 00:39:00,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:39:00,396 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-01-10 00:39:00,398 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:39:00,398 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:39:00,416 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:39:00,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 122 flow [2025-01-10 00:39:00,423 INFO L124 PetriNetUnfolderBase]: 7/65 cut-off events. [2025-01-10 00:39:00,426 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:39:00,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 65 events. 7/65 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 146 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 47. Up to 3 conditions per place. [2025-01-10 00:39:00,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 56 transitions, 122 flow [2025-01-10 00:39:00,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 56 transitions, 122 flow [2025-01-10 00:39:00,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:39:00,428 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;@8e7672a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:39:00,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-10 00:39:00,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:39:00,429 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 00:39:00,429 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:39:00,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:00,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:39:00,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-01-10 00:39:00,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:00,430 INFO L85 PathProgramCache]: Analyzing trace with hash 330570, now seen corresponding path program 1 times [2025-01-10 00:39:00,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:00,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580389373] [2025-01-10 00:39:00,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:00,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:00,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:39:00,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:39:00,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:00,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:00,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:00,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580389373] [2025-01-10 00:39:00,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580389373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:00,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:00,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:39:00,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535514638] [2025-01-10 00:39:00,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:00,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:39:00,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:00,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:39:00,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:39:00,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 56 [2025-01-10 00:39:00,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:00,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:00,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 56 [2025-01-10 00:39:00,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:00,572 INFO L124 PetriNetUnfolderBase]: 532/1122 cut-off events. [2025-01-10 00:39:00,572 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-10 00:39:00,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2024 conditions, 1122 events. 532/1122 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6095 event pairs, 468 based on Foata normal form. 123/1228 useless extension candidates. Maximal degree in co-relation 1291. Up to 866 conditions per place. [2025-01-10 00:39:00,578 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 27 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2025-01-10 00:39:00,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 154 flow [2025-01-10 00:39:00,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:39:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:39:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-01-10 00:39:00,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2025-01-10 00:39:00,579 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 122 flow. Second operand 3 states and 87 transitions. [2025-01-10 00:39:00,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 154 flow [2025-01-10 00:39:00,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:39:00,580 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 100 flow [2025-01-10 00:39:00,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-01-10 00:39:00,581 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2025-01-10 00:39:00,581 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 100 flow [2025-01-10 00:39:00,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:00,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:00,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:39:00,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:39:00,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-01-10 00:39:00,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:00,582 INFO L85 PathProgramCache]: Analyzing trace with hash 330571, now seen corresponding path program 1 times [2025-01-10 00:39:00,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:00,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717564998] [2025-01-10 00:39:00,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:00,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:00,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:39:00,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:39:00,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:00,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:00,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:00,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717564998] [2025-01-10 00:39:00,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717564998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:00,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:00,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:39:00,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418593369] [2025-01-10 00:39:00,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:00,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:39:00,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:00,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:39:00,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:39:00,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-01-10 00:39:00,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 100 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-01-10 00:39:00,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:00,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-01-10 00:39:00,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:00,734 INFO L124 PetriNetUnfolderBase]: 532/1124 cut-off events. [2025-01-10 00:39:00,734 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-10 00:39:00,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 1124 events. 532/1124 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6109 event pairs, 468 based on Foata normal form. 0/1106 useless extension candidates. Maximal degree in co-relation 2023. Up to 868 conditions per place. [2025-01-10 00:39:00,738 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 29 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-01-10 00:39:00,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 166 flow [2025-01-10 00:39:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:39:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:39:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-01-10 00:39:00,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-01-10 00:39:00,740 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 100 flow. Second operand 3 states and 90 transitions. [2025-01-10 00:39:00,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 166 flow [2025-01-10 00:39:00,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:39:00,741 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 113 flow [2025-01-10 00:39:00,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2025-01-10 00:39:00,742 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2025-01-10 00:39:00,742 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 113 flow [2025-01-10 00:39:00,743 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-01-10 00:39:00,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:00,743 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 00:39:00,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:39:00,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-01-10 00:39:00,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:00,743 INFO L85 PathProgramCache]: Analyzing trace with hash 317689289, now seen corresponding path program 1 times [2025-01-10 00:39:00,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:00,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504160154] [2025-01-10 00:39:00,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:00,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:00,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:39:00,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:39:00,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:00,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:00,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:00,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504160154] [2025-01-10 00:39:00,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504160154] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:39:00,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788043441] [2025-01-10 00:39:00,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:00,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:00,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:00,796 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:00,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:39:00,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:39:00,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:39:00,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:00,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:00,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 00:39:00,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:00,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:39:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:00,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788043441] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:39:00,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:39:00,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-01-10 00:39:00,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530404274] [2025-01-10 00:39:00,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:39:00,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:39:00,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:00,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:39:00,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:39:00,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-01-10 00:39:00,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 113 flow. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:00,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:00,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-01-10 00:39:00,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:01,179 INFO L124 PetriNetUnfolderBase]: 534/1132 cut-off events. [2025-01-10 00:39:01,180 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-10 00:39:01,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2059 conditions, 1132 events. 534/1132 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6133 event pairs, 468 based on Foata normal form. 1/1116 useless extension candidates. Maximal degree in co-relation 2049. Up to 870 conditions per place. [2025-01-10 00:39:01,186 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 32 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2025-01-10 00:39:01,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 219 flow [2025-01-10 00:39:01,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:39:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:39:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2025-01-10 00:39:01,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2025-01-10 00:39:01,188 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 113 flow. Second operand 6 states and 157 transitions. [2025-01-10 00:39:01,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 219 flow [2025-01-10 00:39:01,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:39:01,190 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 163 flow [2025-01-10 00:39:01,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-01-10 00:39:01,191 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-01-10 00:39:01,192 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 163 flow [2025-01-10 00:39:01,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:01,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:01,193 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-01-10 00:39:01,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 00:39:01,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-10 00:39:01,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-01-10 00:39:01,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2132891581, now seen corresponding path program 2 times [2025-01-10 00:39:01,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:01,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559958300] [2025-01-10 00:39:01,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:39:01,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:01,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 00:39:01,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:39:01,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:39:01,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:01,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:01,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559958300] [2025-01-10 00:39:01,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559958300] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:39:01,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283551124] [2025-01-10 00:39:01,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:39:01,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:01,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:01,552 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:01,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:39:01,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 00:39:01,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:39:01,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:39:01,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:01,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 00:39:01,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:01,754 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:01,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283551124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:01,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 00:39:01,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-01-10 00:39:01,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900453355] [2025-01-10 00:39:01,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:01,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:39:01,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:01,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:39:01,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:39:01,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-01-10 00:39:01,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 163 flow. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:01,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:01,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-01-10 00:39:01,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:01,947 INFO L124 PetriNetUnfolderBase]: 534/1131 cut-off events. [2025-01-10 00:39:01,947 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-01-10 00:39:01,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2072 conditions, 1131 events. 534/1131 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6131 event pairs, 468 based on Foata normal form. 1/1116 useless extension candidates. Maximal degree in co-relation 2058. Up to 866 conditions per place. [2025-01-10 00:39:01,952 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 28 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2025-01-10 00:39:01,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 237 flow [2025-01-10 00:39:01,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:39:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:39:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2025-01-10 00:39:01,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4263392857142857 [2025-01-10 00:39:01,953 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 163 flow. Second operand 8 states and 191 transitions. [2025-01-10 00:39:01,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 237 flow [2025-01-10 00:39:01,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 211 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-01-10 00:39:01,955 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 155 flow [2025-01-10 00:39:01,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=155, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2025-01-10 00:39:01,955 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2025-01-10 00:39:01,955 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 155 flow [2025-01-10 00:39:01,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:01,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:01,956 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:01,962 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-01-10 00:39:02,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 00:39:02,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-01-10 00:39:02,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:02,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2113671448, now seen corresponding path program 1 times [2025-01-10 00:39:02,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:02,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392410320] [2025-01-10 00:39:02,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:02,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:02,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:39:02,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:39:02,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:02,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:02,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:02,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392410320] [2025-01-10 00:39:02,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392410320] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:39:02,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31858658] [2025-01-10 00:39:02,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:02,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:02,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:02,199 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:39:02,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:39:02,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:39:02,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:39:02,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:02,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:02,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:39:02,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:02,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:39:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:02,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31858658] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:39:02,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:39:02,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-10 00:39:02,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636523755] [2025-01-10 00:39:02,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:39:02,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:39:02,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:02,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:39:02,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:39:02,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 56 [2025-01-10 00:39:02,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 155 flow. Second operand has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:02,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:02,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 56 [2025-01-10 00:39:02,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:02,408 INFO L124 PetriNetUnfolderBase]: 532/1132 cut-off events. [2025-01-10 00:39:02,409 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-01-10 00:39:02,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2076 conditions, 1132 events. 532/1132 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6107 event pairs, 468 based on Foata normal form. 4/1120 useless extension candidates. Maximal degree in co-relation 2064. Up to 865 conditions per place. [2025-01-10 00:39:02,415 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 31 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2025-01-10 00:39:02,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 54 transitions, 250 flow [2025-01-10 00:39:02,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:39:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:39:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2025-01-10 00:39:02,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-01-10 00:39:02,416 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 155 flow. Second operand 8 states and 203 transitions. [2025-01-10 00:39:02,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 54 transitions, 250 flow [2025-01-10 00:39:02,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 232 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 00:39:02,418 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 167 flow [2025-01-10 00:39:02,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=167, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2025-01-10 00:39:02,418 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-01-10 00:39:02,418 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 167 flow [2025-01-10 00:39:02,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:02,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:02,419 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:02,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 00:39:02,619 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,SelfDestructingSolverStorable10 [2025-01-10 00:39:02,620 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-01-10 00:39:02,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:02,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1875710944, now seen corresponding path program 2 times [2025-01-10 00:39:02,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:02,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037135587] [2025-01-10 00:39:02,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:39:02,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:02,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 00:39:02,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-01-10 00:39:02,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:39:02,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 00:39:02,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:02,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037135587] [2025-01-10 00:39:02,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037135587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:02,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:02,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:39:02,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964873290] [2025-01-10 00:39:02,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:02,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:39:02,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:02,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:39:02,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:39:02,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-01-10 00:39:02,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:02,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:02,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-01-10 00:39:02,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:02,958 INFO L124 PetriNetUnfolderBase]: 1009/2081 cut-off events. [2025-01-10 00:39:02,958 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-01-10 00:39:02,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3834 conditions, 2081 events. 1009/2081 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 12182 event pairs, 168 based on Foata normal form. 33/2077 useless extension candidates. Maximal degree in co-relation 3820. Up to 688 conditions per place. [2025-01-10 00:39:02,967 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 65 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2025-01-10 00:39:02,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 385 flow [2025-01-10 00:39:02,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:39:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:39:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-01-10 00:39:02,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-10 00:39:02,968 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 167 flow. Second operand 5 states and 160 transitions. [2025-01-10 00:39:02,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 385 flow [2025-01-10 00:39:02,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 84 transitions, 377 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:39:02,970 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 186 flow [2025-01-10 00:39:02,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2025-01-10 00:39:02,971 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2025-01-10 00:39:02,971 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 186 flow [2025-01-10 00:39:02,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:02,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:02,971 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 00:39:02,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:39:02,971 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-01-10 00:39:02,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash 849244526, now seen corresponding path program 1 times [2025-01-10 00:39:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:02,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685106152] [2025-01-10 00:39:02,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:02,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:39:02,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:39:02,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:02,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:39:02,991 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:39:02,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:39:03,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:39:03,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:03,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:39:03,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:39:03,011 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:39:03,011 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-10 00:39:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2025-01-10 00:39:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2025-01-10 00:39:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2025-01-10 00:39:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2025-01-10 00:39:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2025-01-10 00:39:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (6 of 13 remaining) [2025-01-10 00:39:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2025-01-10 00:39:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2025-01-10 00:39:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2025-01-10 00:39:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2025-01-10 00:39:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2025-01-10 00:39:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2025-01-10 00:39:03,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:39:03,011 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-01-10 00:39:03,012 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:39:03,012 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:39:03,038 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:39:03,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 78 transitions, 174 flow [2025-01-10 00:39:03,045 INFO L124 PetriNetUnfolderBase]: 10/92 cut-off events. [2025-01-10 00:39:03,046 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 00:39:03,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 92 events. 10/92 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 262 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 69. Up to 4 conditions per place. [2025-01-10 00:39:03,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 78 transitions, 174 flow [2025-01-10 00:39:03,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 78 transitions, 174 flow [2025-01-10 00:39:03,047 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:39:03,048 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;@8e7672a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:39:03,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-10 00:39:03,049 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:39:03,049 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 00:39:03,049 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:39:03,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:03,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:39:03,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-01-10 00:39:03,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:03,050 INFO L85 PathProgramCache]: Analyzing trace with hash 408024, now seen corresponding path program 1 times [2025-01-10 00:39:03,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:03,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695825889] [2025-01-10 00:39:03,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:03,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:03,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:39:03,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:39:03,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:03,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:03,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:03,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695825889] [2025-01-10 00:39:03,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695825889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:03,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:03,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:39:03,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224096957] [2025-01-10 00:39:03,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:03,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:39:03,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:03,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:39:03,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:39:03,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 78 [2025-01-10 00:39:03,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:03,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:03,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 78 [2025-01-10 00:39:03,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:03,915 INFO L124 PetriNetUnfolderBase]: 8632/14646 cut-off events. [2025-01-10 00:39:03,916 INFO L125 PetriNetUnfolderBase]: For 688/688 co-relation queries the response was YES. [2025-01-10 00:39:03,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27049 conditions, 14646 events. 8632/14646 cut-off events. For 688/688 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 106962 event pairs, 7668 based on Foata normal form. 1878/16295 useless extension candidates. Maximal degree in co-relation 8570. Up to 11966 conditions per place. [2025-01-10 00:39:04,006 INFO L140 encePairwiseOnDemand]: 66/78 looper letters, 38 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2025-01-10 00:39:04,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 220 flow [2025-01-10 00:39:04,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:39:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:39:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-01-10 00:39:04,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5213675213675214 [2025-01-10 00:39:04,008 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 174 flow. Second operand 3 states and 122 transitions. [2025-01-10 00:39:04,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 220 flow [2025-01-10 00:39:04,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 62 transitions, 218 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 00:39:04,010 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 142 flow [2025-01-10 00:39:04,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-01-10 00:39:04,012 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -8 predicate places. [2025-01-10 00:39:04,012 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 142 flow [2025-01-10 00:39:04,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:04,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:04,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:39:04,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:39:04,013 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-01-10 00:39:04,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash 408025, now seen corresponding path program 1 times [2025-01-10 00:39:04,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:04,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896978510] [2025-01-10 00:39:04,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:04,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:39:04,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:39:04,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:04,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:04,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:04,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896978510] [2025-01-10 00:39:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896978510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:04,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:04,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:39:04,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308489575] [2025-01-10 00:39:04,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:04,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:39:04,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:04,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:39:04,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:39:04,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-01-10 00:39:04,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:04,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:04,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-01-10 00:39:04,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:04,892 INFO L124 PetriNetUnfolderBase]: 8632/14648 cut-off events. [2025-01-10 00:39:04,892 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-01-10 00:39:04,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26956 conditions, 14648 events. 8632/14648 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 107061 event pairs, 7668 based on Foata normal form. 0/14418 useless extension candidates. Maximal degree in co-relation 26947. Up to 11968 conditions per place. [2025-01-10 00:39:04,955 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 40 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-01-10 00:39:04,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 230 flow [2025-01-10 00:39:04,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:39:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:39:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2025-01-10 00:39:04,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5341880341880342 [2025-01-10 00:39:04,957 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 142 flow. Second operand 3 states and 125 transitions. [2025-01-10 00:39:04,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 230 flow [2025-01-10 00:39:04,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:39:04,958 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 155 flow [2025-01-10 00:39:04,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-01-10 00:39:04,959 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -6 predicate places. [2025-01-10 00:39:04,959 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 155 flow [2025-01-10 00:39:04,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:04,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:04,959 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 00:39:04,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:39:04,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-01-10 00:39:04,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:04,960 INFO L85 PathProgramCache]: Analyzing trace with hash 392125079, now seen corresponding path program 1 times [2025-01-10 00:39:04,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:04,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561987797] [2025-01-10 00:39:04,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:04,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:04,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:39:04,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:39:04,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:04,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:05,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:05,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561987797] [2025-01-10 00:39:05,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561987797] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:39:05,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447935419] [2025-01-10 00:39:05,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:05,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:05,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:05,002 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-01-10 00:39:05,004 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-01-10 00:39:05,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:39:05,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:39:05,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:05,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:05,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 00:39:05,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:05,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:39:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:05,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447935419] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:39:05,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:39:05,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-01-10 00:39:05,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503196257] [2025-01-10 00:39:05,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:39:05,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:39:05,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:05,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:39:05,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:39:05,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-01-10 00:39:05,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 155 flow. Second operand has 8 states, 8 states have (on average 28.875) internal successors, (231), 8 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:05,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:05,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-01-10 00:39:05,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:05,977 INFO L124 PetriNetUnfolderBase]: 8634/14656 cut-off events. [2025-01-10 00:39:05,977 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-01-10 00:39:05,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26984 conditions, 14656 events. 8634/14656 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 106996 event pairs, 7668 based on Foata normal form. 1/14428 useless extension candidates. Maximal degree in co-relation 26973. Up to 11970 conditions per place. [2025-01-10 00:39:06,046 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 43 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2025-01-10 00:39:06,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 72 transitions, 283 flow [2025-01-10 00:39:06,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:39:06,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:39:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2025-01-10 00:39:06,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-01-10 00:39:06,048 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 155 flow. Second operand 6 states and 216 transitions. [2025-01-10 00:39:06,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 72 transitions, 283 flow [2025-01-10 00:39:06,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 72 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:39:06,050 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 205 flow [2025-01-10 00:39:06,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2025-01-10 00:39:06,050 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2025-01-10 00:39:06,050 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 205 flow [2025-01-10 00:39:06,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.875) internal successors, (231), 8 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:06,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:06,050 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-01-10 00:39:06,057 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-01-10 00:39:06,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:06,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-01-10 00:39:06,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:06,252 INFO L85 PathProgramCache]: Analyzing trace with hash -938283055, now seen corresponding path program 2 times [2025-01-10 00:39:06,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:06,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028715302] [2025-01-10 00:39:06,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:39:06,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:06,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 00:39:06,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:39:06,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:39:06,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:06,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:06,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028715302] [2025-01-10 00:39:06,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028715302] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:39:06,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987202881] [2025-01-10 00:39:06,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:39:06,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:06,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:06,416 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-01-10 00:39:06,418 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-01-10 00:39:06,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 00:39:06,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:39:06,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:39:06,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:06,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 00:39:06,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:06,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:39:06,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987202881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:06,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 00:39:06,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-01-10 00:39:06,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682741144] [2025-01-10 00:39:06,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:06,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:39:06,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:06,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:39:06,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:39:06,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-01-10 00:39:06,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 205 flow. Second operand has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:06,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:06,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-01-10 00:39:06,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:07,529 INFO L124 PetriNetUnfolderBase]: 8634/14655 cut-off events. [2025-01-10 00:39:07,529 INFO L125 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2025-01-10 00:39:07,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26997 conditions, 14655 events. 8634/14655 cut-off events. For 409/409 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 107053 event pairs, 7668 based on Foata normal form. 1/14428 useless extension candidates. Maximal degree in co-relation 26982. Up to 11966 conditions per place. [2025-01-10 00:39:07,586 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 39 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2025-01-10 00:39:07,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 71 transitions, 301 flow [2025-01-10 00:39:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:39:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:39:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 266 transitions. [2025-01-10 00:39:07,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42628205128205127 [2025-01-10 00:39:07,589 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 205 flow. Second operand 8 states and 266 transitions. [2025-01-10 00:39:07,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 71 transitions, 301 flow [2025-01-10 00:39:07,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 275 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-01-10 00:39:07,591 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 197 flow [2025-01-10 00:39:07,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=197, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2025-01-10 00:39:07,591 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2025-01-10 00:39:07,591 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 197 flow [2025-01-10 00:39:07,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:07,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:07,592 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:07,600 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-01-10 00:39:07,792 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,SelfDestructingSolverStorable16 [2025-01-10 00:39:07,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-01-10 00:39:07,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:07,793 INFO L85 PathProgramCache]: Analyzing trace with hash -918437311, now seen corresponding path program 1 times [2025-01-10 00:39:07,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:07,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892283106] [2025-01-10 00:39:07,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:07,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:07,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:39:07,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:39:07,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:07,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:07,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:07,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892283106] [2025-01-10 00:39:07,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892283106] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:39:07,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154343450] [2025-01-10 00:39:07,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:07,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:39:07,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:39:07,831 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-01-10 00:39:07,833 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-01-10 00:39:07,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:39:07,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:39:07,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:07,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:07,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:39:07,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:39:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:07,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:39:07,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:07,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154343450] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:39:07,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:39:07,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-10 00:39:07,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114877921] [2025-01-10 00:39:07,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:39:07,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:39:07,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:07,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:39:07,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:39:07,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 78 [2025-01-10 00:39:07,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 197 flow. Second operand has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:07,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:07,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 78 [2025-01-10 00:39:07,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:08,683 INFO L124 PetriNetUnfolderBase]: 8632/14656 cut-off events. [2025-01-10 00:39:08,684 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2025-01-10 00:39:08,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27001 conditions, 14656 events. 8632/14656 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 106963 event pairs, 7668 based on Foata normal form. 4/14432 useless extension candidates. Maximal degree in co-relation 26988. Up to 11965 conditions per place. [2025-01-10 00:39:08,742 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 42 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2025-01-10 00:39:08,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 72 transitions, 314 flow [2025-01-10 00:39:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:39:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:39:08,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 278 transitions. [2025-01-10 00:39:08,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44551282051282054 [2025-01-10 00:39:08,745 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 197 flow. Second operand 8 states and 278 transitions. [2025-01-10 00:39:08,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 72 transitions, 314 flow [2025-01-10 00:39:08,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 296 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 00:39:08,746 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 209 flow [2025-01-10 00:39:08,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=209, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2025-01-10 00:39:08,747 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 7 predicate places. [2025-01-10 00:39:08,747 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 209 flow [2025-01-10 00:39:08,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:08,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:08,747 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:08,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 00:39:08,948 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,SelfDestructingSolverStorable17 [2025-01-10 00:39:08,948 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-01-10 00:39:08,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:08,948 INFO L85 PathProgramCache]: Analyzing trace with hash -904593351, now seen corresponding path program 2 times [2025-01-10 00:39:08,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:08,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567639973] [2025-01-10 00:39:08,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:39:08,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:08,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 00:39:08,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-01-10 00:39:08,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:39:08,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 00:39:09,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:09,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567639973] [2025-01-10 00:39:09,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567639973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:09,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:09,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:39:09,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463162619] [2025-01-10 00:39:09,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:09,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:39:09,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:09,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:39:09,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:39:09,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-01-10 00:39:09,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:09,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:09,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-01-10 00:39:09,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:10,475 INFO L124 PetriNetUnfolderBase]: 16399/27295 cut-off events. [2025-01-10 00:39:10,475 INFO L125 PetriNetUnfolderBase]: For 662/662 co-relation queries the response was YES. [2025-01-10 00:39:10,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50709 conditions, 27295 events. 16399/27295 cut-off events. For 662/662 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 207986 event pairs, 5643 based on Foata normal form. 333/27052 useless extension candidates. Maximal degree in co-relation 50694. Up to 9568 conditions per place. [2025-01-10 00:39:10,593 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 98 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2025-01-10 00:39:10,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 124 transitions, 547 flow [2025-01-10 00:39:10,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:39:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:39:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2025-01-10 00:39:10,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5974358974358974 [2025-01-10 00:39:10,594 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 209 flow. Second operand 5 states and 233 transitions. [2025-01-10 00:39:10,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 124 transitions, 547 flow [2025-01-10 00:39:10,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 124 transitions, 539 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:39:10,596 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 228 flow [2025-01-10 00:39:10,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2025-01-10 00:39:10,596 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 9 predicate places. [2025-01-10 00:39:10,596 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 228 flow [2025-01-10 00:39:10,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:10,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:10,597 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:10,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:39:10,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-01-10 00:39:10,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:10,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1249050721, now seen corresponding path program 1 times [2025-01-10 00:39:10,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:10,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330292468] [2025-01-10 00:39:10,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:10,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:10,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:39:10,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:39:10,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:10,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 00:39:10,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:10,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330292468] [2025-01-10 00:39:10,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330292468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:10,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:10,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:39:10,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516836817] [2025-01-10 00:39:10,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:10,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:39:10,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:10,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:39:10,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:39:10,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-01-10 00:39:10,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:10,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:10,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-01-10 00:39:10,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:13,639 INFO L124 PetriNetUnfolderBase]: 29468/48959 cut-off events. [2025-01-10 00:39:13,639 INFO L125 PetriNetUnfolderBase]: For 8329/8812 co-relation queries the response was YES. [2025-01-10 00:39:13,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96680 conditions, 48959 events. 29468/48959 cut-off events. For 8329/8812 co-relation queries the response was YES. Maximal size of possible extension queue 1104. Compared 397926 event pairs, 7462 based on Foata normal form. 594/48647 useless extension candidates. Maximal degree in co-relation 96662. Up to 17136 conditions per place. [2025-01-10 00:39:13,887 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 102 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2025-01-10 00:39:13,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 128 transitions, 604 flow [2025-01-10 00:39:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:39:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:39:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2025-01-10 00:39:13,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5923076923076923 [2025-01-10 00:39:13,888 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 228 flow. Second operand 5 states and 231 transitions. [2025-01-10 00:39:13,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 128 transitions, 604 flow [2025-01-10 00:39:13,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 128 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:39:13,894 INFO L231 Difference]: Finished difference. Result has 89 places, 72 transitions, 254 flow [2025-01-10 00:39:13,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=254, PETRI_PLACES=89, PETRI_TRANSITIONS=72} [2025-01-10 00:39:13,894 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 14 predicate places. [2025-01-10 00:39:13,894 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 72 transitions, 254 flow [2025-01-10 00:39:13,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:13,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:13,895 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 00:39:13,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:39:13,895 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-01-10 00:39:13,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:13,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1616877999, now seen corresponding path program 1 times [2025-01-10 00:39:13,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:13,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988491986] [2025-01-10 00:39:13,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:13,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:13,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 00:39:13,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 00:39:13,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:13,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:39:13,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:39:13,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 00:39:13,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 00:39:13,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:13,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:39:13,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:39:13,923 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:39:13,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-01-10 00:39:13,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2025-01-10 00:39:13,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-01-10 00:39:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (12 of 16 remaining) [2025-01-10 00:39:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-01-10 00:39:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-01-10 00:39:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (9 of 16 remaining) [2025-01-10 00:39:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-01-10 00:39:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-01-10 00:39:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2025-01-10 00:39:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-01-10 00:39:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-01-10 00:39:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 16 remaining) [2025-01-10 00:39:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-01-10 00:39:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-01-10 00:39:13,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2025-01-10 00:39:13,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:39:13,925 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-01-10 00:39:13,925 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:39:13,926 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 00:39:13,947 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:39:13,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 100 transitions, 228 flow [2025-01-10 00:39:13,953 INFO L124 PetriNetUnfolderBase]: 13/119 cut-off events. [2025-01-10 00:39:13,953 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 00:39:13,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 119 events. 13/119 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 384 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 100. Up to 5 conditions per place. [2025-01-10 00:39:13,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 100 transitions, 228 flow [2025-01-10 00:39:13,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 100 transitions, 228 flow [2025-01-10 00:39:13,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:39:13,955 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;@8e7672a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:39:13,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-01-10 00:39:13,955 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:39:13,955 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 00:39:13,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:39:13,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:13,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:39:13,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:39:13,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:13,956 INFO L85 PathProgramCache]: Analyzing trace with hash 507324, now seen corresponding path program 1 times [2025-01-10 00:39:13,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:13,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092232215] [2025-01-10 00:39:13,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:13,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:13,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:39:13,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:39:13,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:13,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:13,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:13,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092232215] [2025-01-10 00:39:13,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092232215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:13,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:13,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:39:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097021281] [2025-01-10 00:39:13,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:13,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:39:13,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:13,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:39:13,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:39:13,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 100 [2025-01-10 00:39:13,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 100 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:13,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:13,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 100 [2025-01-10 00:39:13,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:39:23,330 INFO L124 PetriNetUnfolderBase]: 119632/179858 cut-off events. [2025-01-10 00:39:23,330 INFO L125 PetriNetUnfolderBase]: For 11956/11956 co-relation queries the response was YES. [2025-01-10 00:39:23,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338262 conditions, 179858 events. 119632/179858 cut-off events. For 11956/11956 co-relation queries the response was YES. Maximal size of possible extension queue 4931. Compared 1518878 event pairs, 106668 based on Foata normal form. 25424/202901 useless extension candidates. Maximal degree in co-relation 27148. Up to 152966 conditions per place. [2025-01-10 00:39:24,328 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 49 selfloop transitions, 1 changer transitions 0/80 dead transitions. [2025-01-10 00:39:24,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 80 transitions, 288 flow [2025-01-10 00:39:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:39:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:39:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-01-10 00:39:24,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5233333333333333 [2025-01-10 00:39:24,329 INFO L175 Difference]: Start difference. First operand has 96 places, 100 transitions, 228 flow. Second operand 3 states and 157 transitions. [2025-01-10 00:39:24,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 80 transitions, 288 flow [2025-01-10 00:39:24,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 80 transitions, 282 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-10 00:39:24,333 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 184 flow [2025-01-10 00:39:24,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2025-01-10 00:39:24,334 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -10 predicate places. [2025-01-10 00:39:24,334 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 184 flow [2025-01-10 00:39:24,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:24,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:39:24,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:39:24,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 00:39:24,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-01-10 00:39:24,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:39:24,335 INFO L85 PathProgramCache]: Analyzing trace with hash 507325, now seen corresponding path program 1 times [2025-01-10 00:39:24,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:39:24,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044005286] [2025-01-10 00:39:24,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:39:24,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:39:24,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:39:24,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:39:24,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:39:24,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:39:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:39:24,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:39:24,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044005286] [2025-01-10 00:39:24,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044005286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:39:24,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:39:24,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:39:24,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107792390] [2025-01-10 00:39:24,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:39:24,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:39:24,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:39:24,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:39:24,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:39:24,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 100 [2025-01-10 00:39:24,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 80 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:39:24,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:39:24,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 100 [2025-01-10 00:39:24,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand