./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:44:24,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:44:24,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:44:25,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:44:25,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:44:25,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:44:25,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:44:25,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:44:25,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:44:25,021 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:44:25,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:44:25,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:44:25,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:44:25,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:44:25,022 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:44:25,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:44:25,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:44:25,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:44:25,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:44:25,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:44:25,023 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:44:25,024 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:44:25,024 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:44:25,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:44:25,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:44:25,024 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:44:25,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:44:25,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:44:25,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:44:25,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:44:25,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:44:25,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:44:25,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:44:25,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:44:25,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:44:25,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:44:25,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:44:25,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:44:25,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:44:25,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:44:25,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:44:25,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:44:25,025 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-03-04 09:44:25,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:44:25,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:44:25,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:44:25,228 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:44:25,228 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:44:25,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-04 09:44:26,344 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14775b731/19572f7288ff449dbca83f4edfbb85df/FLAG383613607 [2025-03-04 09:44:26,639 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:44:26,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-04 09:44:26,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14775b731/19572f7288ff449dbca83f4edfbb85df/FLAG383613607 [2025-03-04 09:44:26,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14775b731/19572f7288ff449dbca83f4edfbb85df [2025-03-04 09:44:26,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:44:26,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:44:26,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:44:26,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:44:26,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:44:26,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:44:26" (1/1) ... [2025-03-04 09:44:26,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f564414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:26, skipping insertion in model container [2025-03-04 09:44:26,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:44:26" (1/1) ... [2025-03-04 09:44:26,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:44:27,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:44:27,237 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:44:27,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:44:27,291 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:44:27,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:27 WrapperNode [2025-03-04 09:44:27,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:44:27,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:44:27,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:44:27,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:44:27,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:27" (1/1) ... [2025-03-04 09:44:27,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:27" (1/1) ... [2025-03-04 09:44:27,316 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2025-03-04 09:44:27,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:44:27,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:44:27,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:44:27,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:44:27,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:27" (1/1) ... [2025-03-04 09:44:27,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:27" (1/1) ... [2025-03-04 09:44:27,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:27" (1/1) ... [2025-03-04 09:44:27,339 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-03-04 09:44:27,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:27" (1/1) ... [2025-03-04 09:44:27,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:27" (1/1) ... [2025-03-04 09:44:27,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:27" (1/1) ... [2025-03-04 09:44:27,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:27" (1/1) ... [2025-03-04 09:44:27,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:27" (1/1) ... [2025-03-04 09:44:27,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:27" (1/1) ... [2025-03-04 09:44:27,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:44:27,358 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:44:27,359 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:44:27,359 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:44:27,359 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:27" (1/1) ... [2025-03-04 09:44:27,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:44:27,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:27,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:44:27,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:44:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:44:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:44:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:44:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 09:44:27,402 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 09:44:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:44:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:44:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:44:27,403 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 09:44:27,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:44:27,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:44:27,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:44:27,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:44:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 09:44:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:44:27,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:44:27,405 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:44:27,495 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:44:27,497 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:44:27,668 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:44:27,668 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:44:27,774 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:44:27,774 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:44:27,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:27 BoogieIcfgContainer [2025-03-04 09:44:27,775 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:44:27,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:44:27,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:44:27,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:44:27,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:44:26" (1/3) ... [2025-03-04 09:44:27,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab2bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:27, skipping insertion in model container [2025-03-04 09:44:27,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:27" (2/3) ... [2025-03-04 09:44:27,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab2bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:27, skipping insertion in model container [2025-03-04 09:44:27,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:27" (3/3) ... [2025-03-04 09:44:27,782 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-03-04 09:44:27,791 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:44:27,792 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-03-04 09:44:27,792 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:44:27,822 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:27,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 34 transitions, 72 flow [2025-03-04 09:44:27,871 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-03-04 09:44:27,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:27,875 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 7. Compared 55 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-03-04 09:44:27,875 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 34 transitions, 72 flow [2025-03-04 09:44:27,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 34 transitions, 72 flow [2025-03-04 09:44:27,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:27,896 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;@2ccff166, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:27,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 09:44:27,900 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:27,900 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 09:44:27,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:27,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:27,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:27,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-04 09:44:27,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:27,905 INFO L85 PathProgramCache]: Analyzing trace with hash 235584, now seen corresponding path program 1 times [2025-03-04 09:44:27,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:27,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955058855] [2025-03-04 09:44:27,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:27,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:27,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:27,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:27,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:27,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:28,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:28,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955058855] [2025-03-04 09:44:28,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955058855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:28,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:28,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:28,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629788787] [2025-03-04 09:44:28,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:28,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:28,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:28,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:28,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:28,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-04 09:44:28,138 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-03-04 09:44:28,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:28,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-04 09:44:28,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:28,191 INFO L124 PetriNetUnfolderBase]: 22/79 cut-off events. [2025-03-04 09:44:28,191 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:28,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 79 events. 22/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 175 event pairs, 18 based on Foata normal form. 6/84 useless extension candidates. Maximal degree in co-relation 121. Up to 56 conditions per place. [2025-03-04 09:44:28,192 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 16 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-03-04 09:44:28,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 90 flow [2025-03-04 09:44:28,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-03-04 09:44:28,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2025-03-04 09:44:28,204 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 72 flow. Second operand 3 states and 52 transitions. [2025-03-04 09:44:28,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 90 flow [2025-03-04 09:44:28,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 90 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:28,209 INFO L231 Difference]: Finished difference. Result has 29 places, 26 transitions, 58 flow [2025-03-04 09:44:28,210 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-03-04 09:44:28,215 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -4 predicate places. [2025-03-04 09:44:28,215 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 58 flow [2025-03-04 09:44:28,216 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-03-04 09:44:28,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:28,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:28,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:44:28,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-04 09:44:28,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:28,217 INFO L85 PathProgramCache]: Analyzing trace with hash 235585, now seen corresponding path program 1 times [2025-03-04 09:44:28,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:28,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153447029] [2025-03-04 09:44:28,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:28,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:28,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:28,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:28,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:28,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:28,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:28,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153447029] [2025-03-04 09:44:28,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153447029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:28,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:28,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:28,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273613344] [2025-03-04 09:44:28,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:28,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:28,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:28,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:28,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:28,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-03-04 09:44:28,354 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-03-04 09:44:28,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:28,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-03-04 09:44:28,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:28,412 INFO L124 PetriNetUnfolderBase]: 22/81 cut-off events. [2025-03-04 09:44:28,413 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:28,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 81 events. 22/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 175 event pairs, 18 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 140. Up to 58 conditions per place. [2025-03-04 09:44:28,413 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 18 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2025-03-04 09:44:28,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 102 flow [2025-03-04 09:44:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:28,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-04 09:44:28,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5392156862745098 [2025-03-04 09:44:28,415 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 58 flow. Second operand 3 states and 55 transitions. [2025-03-04 09:44:28,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 102 flow [2025-03-04 09:44:28,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 101 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:28,417 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 71 flow [2025-03-04 09:44:28,417 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-03-04 09:44:28,417 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2025-03-04 09:44:28,417 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 71 flow [2025-03-04 09:44:28,418 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-03-04 09:44:28,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:28,418 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 09:44:28,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:44:28,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-04 09:44:28,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:28,419 INFO L85 PathProgramCache]: Analyzing trace with hash 226405013, now seen corresponding path program 1 times [2025-03-04 09:44:28,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:28,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376125937] [2025-03-04 09:44:28,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:28,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:28,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:28,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:28,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:28,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:28,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:28,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376125937] [2025-03-04 09:44:28,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376125937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:28,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924831775] [2025-03-04 09:44:28,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:28,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:28,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:28,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:28,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:44:28,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:28,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:28,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:28,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:28,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:44:28,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:28,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:28,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924831775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:28,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:28,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-04 09:44:28,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174706743] [2025-03-04 09:44:28,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:28,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:44:28,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:28,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:44:28,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:44:28,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-03-04 09:44:28,765 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-03-04 09:44:28,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:28,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-03-04 09:44:28,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:28,891 INFO L124 PetriNetUnfolderBase]: 24/89 cut-off events. [2025-03-04 09:44:28,891 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:28,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 89 events. 24/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 197 event pairs, 18 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 166. Up to 60 conditions per place. [2025-03-04 09:44:28,894 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 21 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2025-03-04 09:44:28,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 155 flow [2025-03-04 09:44:28,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:44:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:44:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-03-04 09:44:28,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-03-04 09:44:28,896 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 71 flow. Second operand 6 states and 98 transitions. [2025-03-04 09:44:28,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 155 flow [2025-03-04 09:44:28,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:28,898 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 121 flow [2025-03-04 09:44:28,898 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-03-04 09:44:28,898 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2025-03-04 09:44:28,898 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 121 flow [2025-03-04 09:44:28,899 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-03-04 09:44:28,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:28,899 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-04 09:44:28,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:44:29,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:29,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-04 09:44:29,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:29,106 INFO L85 PathProgramCache]: Analyzing trace with hash -743357551, now seen corresponding path program 2 times [2025-03-04 09:44:29,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:29,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335846483] [2025-03-04 09:44:29,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:29,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:29,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 09:44:29,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:29,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:29,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:29,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:29,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335846483] [2025-03-04 09:44:29,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335846483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:29,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417673609] [2025-03-04 09:44:29,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:29,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:29,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:29,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:29,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:44:29,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 09:44:29,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:29,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:29,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:29,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 09:44:29,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:29,547 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:29,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417673609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:29,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 09:44:29,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-04 09:44:29,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605162295] [2025-03-04 09:44:29,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:29,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:44:29,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:29,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:44:29,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:44:29,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-03-04 09:44:29,570 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-03-04 09:44:29,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:29,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-03-04 09:44:29,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:29,659 INFO L124 PetriNetUnfolderBase]: 24/88 cut-off events. [2025-03-04 09:44:29,660 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 09:44:29,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 88 events. 24/88 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 187 event pairs, 18 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 175. Up to 56 conditions per place. [2025-03-04 09:44:29,661 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 17 selfloop transitions, 10 changer transitions 0/35 dead transitions. [2025-03-04 09:44:29,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 173 flow [2025-03-04 09:44:29,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:44:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:44:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2025-03-04 09:44:29,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2025-03-04 09:44:29,663 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 121 flow. Second operand 8 states and 116 transitions. [2025-03-04 09:44:29,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 173 flow [2025-03-04 09:44:29,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 147 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-04 09:44:29,666 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 113 flow [2025-03-04 09:44:29,666 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-03-04 09:44:29,667 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-03-04 09:44:29,667 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 113 flow [2025-03-04 09:44:29,667 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-03-04 09:44:29,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:29,667 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 09:44:29,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:44:29,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 09:44:29,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-04 09:44:29,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:29,869 INFO L85 PathProgramCache]: Analyzing trace with hash -711967714, now seen corresponding path program 1 times [2025-03-04 09:44:29,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:29,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141473558] [2025-03-04 09:44:29,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:29,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:29,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:29,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:29,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:29,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:29,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:29,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141473558] [2025-03-04 09:44:29,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141473558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:29,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250176371] [2025-03-04 09:44:29,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:29,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:29,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:29,939 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:29,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:44:29,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:29,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:29,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:29,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:29,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:44:29,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:30,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:30,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250176371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:30,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:30,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 09:44:30,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054311947] [2025-03-04 09:44:30,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:30,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 09:44:30,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:30,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 09:44:30,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:44:30,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-04 09:44:30,042 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-03-04 09:44:30,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:30,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-04 09:44:30,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:30,083 INFO L124 PetriNetUnfolderBase]: 22/89 cut-off events. [2025-03-04 09:44:30,084 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 09:44:30,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 89 events. 22/89 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 172 event pairs, 18 based on Foata normal form. 4/93 useless extension candidates. Maximal degree in co-relation 181. Up to 55 conditions per place. [2025-03-04 09:44:30,084 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 20 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2025-03-04 09:44:30,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 186 flow [2025-03-04 09:44:30,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:44:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:44:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2025-03-04 09:44:30,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-03-04 09:44:30,086 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 113 flow. Second operand 8 states and 128 transitions. [2025-03-04 09:44:30,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 186 flow [2025-03-04 09:44:30,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 168 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 09:44:30,087 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 125 flow [2025-03-04 09:44:30,087 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-03-04 09:44:30,087 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2025-03-04 09:44:30,087 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 125 flow [2025-03-04 09:44:30,088 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-03-04 09:44:30,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:30,088 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1] [2025-03-04 09:44:30,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 09:44:30,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:30,288 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-04 09:44:30,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:30,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1211787410, now seen corresponding path program 2 times [2025-03-04 09:44:30,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:30,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163612387] [2025-03-04 09:44:30,289 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:30,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:30,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 09:44:30,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:44:30,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:30,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:30,324 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:30,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:44:30,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:44:30,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:30,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:30,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:30,353 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:30,354 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-04 09:44:30,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2025-03-04 09:44:30,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2025-03-04 09:44:30,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2025-03-04 09:44:30,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2025-03-04 09:44:30,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2025-03-04 09:44:30,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2025-03-04 09:44:30,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2025-03-04 09:44:30,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2025-03-04 09:44:30,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2025-03-04 09:44:30,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:44:30,357 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-03-04 09:44:30,359 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:44:30,359 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 09:44:30,377 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:30,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 122 flow [2025-03-04 09:44:30,386 INFO L124 PetriNetUnfolderBase]: 7/65 cut-off events. [2025-03-04 09:44:30,386 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:44:30,386 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 8. Compared 140 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-03-04 09:44:30,387 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 56 transitions, 122 flow [2025-03-04 09:44:30,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 56 transitions, 122 flow [2025-03-04 09:44:30,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:30,389 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;@2ccff166, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:30,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 09:44:30,390 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:30,390 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 09:44:30,390 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:30,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:30,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:30,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-04 09:44:30,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:30,391 INFO L85 PathProgramCache]: Analyzing trace with hash 291192, now seen corresponding path program 1 times [2025-03-04 09:44:30,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:30,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162578347] [2025-03-04 09:44:30,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:30,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:30,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:30,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:30,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:30,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:30,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:30,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162578347] [2025-03-04 09:44:30,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162578347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:30,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:30,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:30,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326951653] [2025-03-04 09:44:30,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:30,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:30,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:30,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:30,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:30,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 56 [2025-03-04 09:44:30,438 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-03-04 09:44:30,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:30,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 56 [2025-03-04 09:44:30,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:30,541 INFO L124 PetriNetUnfolderBase]: 532/1122 cut-off events. [2025-03-04 09:44:30,541 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-04 09:44:30,544 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 6101 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-03-04 09:44:30,549 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 27 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2025-03-04 09:44:30,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 154 flow [2025-03-04 09:44:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-04 09:44:30,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2025-03-04 09:44:30,550 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 122 flow. Second operand 3 states and 87 transitions. [2025-03-04 09:44:30,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 154 flow [2025-03-04 09:44:30,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:30,551 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 100 flow [2025-03-04 09:44:30,551 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-03-04 09:44:30,552 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2025-03-04 09:44:30,552 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 100 flow [2025-03-04 09:44:30,552 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-03-04 09:44:30,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:30,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:30,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:44:30,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-04 09:44:30,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:30,552 INFO L85 PathProgramCache]: Analyzing trace with hash 291193, now seen corresponding path program 1 times [2025-03-04 09:44:30,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:30,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689756508] [2025-03-04 09:44:30,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:30,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:30,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:30,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:30,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:30,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:30,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:30,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689756508] [2025-03-04 09:44:30,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689756508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:30,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:30,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:30,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725387449] [2025-03-04 09:44:30,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:30,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:30,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:30,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:30,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:30,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-04 09:44:30,594 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-03-04 09:44:30,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:30,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-04 09:44:30,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:30,716 INFO L124 PetriNetUnfolderBase]: 532/1124 cut-off events. [2025-03-04 09:44:30,716 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-04 09:44:30,718 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 6115 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-03-04 09:44:30,722 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 29 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-03-04 09:44:30,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 166 flow [2025-03-04 09:44:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-04 09:44:30,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-03-04 09:44:30,723 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 100 flow. Second operand 3 states and 90 transitions. [2025-03-04 09:44:30,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 166 flow [2025-03-04 09:44:30,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:30,724 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 113 flow [2025-03-04 09:44:30,724 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-03-04 09:44:30,725 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2025-03-04 09:44:30,725 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 113 flow [2025-03-04 09:44:30,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:30,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:30,725 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 09:44:30,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:44:30,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-04 09:44:30,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash 279846093, now seen corresponding path program 1 times [2025-03-04 09:44:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:30,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118758651] [2025-03-04 09:44:30,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:30,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:30,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:30,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:30,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:30,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:30,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:30,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118758651] [2025-03-04 09:44:30,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118758651] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:30,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393549502] [2025-03-04 09:44:30,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:30,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:30,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:30,786 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:30,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:44:30,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:30,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:30,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:30,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:30,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:44:30,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:30,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:30,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393549502] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:30,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:30,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-04 09:44:30,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136721804] [2025-03-04 09:44:30,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:30,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:44:30,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:30,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:44:30,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:44:30,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-04 09:44:30,981 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-03-04 09:44:30,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:30,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-04 09:44:30,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:31,157 INFO L124 PetriNetUnfolderBase]: 534/1132 cut-off events. [2025-03-04 09:44:31,158 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-04 09:44:31,159 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 6132 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-03-04 09:44:31,163 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 32 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2025-03-04 09:44:31,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 219 flow [2025-03-04 09:44:31,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:44:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:44:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2025-03-04 09:44:31,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2025-03-04 09:44:31,164 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 113 flow. Second operand 6 states and 157 transitions. [2025-03-04 09:44:31,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 219 flow [2025-03-04 09:44:31,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:31,165 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 163 flow [2025-03-04 09:44:31,165 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-03-04 09:44:31,166 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-03-04 09:44:31,166 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 163 flow [2025-03-04 09:44:31,166 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-03-04 09:44:31,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:31,166 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-04 09:44:31,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 09:44:31,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:31,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-04 09:44:31,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash -216071991, now seen corresponding path program 2 times [2025-03-04 09:44:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:31,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671323923] [2025-03-04 09:44:31,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:31,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:31,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 09:44:31,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:31,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:31,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:31,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:31,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671323923] [2025-03-04 09:44:31,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671323923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:31,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384817318] [2025-03-04 09:44:31,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:31,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:31,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:31,495 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:31,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:44:31,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 09:44:31,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:31,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:31,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:31,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 09:44:31,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:31,683 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:31,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384817318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:31,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 09:44:31,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-04 09:44:31,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185362279] [2025-03-04 09:44:31,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:31,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:44:31,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:31,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:44:31,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:44:31,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-04 09:44:31,717 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-03-04 09:44:31,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:31,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-04 09:44:31,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:31,859 INFO L124 PetriNetUnfolderBase]: 534/1131 cut-off events. [2025-03-04 09:44:31,859 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-04 09:44:31,862 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 6116 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-03-04 09:44:31,867 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 28 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2025-03-04 09:44:31,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 237 flow [2025-03-04 09:44:31,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:44:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:44:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2025-03-04 09:44:31,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4263392857142857 [2025-03-04 09:44:31,869 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 163 flow. Second operand 8 states and 191 transitions. [2025-03-04 09:44:31,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 237 flow [2025-03-04 09:44:31,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 211 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-04 09:44:31,870 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 155 flow [2025-03-04 09:44:31,870 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-03-04 09:44:31,871 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2025-03-04 09:44:31,871 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 155 flow [2025-03-04 09:44:31,871 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-03-04 09:44:31,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:31,871 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:31,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:44:32,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 09:44:32,077 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-04 09:44:32,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:32,077 INFO L85 PathProgramCache]: Analyzing trace with hash -184005296, now seen corresponding path program 1 times [2025-03-04 09:44:32,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:32,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492683186] [2025-03-04 09:44:32,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:32,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:32,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:32,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:32,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:32,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:32,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492683186] [2025-03-04 09:44:32,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492683186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:32,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59165396] [2025-03-04 09:44:32,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:32,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:32,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:32,145 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:32,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:44:32,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:32,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:32,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:32,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:32,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:44:32,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:32,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:32,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:32,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59165396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:32,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:32,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 09:44:32,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797517885] [2025-03-04 09:44:32,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:32,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 09:44:32,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:32,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 09:44:32,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:44:32,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 56 [2025-03-04 09:44:32,244 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-03-04 09:44:32,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:32,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 56 [2025-03-04 09:44:32,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:32,358 INFO L124 PetriNetUnfolderBase]: 532/1132 cut-off events. [2025-03-04 09:44:32,358 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-04 09:44:32,359 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 6108 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-03-04 09:44:32,363 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 31 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2025-03-04 09:44:32,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 54 transitions, 250 flow [2025-03-04 09:44:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:44:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:44:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2025-03-04 09:44:32,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-03-04 09:44:32,365 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 155 flow. Second operand 8 states and 203 transitions. [2025-03-04 09:44:32,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 54 transitions, 250 flow [2025-03-04 09:44:32,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 232 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 09:44:32,367 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 167 flow [2025-03-04 09:44:32,367 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-03-04 09:44:32,367 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-03-04 09:44:32,367 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 167 flow [2025-03-04 09:44:32,367 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-03-04 09:44:32,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:32,367 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:32,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 09:44:32,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:32,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-04 09:44:32,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:32,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1115255648, now seen corresponding path program 2 times [2025-03-04 09:44:32,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:32,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167239274] [2025-03-04 09:44:32,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:32,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:32,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 09:44:32,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-04 09:44:32,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:44:32,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 09:44:32,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:32,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167239274] [2025-03-04 09:44:32,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167239274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:32,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:32,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:32,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208655506] [2025-03-04 09:44:32,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:32,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:32,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:32,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:32,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:32,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-04 09:44:32,682 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-03-04 09:44:32,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:32,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-04 09:44:32,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:32,886 INFO L124 PetriNetUnfolderBase]: 1009/2081 cut-off events. [2025-03-04 09:44:32,887 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-03-04 09:44:32,889 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 12164 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-03-04 09:44:32,895 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 65 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2025-03-04 09:44:32,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 385 flow [2025-03-04 09:44:32,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:44:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:44:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-03-04 09:44:32,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 09:44:32,897 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 167 flow. Second operand 5 states and 160 transitions. [2025-03-04 09:44:32,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 385 flow [2025-03-04 09:44:32,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 84 transitions, 377 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:44:32,898 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 186 flow [2025-03-04 09:44:32,898 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-03-04 09:44:32,899 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2025-03-04 09:44:32,899 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 186 flow [2025-03-04 09:44:32,899 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-03-04 09:44:32,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:32,899 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 09:44:32,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:44:32,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-04 09:44:32,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:32,900 INFO L85 PathProgramCache]: Analyzing trace with hash -239774194, now seen corresponding path program 1 times [2025-03-04 09:44:32,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:32,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520928212] [2025-03-04 09:44:32,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:32,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:32,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:44:32,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:44:32,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:32,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:32,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:32,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:44:32,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:44:32,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:32,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:32,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:32,942 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:32,942 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-04 09:44:32,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2025-03-04 09:44:32,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2025-03-04 09:44:32,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2025-03-04 09:44:32,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2025-03-04 09:44:32,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2025-03-04 09:44:32,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 13 remaining) [2025-03-04 09:44:32,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2025-03-04 09:44:32,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2025-03-04 09:44:32,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2025-03-04 09:44:32,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2025-03-04 09:44:32,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2025-03-04 09:44:32,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2025-03-04 09:44:32,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:44:32,943 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-04 09:44:32,943 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:44:32,943 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 09:44:32,965 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:32,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 78 transitions, 174 flow [2025-03-04 09:44:32,971 INFO L124 PetriNetUnfolderBase]: 10/92 cut-off events. [2025-03-04 09:44:32,971 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 09:44:32,972 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 9. Compared 252 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-03-04 09:44:32,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 78 transitions, 174 flow [2025-03-04 09:44:32,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 78 transitions, 174 flow [2025-03-04 09:44:32,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:32,974 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;@2ccff166, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:32,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-04 09:44:32,975 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:32,975 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 09:44:32,975 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:32,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:32,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:32,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:32,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:32,976 INFO L85 PathProgramCache]: Analyzing trace with hash 368646, now seen corresponding path program 1 times [2025-03-04 09:44:32,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:32,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139130057] [2025-03-04 09:44:32,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:32,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:32,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:32,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:32,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:32,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:32,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:32,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139130057] [2025-03-04 09:44:32,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139130057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:32,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:32,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:32,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802231450] [2025-03-04 09:44:32,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:33,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:33,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:33,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:33,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:33,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 78 [2025-03-04 09:44:33,010 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-03-04 09:44:33,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:33,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 78 [2025-03-04 09:44:33,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:33,866 INFO L124 PetriNetUnfolderBase]: 8632/14646 cut-off events. [2025-03-04 09:44:33,866 INFO L125 PetriNetUnfolderBase]: For 688/688 co-relation queries the response was YES. [2025-03-04 09:44:33,885 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 107007 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-03-04 09:44:33,948 INFO L140 encePairwiseOnDemand]: 66/78 looper letters, 38 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2025-03-04 09:44:33,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 220 flow [2025-03-04 09:44:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:33,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:33,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-03-04 09:44:33,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5213675213675214 [2025-03-04 09:44:33,949 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 174 flow. Second operand 3 states and 122 transitions. [2025-03-04 09:44:33,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 220 flow [2025-03-04 09:44:33,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 62 transitions, 218 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:33,950 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 142 flow [2025-03-04 09:44:33,951 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-03-04 09:44:33,951 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -8 predicate places. [2025-03-04 09:44:33,951 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 142 flow [2025-03-04 09:44:33,951 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-03-04 09:44:33,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:33,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:33,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:44:33,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:33,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash 368647, now seen corresponding path program 1 times [2025-03-04 09:44:33,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:33,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38001881] [2025-03-04 09:44:33,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:33,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:33,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:33,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:33,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:33,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:33,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:33,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38001881] [2025-03-04 09:44:33,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38001881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:33,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:33,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918097268] [2025-03-04 09:44:33,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:33,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:33,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:33,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:33,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:33,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-03-04 09:44:33,995 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-03-04 09:44:33,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:33,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-03-04 09:44:33,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:34,840 INFO L124 PetriNetUnfolderBase]: 8632/14648 cut-off events. [2025-03-04 09:44:34,840 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-03-04 09:44:34,856 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 107001 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-03-04 09:44:34,893 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 40 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-03-04 09:44:34,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 230 flow [2025-03-04 09:44:34,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2025-03-04 09:44:34,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5341880341880342 [2025-03-04 09:44:34,894 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 142 flow. Second operand 3 states and 125 transitions. [2025-03-04 09:44:34,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 230 flow [2025-03-04 09:44:34,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:34,896 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 155 flow [2025-03-04 09:44:34,896 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-03-04 09:44:34,897 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -6 predicate places. [2025-03-04 09:44:34,897 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 155 flow [2025-03-04 09:44:34,897 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-03-04 09:44:34,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:34,897 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 09:44:34,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:44:34,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:34,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash 354281883, now seen corresponding path program 1 times [2025-03-04 09:44:34,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:34,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144903678] [2025-03-04 09:44:34,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:34,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:34,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:34,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:34,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:34,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:34,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:34,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144903678] [2025-03-04 09:44:34,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144903678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:34,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992202246] [2025-03-04 09:44:34,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:34,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:34,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:34,939 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:34,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 09:44:34,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:34,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:34,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:34,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:34,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:44:34,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:35,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:35,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-03-04 09:44:35,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992202246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:35,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:35,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-04 09:44:35,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855868564] [2025-03-04 09:44:35,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:35,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:44:35,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:35,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:44:35,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:44:35,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-03-04 09:44:35,165 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-03-04 09:44:35,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:35,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-03-04 09:44:35,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:36,228 INFO L124 PetriNetUnfolderBase]: 8634/14656 cut-off events. [2025-03-04 09:44:36,228 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-03-04 09:44:36,241 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 106964 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-03-04 09:44:36,281 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 43 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2025-03-04 09:44:36,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 72 transitions, 283 flow [2025-03-04 09:44:36,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:44:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:44:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2025-03-04 09:44:36,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-03-04 09:44:36,282 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 155 flow. Second operand 6 states and 216 transitions. [2025-03-04 09:44:36,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 72 transitions, 283 flow [2025-03-04 09:44:36,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 72 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:36,284 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 205 flow [2025-03-04 09:44:36,284 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-03-04 09:44:36,284 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2025-03-04 09:44:36,284 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 205 flow [2025-03-04 09:44:36,284 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-03-04 09:44:36,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:36,284 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:36,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 09:44:36,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:36,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:36,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:36,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1011228841, now seen corresponding path program 1 times [2025-03-04 09:44:36,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:36,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496636795] [2025-03-04 09:44:36,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:36,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:36,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:36,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:36,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:36,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:36,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:36,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496636795] [2025-03-04 09:44:36,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496636795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:36,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46453944] [2025-03-04 09:44:36,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:36,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:36,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:36,532 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:36,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 09:44:36,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:36,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:36,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:36,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:36,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:44:36,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:36,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:36,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46453944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:36,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:36,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 09:44:36,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907139781] [2025-03-04 09:44:36,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:36,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 09:44:36,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:36,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 09:44:36,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:44:36,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 78 [2025-03-04 09:44:36,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 205 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-03-04 09:44:36,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:36,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 78 [2025-03-04 09:44:36,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:37,360 INFO L124 PetriNetUnfolderBase]: 8632/14658 cut-off events. [2025-03-04 09:44:37,360 INFO L125 PetriNetUnfolderBase]: For 416/416 co-relation queries the response was YES. [2025-03-04 09:44:37,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27005 conditions, 14658 events. 8632/14658 cut-off events. For 416/416 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 106965 event pairs, 7668 based on Foata normal form. 4/14434 useless extension candidates. Maximal degree in co-relation 26990. Up to 11965 conditions per place. [2025-03-04 09:44:37,433 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 42 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2025-03-04 09:44:37,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 73 transitions, 309 flow [2025-03-04 09:44:37,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:44:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:44:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 278 transitions. [2025-03-04 09:44:37,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44551282051282054 [2025-03-04 09:44:37,435 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 205 flow. Second operand 8 states and 278 transitions. [2025-03-04 09:44:37,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 73 transitions, 309 flow [2025-03-04 09:44:37,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 73 transitions, 301 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:37,438 INFO L231 Difference]: Finished difference. Result has 85 places, 68 transitions, 221 flow [2025-03-04 09:44:37,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=75, 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=221, PETRI_PLACES=85, PETRI_TRANSITIONS=68} [2025-03-04 09:44:37,438 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2025-03-04 09:44:37,439 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 68 transitions, 221 flow [2025-03-04 09:44:37,439 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-03-04 09:44:37,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:37,440 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-04 09:44:37,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 09:44:37,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 09:44:37,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:37,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:37,641 INFO L85 PathProgramCache]: Analyzing trace with hash 978536535, now seen corresponding path program 2 times [2025-03-04 09:44:37,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:37,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899994026] [2025-03-04 09:44:37,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:37,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:37,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 09:44:37,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:37,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:37,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:37,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:37,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899994026] [2025-03-04 09:44:37,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899994026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:37,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773717899] [2025-03-04 09:44:37,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:37,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:37,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:37,791 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:37,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 09:44:37,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 09:44:37,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:37,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:37,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:37,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 09:44:37,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:37,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:37,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773717899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:37,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 09:44:37,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-04 09:44:37,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096981904] [2025-03-04 09:44:37,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:37,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:44:37,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:37,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:44:37,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:44:38,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-03-04 09:44:38,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 68 transitions, 221 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-03-04 09:44:38,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:38,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-03-04 09:44:38,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:38,950 INFO L124 PetriNetUnfolderBase]: 8632/14656 cut-off events. [2025-03-04 09:44:38,950 INFO L125 PetriNetUnfolderBase]: For 425/425 co-relation queries the response was YES. [2025-03-04 09:44:38,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27014 conditions, 14656 events. 8632/14656 cut-off events. For 425/425 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 107001 event pairs, 7668 based on Foata normal form. 2/14430 useless extension candidates. Maximal degree in co-relation 26995. Up to 11964 conditions per place. [2025-03-04 09:44:39,027 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 39 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2025-03-04 09:44:39,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 71 transitions, 325 flow [2025-03-04 09:44:39,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:44:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:44:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 264 transitions. [2025-03-04 09:44:39,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2025-03-04 09:44:39,032 INFO L175 Difference]: Start difference. First operand has 85 places, 68 transitions, 221 flow. Second operand 8 states and 264 transitions. [2025-03-04 09:44:39,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 71 transitions, 325 flow [2025-03-04 09:44:39,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 71 transitions, 299 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-04 09:44:39,034 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 217 flow [2025-03-04 09:44:39,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=76, 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=217, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2025-03-04 09:44:39,035 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 9 predicate places. [2025-03-04 09:44:39,035 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 217 flow [2025-03-04 09:44:39,036 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-03-04 09:44:39,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:39,036 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:39,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 09:44:39,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 09:44:39,236 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:39,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash 399407353, now seen corresponding path program 2 times [2025-03-04 09:44:39,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:39,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941160051] [2025-03-04 09:44:39,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:39,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:39,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 09:44:39,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-04 09:44:39,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:44:39,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 09:44:39,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:39,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941160051] [2025-03-04 09:44:39,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941160051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:39,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:39,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:39,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557025848] [2025-03-04 09:44:39,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:39,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:39,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:39,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:39,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:39,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-03-04 09:44:39,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 217 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-03-04 09:44:39,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:39,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-03-04 09:44:39,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:41,217 INFO L124 PetriNetUnfolderBase]: 16399/27295 cut-off events. [2025-03-04 09:44:41,217 INFO L125 PetriNetUnfolderBase]: For 666/666 co-relation queries the response was YES. [2025-03-04 09:44:41,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50718 conditions, 27295 events. 16399/27295 cut-off events. For 666/666 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 207841 event pairs, 5643 based on Foata normal form. 333/27052 useless extension candidates. Maximal degree in co-relation 50701. Up to 9568 conditions per place. [2025-03-04 09:44:41,355 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 98 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2025-03-04 09:44:41,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 124 transitions, 555 flow [2025-03-04 09:44:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:44:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:44:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2025-03-04 09:44:41,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5974358974358974 [2025-03-04 09:44:41,357 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 217 flow. Second operand 5 states and 233 transitions. [2025-03-04 09:44:41,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 124 transitions, 555 flow [2025-03-04 09:44:41,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 124 transitions, 541 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-04 09:44:41,359 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 230 flow [2025-03-04 09:44:41,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=203, 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=230, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2025-03-04 09:44:41,360 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 9 predicate places. [2025-03-04 09:44:41,360 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 230 flow [2025-03-04 09:44:41,360 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-03-04 09:44:41,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:41,360 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:41,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:44:41,360 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:41,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:41,360 INFO L85 PathProgramCache]: Analyzing trace with hash 160051965, now seen corresponding path program 1 times [2025-03-04 09:44:41,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:41,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324520816] [2025-03-04 09:44:41,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:41,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:41,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:44:41,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:44:41,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:41,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 09:44:41,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:41,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324520816] [2025-03-04 09:44:41,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324520816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:41,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:41,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:41,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323020215] [2025-03-04 09:44:41,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:41,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:41,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:41,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:41,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:41,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-03-04 09:44:41,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 230 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-03-04 09:44:41,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:41,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-03-04 09:44:41,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:44,503 INFO L124 PetriNetUnfolderBase]: 29468/48957 cut-off events. [2025-03-04 09:44:44,504 INFO L125 PetriNetUnfolderBase]: For 8328/8811 co-relation queries the response was YES. [2025-03-04 09:44:44,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96682 conditions, 48957 events. 29468/48957 cut-off events. For 8328/8811 co-relation queries the response was YES. Maximal size of possible extension queue 1105. Compared 397775 event pairs, 7462 based on Foata normal form. 594/48644 useless extension candidates. Maximal degree in co-relation 96664. Up to 17136 conditions per place. [2025-03-04 09:44:44,863 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 102 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2025-03-04 09:44:44,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 128 transitions, 606 flow [2025-03-04 09:44:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:44:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:44:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2025-03-04 09:44:44,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5923076923076923 [2025-03-04 09:44:44,864 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 230 flow. Second operand 5 states and 231 transitions. [2025-03-04 09:44:44,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 128 transitions, 606 flow [2025-03-04 09:44:44,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 128 transitions, 605 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:44,873 INFO L231 Difference]: Finished difference. Result has 89 places, 72 transitions, 256 flow [2025-03-04 09:44:44,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=229, 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=256, PETRI_PLACES=89, PETRI_TRANSITIONS=72} [2025-03-04 09:44:44,874 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 14 predicate places. [2025-03-04 09:44:44,874 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 72 transitions, 256 flow [2025-03-04 09:44:44,874 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-03-04 09:44:44,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:44,874 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:44,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:44:44,874 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-04 09:44:44,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:44,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1451874573, now seen corresponding path program 1 times [2025-03-04 09:44:44,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:44,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523627420] [2025-03-04 09:44:44,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:44,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:44,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:44:44,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:44:44,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:44,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:44,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:44,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:44:44,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:44:44,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:44,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:44,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:44,900 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:44,900 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-04 09:44:44,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2025-03-04 09:44:44,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-03-04 09:44:44,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (12 of 16 remaining) [2025-03-04 09:44:44,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-03-04 09:44:44,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-03-04 09:44:44,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 16 remaining) [2025-03-04 09:44:44,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-03-04 09:44:44,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-03-04 09:44:44,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2025-03-04 09:44:44,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-03-04 09:44:44,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-03-04 09:44:44,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 16 remaining) [2025-03-04 09:44:44,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-03-04 09:44:44,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-03-04 09:44:44,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2025-03-04 09:44:44,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 09:44:44,902 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-04 09:44:44,902 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:44:44,902 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 09:44:44,926 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:44,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 100 transitions, 228 flow [2025-03-04 09:44:44,935 INFO L124 PetriNetUnfolderBase]: 13/119 cut-off events. [2025-03-04 09:44:44,935 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 09:44:44,935 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-03-04 09:44:44,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 100 transitions, 228 flow [2025-03-04 09:44:44,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 100 transitions, 228 flow [2025-03-04 09:44:44,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:44,938 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;@2ccff166, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:44,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-04 09:44:44,939 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:44,939 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 09:44:44,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:44,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:44,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:44,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-03-04 09:44:44,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash 467946, now seen corresponding path program 1 times [2025-03-04 09:44:44,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:44,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973793365] [2025-03-04 09:44:44,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:44,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:44,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:44,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:44,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:44,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:44,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:44,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973793365] [2025-03-04 09:44:44,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973793365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:44,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:44,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:44,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868463879] [2025-03-04 09:44:44,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:44,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:44,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:44,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:44,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:44,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 100 [2025-03-04 09:44:44,976 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-03-04 09:44:44,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:44,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 100 [2025-03-04 09:44:44,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:54,671 INFO L124 PetriNetUnfolderBase]: 119632/179858 cut-off events. [2025-03-04 09:44:54,672 INFO L125 PetriNetUnfolderBase]: For 11956/11956 co-relation queries the response was YES. [2025-03-04 09:44:54,955 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 1519469 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-03-04 09:44:55,577 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 49 selfloop transitions, 1 changer transitions 0/80 dead transitions. [2025-03-04 09:44:55,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 80 transitions, 288 flow [2025-03-04 09:44:55,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-03-04 09:44:55,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5233333333333333 [2025-03-04 09:44:55,578 INFO L175 Difference]: Start difference. First operand has 96 places, 100 transitions, 228 flow. Second operand 3 states and 157 transitions. [2025-03-04 09:44:55,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 80 transitions, 288 flow [2025-03-04 09:44:55,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 80 transitions, 282 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:55,582 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 184 flow [2025-03-04 09:44:55,582 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-03-04 09:44:55,583 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -10 predicate places. [2025-03-04 09:44:55,583 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 184 flow [2025-03-04 09:44:55,583 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-03-04 09:44:55,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:55,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:55,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 09:44:55,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-03-04 09:44:55,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:55,583 INFO L85 PathProgramCache]: Analyzing trace with hash 467947, now seen corresponding path program 1 times [2025-03-04 09:44:55,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:55,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523498197] [2025-03-04 09:44:55,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:55,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:55,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:55,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:55,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:55,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:55,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:55,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523498197] [2025-03-04 09:44:55,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523498197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:55,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:55,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:55,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024324530] [2025-03-04 09:44:55,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:55,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:55,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:55,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:55,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 100 [2025-03-04 09:44:55,621 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-03-04 09:44:55,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:55,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 100 [2025-03-04 09:44:55,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand