./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-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-?-e2fb8be-m [2025-03-09 00:57:03,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:57:03,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:57:03,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:57:03,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:57:03,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:57:03,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:57:03,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:57:03,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:57:03,326 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:57:03,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:57:03,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:57:03,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:57:03,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:57:03,328 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:57:03,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:57:03,328 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:57:03,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:57:03,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:57:03,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:57:03,329 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:57:03,329 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:57:03,329 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:57:03,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:57:03,329 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:57:03,329 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:57:03,329 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:57:03,329 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:57:03,329 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:57:03,329 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:57:03,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:57:03,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:57:03,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:57:03,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:57:03,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:57:03,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:57:03,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:57:03,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:57:03,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:57:03,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:57:03,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:57:03,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:57:03,331 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-09 00:57:03,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:57:03,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:57:03,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:57:03,573 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:57:03,573 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:57:03,574 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-09 00:57:04,745 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6c7c82dd/dd7f73d73b4e4b8191c9daadb71302a5/FLAG535120898 [2025-03-09 00:57:05,049 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:57:05,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-09 00:57:05,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6c7c82dd/dd7f73d73b4e4b8191c9daadb71302a5/FLAG535120898 [2025-03-09 00:57:05,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6c7c82dd/dd7f73d73b4e4b8191c9daadb71302a5 [2025-03-09 00:57:05,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:57:05,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:57:05,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:57:05,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:57:05,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:57:05,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:57:05" (1/1) ... [2025-03-09 00:57:05,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba7706c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:05, skipping insertion in model container [2025-03-09 00:57:05,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:57:05" (1/1) ... [2025-03-09 00:57:05,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:57:05,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:57:05,371 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:57:05,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:57:05,422 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:57:05,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:05 WrapperNode [2025-03-09 00:57:05,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:57:05,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:57:05,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:57:05,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:57:05,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:05" (1/1) ... [2025-03-09 00:57:05,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:05" (1/1) ... [2025-03-09 00:57:05,449 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2025-03-09 00:57:05,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:57:05,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:57:05,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:57:05,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:57:05,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:05" (1/1) ... [2025-03-09 00:57:05,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:05" (1/1) ... [2025-03-09 00:57:05,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:05" (1/1) ... [2025-03-09 00:57:05,475 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-09 00:57:05,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:05" (1/1) ... [2025-03-09 00:57:05,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:05" (1/1) ... [2025-03-09 00:57:05,480 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:05" (1/1) ... [2025-03-09 00:57:05,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:05" (1/1) ... [2025-03-09 00:57:05,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:05" (1/1) ... [2025-03-09 00:57:05,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:05" (1/1) ... [2025-03-09 00:57:05,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:57:05,491 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:57:05,492 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:57:05,493 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:57:05,494 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:05" (1/1) ... [2025-03-09 00:57:05,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:57:05,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:05,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:57:05,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:57:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:57:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:57:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 00:57:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-09 00:57:05,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-09 00:57:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:57:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:57:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 00:57:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 00:57:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:57:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:57:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:57:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:57:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 00:57:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:57:05,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:57:05,547 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:57:05,639 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:57:05,640 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:57:05,798 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:57:05,798 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:57:05,901 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:57:05,901 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:57:05,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:57:05 BoogieIcfgContainer [2025-03-09 00:57:05,902 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:57:05,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:57:05,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:57:05,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:57:05,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:57:05" (1/3) ... [2025-03-09 00:57:05,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e609d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:57:05, skipping insertion in model container [2025-03-09 00:57:05,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:57:05" (2/3) ... [2025-03-09 00:57:05,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e609d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:57:05, skipping insertion in model container [2025-03-09 00:57:05,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:57:05" (3/3) ... [2025-03-09 00:57:05,911 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-03-09 00:57:05,922 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:57:05,923 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-09 00:57:05,924 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:57:05,963 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:57:05,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 34 transitions, 72 flow [2025-03-09 00:57:06,007 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-03-09 00:57:06,011 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:06,014 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-09 00:57:06,014 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 34 transitions, 72 flow [2025-03-09 00:57:06,017 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 34 transitions, 72 flow [2025-03-09 00:57:06,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:57:06,034 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;@f729722, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:57:06,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-09 00:57:06,038 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:57:06,039 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 00:57:06,039 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:06,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:06,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:06,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-09 00:57:06,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash 235584, now seen corresponding path program 1 times [2025-03-09 00:57:06,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:06,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119023267] [2025-03-09 00:57:06,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:06,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:06,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:06,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:06,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:57:06,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:06,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119023267] [2025-03-09 00:57:06,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119023267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:06,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:06,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:57:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734357454] [2025-03-09 00:57:06,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:06,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:57:06,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:06,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:57:06,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:57:06,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 00:57:06,327 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-09 00:57:06,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:06,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 00:57:06,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:06,389 INFO L124 PetriNetUnfolderBase]: 22/79 cut-off events. [2025-03-09 00:57:06,390 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:06,390 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-09 00:57:06,393 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 16 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-03-09 00:57:06,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 90 flow [2025-03-09 00:57:06,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:57:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:57:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-03-09 00:57:06,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2025-03-09 00:57:06,408 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 72 flow. Second operand 3 states and 52 transitions. [2025-03-09 00:57:06,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 90 flow [2025-03-09 00:57:06,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 90 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:06,415 INFO L231 Difference]: Finished difference. Result has 29 places, 26 transitions, 58 flow [2025-03-09 00:57:06,416 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-09 00:57:06,420 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -4 predicate places. [2025-03-09 00:57:06,420 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 58 flow [2025-03-09 00:57:06,420 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-09 00:57:06,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:06,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:06,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:57:06,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-09 00:57:06,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:06,421 INFO L85 PathProgramCache]: Analyzing trace with hash 235585, now seen corresponding path program 1 times [2025-03-09 00:57:06,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:06,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145842649] [2025-03-09 00:57:06,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:06,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:06,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:06,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:06,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:06,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:57:06,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:06,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145842649] [2025-03-09 00:57:06,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145842649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:06,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:06,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:57:06,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517520122] [2025-03-09 00:57:06,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:06,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:57:06,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:06,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:57:06,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:57:06,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-03-09 00:57:06,581 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-09 00:57:06,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:06,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-03-09 00:57:06,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:06,651 INFO L124 PetriNetUnfolderBase]: 22/81 cut-off events. [2025-03-09 00:57:06,653 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:06,654 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-09 00:57:06,655 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 18 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2025-03-09 00:57:06,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 102 flow [2025-03-09 00:57:06,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:57:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:57:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-09 00:57:06,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5392156862745098 [2025-03-09 00:57:06,657 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 58 flow. Second operand 3 states and 55 transitions. [2025-03-09 00:57:06,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 102 flow [2025-03-09 00:57:06,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 101 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:57:06,659 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 71 flow [2025-03-09 00:57:06,660 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-09 00:57:06,661 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2025-03-09 00:57:06,661 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 71 flow [2025-03-09 00:57:06,661 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-09 00:57:06,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:06,661 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 00:57:06,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:57:06,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-09 00:57:06,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:06,663 INFO L85 PathProgramCache]: Analyzing trace with hash 226405013, now seen corresponding path program 1 times [2025-03-09 00:57:06,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:06,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856478288] [2025-03-09 00:57:06,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:06,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:06,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:57:06,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:57:06,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:06,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:06,778 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-09 00:57:06,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:06,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856478288] [2025-03-09 00:57:06,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856478288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:57:06,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273794913] [2025-03-09 00:57:06,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:06,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:06,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:06,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:06,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:57:06,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:57:06,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:57:06,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:06,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:06,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:57:06,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:06,905 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-09 00:57:06,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:57:06,961 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-09 00:57:06,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273794913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:57:06,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:57:06,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-09 00:57:06,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024945763] [2025-03-09 00:57:06,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:57:06,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:57:06,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:06,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:57:06,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:57:06,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-03-09 00:57:06,992 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-09 00:57:06,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:06,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-03-09 00:57:06,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:07,110 INFO L124 PetriNetUnfolderBase]: 24/89 cut-off events. [2025-03-09 00:57:07,110 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:07,110 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-09 00:57:07,111 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 21 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2025-03-09 00:57:07,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 155 flow [2025-03-09 00:57:07,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:57:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:57:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-03-09 00:57:07,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-03-09 00:57:07,112 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 71 flow. Second operand 6 states and 98 transitions. [2025-03-09 00:57:07,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 155 flow [2025-03-09 00:57:07,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:57:07,113 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 121 flow [2025-03-09 00:57:07,113 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-09 00:57:07,114 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2025-03-09 00:57:07,114 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 121 flow [2025-03-09 00:57:07,114 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-09 00:57:07,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:07,114 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-09 00:57:07,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:57:07,314 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-09 00:57:07,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-09 00:57:07,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:07,315 INFO L85 PathProgramCache]: Analyzing trace with hash -743357551, now seen corresponding path program 2 times [2025-03-09 00:57:07,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:07,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395695518] [2025-03-09 00:57:07,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:57:07,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:07,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 00:57:07,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:57:07,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:57:07,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:07,605 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-09 00:57:07,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:07,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395695518] [2025-03-09 00:57:07,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395695518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:57:07,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520943906] [2025-03-09 00:57:07,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:57:07,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:07,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:07,609 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:07,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:57:07,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 00:57:07,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:57:07,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:57:07,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:07,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 00:57:07,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:07,816 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-09 00:57:07,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:57:07,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520943906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:07,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 00:57:07,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-09 00:57:07,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536229279] [2025-03-09 00:57:07,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:07,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:57:07,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:07,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:57:07,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:57:07,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-03-09 00:57:07,844 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-09 00:57:07,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:07,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-03-09 00:57:07,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:07,914 INFO L124 PetriNetUnfolderBase]: 24/88 cut-off events. [2025-03-09 00:57:07,914 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-09 00:57:07,915 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-09 00:57:07,915 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 17 selfloop transitions, 10 changer transitions 0/35 dead transitions. [2025-03-09 00:57:07,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 173 flow [2025-03-09 00:57:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:57:07,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 00:57:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2025-03-09 00:57:07,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2025-03-09 00:57:07,917 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 121 flow. Second operand 8 states and 116 transitions. [2025-03-09 00:57:07,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 173 flow [2025-03-09 00:57:07,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 147 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-09 00:57:07,919 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 113 flow [2025-03-09 00:57:07,919 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-09 00:57:07,920 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-03-09 00:57:07,920 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 113 flow [2025-03-09 00:57:07,921 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-09 00:57:07,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:07,921 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 00:57:07,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:57:08,125 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-09 00:57:08,125 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-09 00:57:08,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:08,125 INFO L85 PathProgramCache]: Analyzing trace with hash -711967714, now seen corresponding path program 1 times [2025-03-09 00:57:08,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:08,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407292550] [2025-03-09 00:57:08,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:08,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:08,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:57:08,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:57:08,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:08,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:08,181 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-09 00:57:08,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:08,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407292550] [2025-03-09 00:57:08,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407292550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:57:08,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457934272] [2025-03-09 00:57:08,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:08,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:08,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:08,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:08,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:57:08,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:57:08,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:57:08,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:08,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:08,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:57:08,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:08,244 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-09 00:57:08,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:57:08,266 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-09 00:57:08,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457934272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:57:08,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:57:08,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-09 00:57:08,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047887956] [2025-03-09 00:57:08,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:57:08,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 00:57:08,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:08,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 00:57:08,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:57:08,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-03-09 00:57:08,275 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-09 00:57:08,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:08,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-03-09 00:57:08,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:08,329 INFO L124 PetriNetUnfolderBase]: 22/89 cut-off events. [2025-03-09 00:57:08,330 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 00:57:08,330 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-09 00:57:08,330 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 20 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2025-03-09 00:57:08,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 186 flow [2025-03-09 00:57:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:57:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 00:57:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2025-03-09 00:57:08,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-03-09 00:57:08,331 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 113 flow. Second operand 8 states and 128 transitions. [2025-03-09 00:57:08,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 186 flow [2025-03-09 00:57:08,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 168 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-09 00:57:08,333 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 125 flow [2025-03-09 00:57:08,333 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-09 00:57:08,333 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2025-03-09 00:57:08,333 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 125 flow [2025-03-09 00:57:08,333 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-09 00:57:08,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:08,333 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1] [2025-03-09 00:57:08,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 00:57:08,534 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-09 00:57:08,534 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-09 00:57:08,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1211787410, now seen corresponding path program 2 times [2025-03-09 00:57:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:08,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535387843] [2025-03-09 00:57:08,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:57:08,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:08,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 00:57:08,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 00:57:08,560 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:57:08,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:08,560 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:57:08,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 00:57:08,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 00:57:08,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:08,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:08,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:57:08,611 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:57:08,612 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-09 00:57:08,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2025-03-09 00:57:08,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2025-03-09 00:57:08,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2025-03-09 00:57:08,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2025-03-09 00:57:08,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2025-03-09 00:57:08,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2025-03-09 00:57:08,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2025-03-09 00:57:08,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2025-03-09 00:57:08,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2025-03-09 00:57:08,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:57:08,614 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-03-09 00:57:08,615 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:57:08,615 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 00:57:08,636 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:57:08,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 122 flow [2025-03-09 00:57:08,643 INFO L124 PetriNetUnfolderBase]: 7/65 cut-off events. [2025-03-09 00:57:08,644 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 00:57:08,644 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-09 00:57:08,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 56 transitions, 122 flow [2025-03-09 00:57:08,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 56 transitions, 122 flow [2025-03-09 00:57:08,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:57:08,648 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;@f729722, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:57:08,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-09 00:57:08,650 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:57:08,652 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 00:57:08,652 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:08,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:08,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:08,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-09 00:57:08,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:08,653 INFO L85 PathProgramCache]: Analyzing trace with hash 291192, now seen corresponding path program 1 times [2025-03-09 00:57:08,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:08,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195380060] [2025-03-09 00:57:08,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:08,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:08,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:08,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:08,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:08,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:57:08,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:08,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195380060] [2025-03-09 00:57:08,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195380060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:08,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:08,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:57:08,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976291745] [2025-03-09 00:57:08,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:08,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:57:08,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:08,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:57:08,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:57:08,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 56 [2025-03-09 00:57:08,693 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-09 00:57:08,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:08,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 56 [2025-03-09 00:57:08,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:08,817 INFO L124 PetriNetUnfolderBase]: 532/1122 cut-off events. [2025-03-09 00:57:08,817 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-09 00:57:08,820 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-09 00:57:08,824 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 27 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2025-03-09 00:57:08,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 154 flow [2025-03-09 00:57:08,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:57:08,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:57:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-09 00:57:08,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2025-03-09 00:57:08,827 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 122 flow. Second operand 3 states and 87 transitions. [2025-03-09 00:57:08,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 154 flow [2025-03-09 00:57:08,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:08,828 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 100 flow [2025-03-09 00:57:08,829 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-09 00:57:08,829 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2025-03-09 00:57:08,829 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 100 flow [2025-03-09 00:57:08,829 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-09 00:57:08,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:08,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:08,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:57:08,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-09 00:57:08,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:08,830 INFO L85 PathProgramCache]: Analyzing trace with hash 291193, now seen corresponding path program 1 times [2025-03-09 00:57:08,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:08,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417325775] [2025-03-09 00:57:08,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:08,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:08,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:08,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:08,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:08,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:57:08,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417325775] [2025-03-09 00:57:08,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417325775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:08,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:08,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:57:08,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454443277] [2025-03-09 00:57:08,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:08,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:57:08,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:08,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:57:08,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:57:08,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-09 00:57:08,885 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-09 00:57:08,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:08,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-09 00:57:08,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:09,033 INFO L124 PetriNetUnfolderBase]: 532/1124 cut-off events. [2025-03-09 00:57:09,034 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-09 00:57:09,035 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-09 00:57:09,039 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 29 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-03-09 00:57:09,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 166 flow [2025-03-09 00:57:09,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:57:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:57:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-09 00:57:09,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-03-09 00:57:09,040 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 100 flow. Second operand 3 states and 90 transitions. [2025-03-09 00:57:09,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 166 flow [2025-03-09 00:57:09,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:57:09,041 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 113 flow [2025-03-09 00:57:09,041 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-09 00:57:09,041 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2025-03-09 00:57:09,042 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 113 flow [2025-03-09 00:57:09,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:57:09,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:09,042 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 00:57:09,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:57:09,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-09 00:57:09,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:09,042 INFO L85 PathProgramCache]: Analyzing trace with hash 279846093, now seen corresponding path program 1 times [2025-03-09 00:57:09,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:09,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131114369] [2025-03-09 00:57:09,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:09,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:09,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:57:09,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:57:09,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:09,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:09,109 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-09 00:57:09,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:09,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131114369] [2025-03-09 00:57:09,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131114369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:57:09,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307481374] [2025-03-09 00:57:09,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:09,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:09,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:09,111 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:09,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:57:09,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:57:09,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:57:09,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:09,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:09,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:57:09,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:09,200 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-09 00:57:09,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:57:09,234 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-09 00:57:09,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307481374] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:57:09,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:57:09,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-09 00:57:09,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420835339] [2025-03-09 00:57:09,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:57:09,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:57:09,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:09,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:57:09,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:57:09,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-09 00:57:09,290 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-09 00:57:09,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:09,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-09 00:57:09,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:09,470 INFO L124 PetriNetUnfolderBase]: 534/1132 cut-off events. [2025-03-09 00:57:09,470 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-09 00:57:09,472 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-09 00:57:09,475 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 32 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2025-03-09 00:57:09,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 219 flow [2025-03-09 00:57:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:57:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:57:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2025-03-09 00:57:09,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2025-03-09 00:57:09,476 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 113 flow. Second operand 6 states and 157 transitions. [2025-03-09 00:57:09,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 219 flow [2025-03-09 00:57:09,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:57:09,477 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 163 flow [2025-03-09 00:57:09,477 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-09 00:57:09,478 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-03-09 00:57:09,478 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 163 flow [2025-03-09 00:57:09,478 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-09 00:57:09,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:09,478 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-09 00:57:09,485 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-09 00:57:09,679 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-09 00:57:09,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-09 00:57:09,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:09,679 INFO L85 PathProgramCache]: Analyzing trace with hash -216071991, now seen corresponding path program 2 times [2025-03-09 00:57:09,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:09,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032962766] [2025-03-09 00:57:09,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:57:09,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:09,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 00:57:09,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:57:09,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:57:09,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:09,823 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-09 00:57:09,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:09,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032962766] [2025-03-09 00:57:09,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032962766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:57:09,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470142105] [2025-03-09 00:57:09,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:57:09,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:09,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:09,825 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:09,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:57:09,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 00:57:09,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:57:09,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:57:09,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:09,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 00:57:09,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:10,021 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-09 00:57:10,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:57:10,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470142105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:10,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 00:57:10,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-09 00:57:10,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349934580] [2025-03-09 00:57:10,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:10,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:57:10,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:10,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:57:10,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:57:10,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-09 00:57:10,055 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-09 00:57:10,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:10,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-09 00:57:10,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:10,198 INFO L124 PetriNetUnfolderBase]: 534/1131 cut-off events. [2025-03-09 00:57:10,198 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-09 00:57:10,201 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-09 00:57:10,205 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 28 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2025-03-09 00:57:10,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 237 flow [2025-03-09 00:57:10,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:57:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 00:57:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2025-03-09 00:57:10,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4263392857142857 [2025-03-09 00:57:10,207 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 163 flow. Second operand 8 states and 191 transitions. [2025-03-09 00:57:10,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 237 flow [2025-03-09 00:57:10,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 211 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-09 00:57:10,210 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 155 flow [2025-03-09 00:57:10,210 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-09 00:57:10,211 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2025-03-09 00:57:10,213 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 155 flow [2025-03-09 00:57:10,213 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-09 00:57:10,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:10,213 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:10,220 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-09 00:57:10,414 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-09 00:57:10,414 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-09 00:57:10,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash -184005296, now seen corresponding path program 1 times [2025-03-09 00:57:10,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:10,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716539696] [2025-03-09 00:57:10,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:10,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:10,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:57:10,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:57:10,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:10,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:10,485 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-09 00:57:10,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:10,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716539696] [2025-03-09 00:57:10,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716539696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:57:10,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417465964] [2025-03-09 00:57:10,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:10,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:10,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:10,488 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:10,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:57:10,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:57:10,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:57:10,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:10,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:10,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:57:10,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:10,552 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-09 00:57:10,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:57:10,578 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-09 00:57:10,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417465964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:57:10,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:57:10,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-09 00:57:10,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707406160] [2025-03-09 00:57:10,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:57:10,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 00:57:10,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:10,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 00:57:10,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:57:10,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 56 [2025-03-09 00:57:10,593 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-09 00:57:10,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:10,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 56 [2025-03-09 00:57:10,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:10,721 INFO L124 PetriNetUnfolderBase]: 532/1132 cut-off events. [2025-03-09 00:57:10,721 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-09 00:57:10,723 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-09 00:57:10,726 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 31 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2025-03-09 00:57:10,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 54 transitions, 250 flow [2025-03-09 00:57:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:57:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 00:57:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2025-03-09 00:57:10,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-03-09 00:57:10,727 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 155 flow. Second operand 8 states and 203 transitions. [2025-03-09 00:57:10,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 54 transitions, 250 flow [2025-03-09 00:57:10,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 232 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-09 00:57:10,729 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 167 flow [2025-03-09 00:57:10,729 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-09 00:57:10,729 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-03-09 00:57:10,729 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 167 flow [2025-03-09 00:57:10,729 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-09 00:57:10,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:10,729 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:10,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 00:57:10,930 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-09 00:57:10,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-09 00:57:10,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:10,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1115255648, now seen corresponding path program 2 times [2025-03-09 00:57:10,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:10,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191342829] [2025-03-09 00:57:10,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:57:10,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:10,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 00:57:10,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-09 00:57:10,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:57:10,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:11,055 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-09 00:57:11,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:11,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191342829] [2025-03-09 00:57:11,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191342829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:11,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:11,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:57:11,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700445529] [2025-03-09 00:57:11,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:11,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:57:11,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:11,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:57:11,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:57:11,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-09 00:57:11,081 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-09 00:57:11,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:11,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-09 00:57:11,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:11,305 INFO L124 PetriNetUnfolderBase]: 1009/2081 cut-off events. [2025-03-09 00:57:11,306 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-03-09 00:57:11,308 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-09 00:57:11,314 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 65 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2025-03-09 00:57:11,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 385 flow [2025-03-09 00:57:11,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:57:11,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:57:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-03-09 00:57:11,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-09 00:57:11,315 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 167 flow. Second operand 5 states and 160 transitions. [2025-03-09 00:57:11,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 385 flow [2025-03-09 00:57:11,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 84 transitions, 377 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 00:57:11,317 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 186 flow [2025-03-09 00:57:11,317 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-09 00:57:11,317 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2025-03-09 00:57:11,317 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 186 flow [2025-03-09 00:57:11,319 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-09 00:57:11,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:11,319 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-03-09 00:57:11,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:57:11,319 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-09 00:57:11,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:11,319 INFO L85 PathProgramCache]: Analyzing trace with hash -239774194, now seen corresponding path program 1 times [2025-03-09 00:57:11,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:11,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577503422] [2025-03-09 00:57:11,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:11,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:11,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 00:57:11,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 00:57:11,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:11,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:11,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:57:11,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 00:57:11,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 00:57:11,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:11,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:11,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:57:11,350 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:57:11,351 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-09 00:57:11,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2025-03-09 00:57:11,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2025-03-09 00:57:11,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2025-03-09 00:57:11,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2025-03-09 00:57:11,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2025-03-09 00:57:11,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 13 remaining) [2025-03-09 00:57:11,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2025-03-09 00:57:11,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2025-03-09 00:57:11,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2025-03-09 00:57:11,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2025-03-09 00:57:11,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2025-03-09 00:57:11,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2025-03-09 00:57:11,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:57:11,352 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-09 00:57:11,353 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:57:11,353 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 00:57:11,374 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:57:11,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 78 transitions, 174 flow [2025-03-09 00:57:11,381 INFO L124 PetriNetUnfolderBase]: 10/92 cut-off events. [2025-03-09 00:57:11,382 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 00:57:11,382 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-09 00:57:11,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 78 transitions, 174 flow [2025-03-09 00:57:11,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 78 transitions, 174 flow [2025-03-09 00:57:11,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:57:11,383 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;@f729722, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:57:11,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-09 00:57:11,384 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:57:11,384 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 00:57:11,384 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:11,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:11,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:11,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-09 00:57:11,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash 368646, now seen corresponding path program 1 times [2025-03-09 00:57:11,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:11,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78794410] [2025-03-09 00:57:11,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:11,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:11,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:11,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:11,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:11,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:57:11,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:11,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78794410] [2025-03-09 00:57:11,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78794410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:11,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:11,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:57:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923507808] [2025-03-09 00:57:11,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:11,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:57:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:11,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:57:11,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:57:11,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 78 [2025-03-09 00:57:11,423 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-09 00:57:11,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:11,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 78 [2025-03-09 00:57:11,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:12,344 INFO L124 PetriNetUnfolderBase]: 8632/14646 cut-off events. [2025-03-09 00:57:12,345 INFO L125 PetriNetUnfolderBase]: For 688/688 co-relation queries the response was YES. [2025-03-09 00:57:12,361 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-09 00:57:12,412 INFO L140 encePairwiseOnDemand]: 66/78 looper letters, 38 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2025-03-09 00:57:12,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 220 flow [2025-03-09 00:57:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:57:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:57:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-03-09 00:57:12,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5213675213675214 [2025-03-09 00:57:12,414 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 174 flow. Second operand 3 states and 122 transitions. [2025-03-09 00:57:12,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 220 flow [2025-03-09 00:57:12,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 62 transitions, 218 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:12,415 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 142 flow [2025-03-09 00:57:12,415 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-09 00:57:12,416 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -8 predicate places. [2025-03-09 00:57:12,416 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 142 flow [2025-03-09 00:57:12,416 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-09 00:57:12,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:12,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:12,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:57:12,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-09 00:57:12,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:12,416 INFO L85 PathProgramCache]: Analyzing trace with hash 368647, now seen corresponding path program 1 times [2025-03-09 00:57:12,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:12,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963158272] [2025-03-09 00:57:12,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:12,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:12,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:12,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:12,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:12,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:57:12,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:12,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963158272] [2025-03-09 00:57:12,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963158272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:12,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:12,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:57:12,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167239274] [2025-03-09 00:57:12,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:12,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:57:12,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:12,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:57:12,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:57:12,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-03-09 00:57:12,456 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-09 00:57:12,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:12,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-03-09 00:57:12,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:13,278 INFO L124 PetriNetUnfolderBase]: 8632/14648 cut-off events. [2025-03-09 00:57:13,278 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-03-09 00:57:13,300 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-09 00:57:13,356 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 40 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-03-09 00:57:13,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 230 flow [2025-03-09 00:57:13,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:57:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:57:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2025-03-09 00:57:13,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5341880341880342 [2025-03-09 00:57:13,357 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 142 flow. Second operand 3 states and 125 transitions. [2025-03-09 00:57:13,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 230 flow [2025-03-09 00:57:13,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:57:13,359 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 155 flow [2025-03-09 00:57:13,360 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-09 00:57:13,360 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -6 predicate places. [2025-03-09 00:57:13,360 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 155 flow [2025-03-09 00:57:13,360 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-09 00:57:13,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:13,360 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 00:57:13,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:57:13,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-09 00:57:13,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:13,361 INFO L85 PathProgramCache]: Analyzing trace with hash 354281883, now seen corresponding path program 1 times [2025-03-09 00:57:13,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:13,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704610052] [2025-03-09 00:57:13,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:13,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:13,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:57:13,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:57:13,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:13,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:13,415 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-09 00:57:13,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:13,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704610052] [2025-03-09 00:57:13,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704610052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:57:13,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999798975] [2025-03-09 00:57:13,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:13,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:13,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:13,418 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:13,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:57:13,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:57:13,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:57:13,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:13,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:13,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:57:13,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:13,523 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-09 00:57:13,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:57:13,559 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-09 00:57:13,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999798975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:57:13,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:57:13,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-09 00:57:13,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65577051] [2025-03-09 00:57:13,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:57:13,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:57:13,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:13,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:57:13,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:57:13,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-03-09 00:57:13,612 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-09 00:57:13,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:13,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-03-09 00:57:13,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:14,427 INFO L124 PetriNetUnfolderBase]: 8634/14656 cut-off events. [2025-03-09 00:57:14,427 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-03-09 00:57:14,457 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-09 00:57:14,510 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 43 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2025-03-09 00:57:14,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 72 transitions, 283 flow [2025-03-09 00:57:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:57:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:57:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2025-03-09 00:57:14,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-03-09 00:57:14,512 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 155 flow. Second operand 6 states and 216 transitions. [2025-03-09 00:57:14,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 72 transitions, 283 flow [2025-03-09 00:57:14,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 72 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:57:14,513 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 205 flow [2025-03-09 00:57:14,513 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-09 00:57:14,514 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2025-03-09 00:57:14,514 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 205 flow [2025-03-09 00:57:14,514 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-09 00:57:14,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:14,514 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:14,520 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-09 00:57:14,714 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-09 00:57:14,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-09 00:57:14,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:14,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1011228841, now seen corresponding path program 1 times [2025-03-09 00:57:14,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:14,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83327381] [2025-03-09 00:57:14,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:14,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:14,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:57:14,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:57:14,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:14,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:14,750 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-09 00:57:14,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:14,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83327381] [2025-03-09 00:57:14,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83327381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:57:14,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208655506] [2025-03-09 00:57:14,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:14,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:14,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:14,753 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:14,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:57:14,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:57:14,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:57:14,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:14,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:14,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:57:14,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:14,819 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-09 00:57:14,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:57:14,845 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-09 00:57:14,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208655506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:57:14,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:57:14,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-09 00:57:14,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630750072] [2025-03-09 00:57:14,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:57:14,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 00:57:14,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:14,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 00:57:14,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:57:14,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 78 [2025-03-09 00:57:14,852 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-09 00:57:14,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:14,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 78 [2025-03-09 00:57:14,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:15,672 INFO L124 PetriNetUnfolderBase]: 8632/14658 cut-off events. [2025-03-09 00:57:15,672 INFO L125 PetriNetUnfolderBase]: For 416/416 co-relation queries the response was YES. [2025-03-09 00:57:15,695 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-09 00:57:15,737 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 42 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2025-03-09 00:57:15,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 73 transitions, 309 flow [2025-03-09 00:57:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:57:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 00:57:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 278 transitions. [2025-03-09 00:57:15,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44551282051282054 [2025-03-09 00:57:15,739 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 205 flow. Second operand 8 states and 278 transitions. [2025-03-09 00:57:15,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 73 transitions, 309 flow [2025-03-09 00:57:15,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 73 transitions, 301 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-09 00:57:15,742 INFO L231 Difference]: Finished difference. Result has 85 places, 68 transitions, 221 flow [2025-03-09 00:57:15,742 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-09 00:57:15,743 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2025-03-09 00:57:15,743 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 68 transitions, 221 flow [2025-03-09 00:57:15,743 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-09 00:57:15,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:15,743 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-09 00:57:15,751 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-09 00:57:15,943 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-09 00:57:15,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-09 00:57:15,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:15,944 INFO L85 PathProgramCache]: Analyzing trace with hash 978536535, now seen corresponding path program 2 times [2025-03-09 00:57:15,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:15,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472292089] [2025-03-09 00:57:15,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:57:15,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:15,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 00:57:15,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:57:15,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:57:15,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:16,071 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-09 00:57:16,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:16,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472292089] [2025-03-09 00:57:16,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472292089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:57:16,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932029002] [2025-03-09 00:57:16,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:57:16,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:16,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:16,073 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:16,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 00:57:16,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 00:57:16,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:57:16,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:57:16,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:16,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 00:57:16,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:16,253 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-09 00:57:16,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:57:16,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932029002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:16,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 00:57:16,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-09 00:57:16,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066207746] [2025-03-09 00:57:16,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:16,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:57:16,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:16,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:57:16,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:57:16,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-03-09 00:57:16,306 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-09 00:57:16,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:16,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-03-09 00:57:16,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:17,326 INFO L124 PetriNetUnfolderBase]: 8632/14656 cut-off events. [2025-03-09 00:57:17,326 INFO L125 PetriNetUnfolderBase]: For 425/425 co-relation queries the response was YES. [2025-03-09 00:57:17,390 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-09 00:57:17,443 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 39 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2025-03-09 00:57:17,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 71 transitions, 325 flow [2025-03-09 00:57:17,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:57:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 00:57:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 264 transitions. [2025-03-09 00:57:17,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2025-03-09 00:57:17,448 INFO L175 Difference]: Start difference. First operand has 85 places, 68 transitions, 221 flow. Second operand 8 states and 264 transitions. [2025-03-09 00:57:17,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 71 transitions, 325 flow [2025-03-09 00:57:17,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 71 transitions, 299 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-09 00:57:17,450 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 217 flow [2025-03-09 00:57:17,450 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-09 00:57:17,450 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 9 predicate places. [2025-03-09 00:57:17,450 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 217 flow [2025-03-09 00:57:17,451 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-09 00:57:17,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:17,451 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:17,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 00:57:17,651 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-09 00:57:17,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-09 00:57:17,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:17,652 INFO L85 PathProgramCache]: Analyzing trace with hash 399407353, now seen corresponding path program 2 times [2025-03-09 00:57:17,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:17,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583714935] [2025-03-09 00:57:17,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:57:17,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:17,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 00:57:17,663 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-09 00:57:17,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:57:17,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:17,749 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-09 00:57:17,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:17,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583714935] [2025-03-09 00:57:17,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583714935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:17,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:17,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:57:17,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663057042] [2025-03-09 00:57:17,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:17,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:57:17,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:17,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:57:17,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:57:17,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-03-09 00:57:17,782 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-09 00:57:17,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:17,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-03-09 00:57:17,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:19,174 INFO L124 PetriNetUnfolderBase]: 16399/27295 cut-off events. [2025-03-09 00:57:19,174 INFO L125 PetriNetUnfolderBase]: For 666/666 co-relation queries the response was YES. [2025-03-09 00:57:19,287 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-09 00:57:19,379 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 98 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2025-03-09 00:57:19,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 124 transitions, 555 flow [2025-03-09 00:57:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:57:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:57:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2025-03-09 00:57:19,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5974358974358974 [2025-03-09 00:57:19,380 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 217 flow. Second operand 5 states and 233 transitions. [2025-03-09 00:57:19,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 124 transitions, 555 flow [2025-03-09 00:57:19,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 124 transitions, 541 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-09 00:57:19,382 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 230 flow [2025-03-09 00:57:19,382 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-09 00:57:19,382 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 9 predicate places. [2025-03-09 00:57:19,382 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 230 flow [2025-03-09 00:57:19,383 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-09 00:57:19,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:19,383 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:19,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 00:57:19,383 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-09 00:57:19,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:19,383 INFO L85 PathProgramCache]: Analyzing trace with hash 160051965, now seen corresponding path program 1 times [2025-03-09 00:57:19,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:19,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118995245] [2025-03-09 00:57:19,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:19,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 00:57:19,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 00:57:19,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:19,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:19,498 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-09 00:57:19,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:19,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118995245] [2025-03-09 00:57:19,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118995245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:19,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:19,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:57:19,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286551785] [2025-03-09 00:57:19,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:19,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:57:19,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:19,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:57:19,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:57:19,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 78 [2025-03-09 00:57:19,542 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-09 00:57:19,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:19,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 78 [2025-03-09 00:57:19,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:22,168 INFO L124 PetriNetUnfolderBase]: 29468/48957 cut-off events. [2025-03-09 00:57:22,168 INFO L125 PetriNetUnfolderBase]: For 8328/8811 co-relation queries the response was YES. [2025-03-09 00:57:22,309 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-09 00:57:22,476 INFO L140 encePairwiseOnDemand]: 72/78 looper letters, 102 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2025-03-09 00:57:22,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 128 transitions, 606 flow [2025-03-09 00:57:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:57:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:57:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2025-03-09 00:57:22,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5923076923076923 [2025-03-09 00:57:22,478 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 230 flow. Second operand 5 states and 231 transitions. [2025-03-09 00:57:22,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 128 transitions, 606 flow [2025-03-09 00:57:22,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 128 transitions, 605 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:57:22,485 INFO L231 Difference]: Finished difference. Result has 89 places, 72 transitions, 256 flow [2025-03-09 00:57:22,485 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-09 00:57:22,486 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 14 predicate places. [2025-03-09 00:57:22,486 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 72 transitions, 256 flow [2025-03-09 00:57:22,486 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-09 00:57:22,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:22,486 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:22,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 00:57:22,487 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-09 00:57:22,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:22,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1451874573, now seen corresponding path program 1 times [2025-03-09 00:57:22,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:22,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773717899] [2025-03-09 00:57:22,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:22,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:22,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 00:57:22,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 00:57:22,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:22,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:22,501 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:57:22,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 00:57:22,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 00:57:22,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:22,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:22,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:57:22,514 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:57:22,514 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-09 00:57:22,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2025-03-09 00:57:22,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-03-09 00:57:22,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (12 of 16 remaining) [2025-03-09 00:57:22,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-03-09 00:57:22,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-03-09 00:57:22,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 16 remaining) [2025-03-09 00:57:22,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-03-09 00:57:22,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-03-09 00:57:22,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2025-03-09 00:57:22,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-03-09 00:57:22,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-03-09 00:57:22,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 16 remaining) [2025-03-09 00:57:22,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-03-09 00:57:22,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-03-09 00:57:22,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2025-03-09 00:57:22,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 00:57:22,515 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-09 00:57:22,516 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:57:22,516 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-09 00:57:22,540 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:57:22,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 100 transitions, 228 flow [2025-03-09 00:57:22,550 INFO L124 PetriNetUnfolderBase]: 13/119 cut-off events. [2025-03-09 00:57:22,550 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 00:57:22,551 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-09 00:57:22,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 100 transitions, 228 flow [2025-03-09 00:57:22,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 100 transitions, 228 flow [2025-03-09 00:57:22,555 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:57:22,555 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;@f729722, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:57:22,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-09 00:57:22,556 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:57:22,556 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 00:57:22,556 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:57:22,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:22,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:22,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-03-09 00:57:22,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:22,557 INFO L85 PathProgramCache]: Analyzing trace with hash 467946, now seen corresponding path program 1 times [2025-03-09 00:57:22,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:22,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096981904] [2025-03-09 00:57:22,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:22,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:22,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:22,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:22,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:22,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:57:22,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:22,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096981904] [2025-03-09 00:57:22,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096981904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:22,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:22,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:57:22,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481360309] [2025-03-09 00:57:22,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:22,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:57:22,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:22,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:57:22,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:57:22,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 100 [2025-03-09 00:57:22,595 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-09 00:57:22,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:22,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 100 [2025-03-09 00:57:22,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:31,975 INFO L124 PetriNetUnfolderBase]: 119632/179858 cut-off events. [2025-03-09 00:57:31,976 INFO L125 PetriNetUnfolderBase]: For 11956/11956 co-relation queries the response was YES. [2025-03-09 00:57:32,316 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-09 00:57:33,024 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 49 selfloop transitions, 1 changer transitions 0/80 dead transitions. [2025-03-09 00:57:33,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 80 transitions, 288 flow [2025-03-09 00:57:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:57:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:57:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-03-09 00:57:33,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5233333333333333 [2025-03-09 00:57:33,026 INFO L175 Difference]: Start difference. First operand has 96 places, 100 transitions, 228 flow. Second operand 3 states and 157 transitions. [2025-03-09 00:57:33,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 80 transitions, 288 flow [2025-03-09 00:57:33,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 80 transitions, 282 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-09 00:57:33,031 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 184 flow [2025-03-09 00:57:33,031 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-09 00:57:33,032 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -10 predicate places. [2025-03-09 00:57:33,032 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 184 flow [2025-03-09 00:57:33,032 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-09 00:57:33,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:33,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 00:57:33,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 00:57:33,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-03-09 00:57:33,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:33,033 INFO L85 PathProgramCache]: Analyzing trace with hash 467947, now seen corresponding path program 1 times [2025-03-09 00:57:33,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:33,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971461019] [2025-03-09 00:57:33,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:33,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:33,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:57:33,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:57:33,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:33,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:57:33,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:33,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971461019] [2025-03-09 00:57:33,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971461019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:57:33,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:57:33,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:57:33,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555160729] [2025-03-09 00:57:33,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:57:33,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:57:33,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:33,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:57:33,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:57:33,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 100 [2025-03-09 00:57:33,072 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-09 00:57:33,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:33,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 100 [2025-03-09 00:57:33,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:57:42,279 INFO L124 PetriNetUnfolderBase]: 119632/179860 cut-off events. [2025-03-09 00:57:42,280 INFO L125 PetriNetUnfolderBase]: For 4708/4708 co-relation queries the response was YES. [2025-03-09 00:57:42,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336169 conditions, 179860 events. 119632/179860 cut-off events. For 4708/4708 co-relation queries the response was YES. Maximal size of possible extension queue 4931. Compared 1519756 event pairs, 106668 based on Foata normal form. 0/177478 useless extension candidates. Maximal degree in co-relation 336159. Up to 152968 conditions per place. [2025-03-09 00:57:43,417 INFO L140 encePairwiseOnDemand]: 96/100 looper letters, 51 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2025-03-09 00:57:43,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 82 transitions, 294 flow [2025-03-09 00:57:43,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:57:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:57:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2025-03-09 00:57:43,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-09 00:57:43,419 INFO L175 Difference]: Start difference. First operand has 86 places, 80 transitions, 184 flow. Second operand 3 states and 160 transitions. [2025-03-09 00:57:43,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 82 transitions, 294 flow [2025-03-09 00:57:43,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 82 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:57:43,426 INFO L231 Difference]: Finished difference. Result has 88 places, 81 transitions, 197 flow [2025-03-09 00:57:43,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=88, PETRI_TRANSITIONS=81} [2025-03-09 00:57:43,426 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -8 predicate places. [2025-03-09 00:57:43,426 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 81 transitions, 197 flow [2025-03-09 00:57:43,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-09 00:57:43,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:57:43,426 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 00:57:43,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 00:57:43,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-03-09 00:57:43,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:57:43,427 INFO L85 PathProgramCache]: Analyzing trace with hash 449712383, now seen corresponding path program 1 times [2025-03-09 00:57:43,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:57:43,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180950138] [2025-03-09 00:57:43,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:43,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:57:43,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:57:43,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:57:43,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:43,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:43,474 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-09 00:57:43,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:57:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180950138] [2025-03-09 00:57:43,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180950138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:57:43,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681588126] [2025-03-09 00:57:43,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:57:43,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:43,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:57:43,477 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:57:43,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 00:57:43,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:57:43,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:57:43,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:43,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:57:43,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:57:43,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:57:43,572 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-09 00:57:43,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:57:43,600 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-09 00:57:43,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681588126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:57:43,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:57:43,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-09 00:57:43,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389797981] [2025-03-09 00:57:43,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:57:43,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:57:43,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:57:43,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:57:43,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:57:43,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 100 [2025-03-09 00:57:43,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 81 transitions, 197 flow. Second operand has 8 states, 8 states have (on average 36.875) internal successors, (295), 8 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:57:43,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:57:43,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 100 [2025-03-09 00:57:43,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand