./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/02_inc_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/02_inc_cas.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 ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:44:16,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:44:16,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:44:16,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:44:16,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:44:16,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:44:16,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:44:16,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:44:16,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:44:16,689 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:44:16,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:44:16,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:44:16,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:44:16,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:44:16,689 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:44:16,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:44:16,690 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:44:16,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:44:16,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:44:16,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:44:16,690 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:44:16,690 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:44:16,690 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:44:16,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:44:16,690 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:44:16,691 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:44:16,691 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:44:16,691 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:44:16,691 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:44:16,691 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:44:16,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:44:16,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:44:16,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:44:16,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:44:16,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:44:16,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:44:16,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:44:16,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:44:16,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:44:16,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:44:16,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:44:16,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:44:16,692 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 [2025-03-04 09:44:16,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:44:16,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:44:16,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:44:16,913 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:44:16,913 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:44:16,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/02_inc_cas.i [2025-03-04 09:44:18,024 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd2f97dae/1c67149e96d644a885494bc436ebcf6f/FLAG790b50504 [2025-03-04 09:44:18,325 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:44:18,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/02_inc_cas.i [2025-03-04 09:44:18,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd2f97dae/1c67149e96d644a885494bc436ebcf6f/FLAG790b50504 [2025-03-04 09:44:18,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd2f97dae/1c67149e96d644a885494bc436ebcf6f [2025-03-04 09:44:18,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:44:18,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:44:18,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:44:18,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:44:18,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:44:18,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28828d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18, skipping insertion in model container [2025-03-04 09:44:18,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:44:18,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:44:18,865 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:44:18,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:44:18,915 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:44:18,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18 WrapperNode [2025-03-04 09:44:18,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:44:18,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:44:18,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:44:18,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:44:18,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,940 INFO L138 Inliner]: procedures = 170, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2025-03-04 09:44:18,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:44:18,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:44:18,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:44:18,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:44:18,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,955 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 5, 3]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 3 writes are split as follows [0, 1, 2]. [2025-03-04 09:44:18,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,960 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:44:18,968 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:44:18,968 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:44:18,968 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:44:18,969 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:44:18,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:18,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:44:18,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:44:19,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:44:19,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:44:19,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:44:19,012 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 09:44:19,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 09:44:19,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:44:19,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:44:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:44:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:44:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:44:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:44:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:44:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:44:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:44:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:44:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:44:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:44:19,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:44:19,014 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:44:19,099 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:44:19,101 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:44:19,226 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: havoc ~#casret~0#1.base, ~#casret~0#1.offset; [2025-03-04 09:44:19,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: SUMMARY for call ULTIMATE.dealloc(~#casret~0#1.base, ~#casret~0#1.offset); srcloc: null [2025-03-04 09:44:19,258 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:44:19,258 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:44:19,387 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:44:19,387 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:44:19,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:19 BoogieIcfgContainer [2025-03-04 09:44:19,388 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:44:19,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:44:19,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:44:19,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:44:19,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:44:18" (1/3) ... [2025-03-04 09:44:19,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d6d710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:19, skipping insertion in model container [2025-03-04 09:44:19,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (2/3) ... [2025-03-04 09:44:19,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d6d710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:19, skipping insertion in model container [2025-03-04 09:44:19,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:19" (3/3) ... [2025-03-04 09:44:19,396 INFO L128 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2025-03-04 09:44:19,407 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:44:19,409 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02_inc_cas.i that has 2 procedures, 32 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-03-04 09:44:19,409 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:44:19,464 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:19,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 35 transitions, 74 flow [2025-03-04 09:44:19,531 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2025-03-04 09:44:19,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:19,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 39 events. 3/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 115 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-03-04 09:44:19,538 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 35 transitions, 74 flow [2025-03-04 09:44:19,540 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 35 transitions, 74 flow [2025-03-04 09:44:19,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:19,553 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;@27cfccfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:19,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-03-04 09:44:19,555 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:19,556 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:44:19,556 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:19,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:19,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:19,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-03-04 09:44:19,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash 228899, now seen corresponding path program 1 times [2025-03-04 09:44:19,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:19,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533435348] [2025-03-04 09:44:19,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:19,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:19,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:19,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:19,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:19,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:19,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:19,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533435348] [2025-03-04 09:44:19,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533435348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:19,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:19,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:19,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188005490] [2025-03-04 09:44:19,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:19,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:44:19,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:19,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:44:19,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:44:19,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-03-04 09:44:19,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 35 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:19,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:19,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-03-04 09:44:19,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:19,783 INFO L124 PetriNetUnfolderBase]: 42/115 cut-off events. [2025-03-04 09:44:19,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:19,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 115 events. 42/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 419 event pairs, 36 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 208. Up to 102 conditions per place. [2025-03-04 09:44:19,786 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 24 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2025-03-04 09:44:19,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 110 flow [2025-03-04 09:44:19,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:44:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:44:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 40 transitions. [2025-03-04 09:44:19,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 09:44:19,801 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 74 flow. Second operand 2 states and 40 transitions. [2025-03-04 09:44:19,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 110 flow [2025-03-04 09:44:19,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:19,807 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 62 flow [2025-03-04 09:44:19,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-03-04 09:44:19,811 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2025-03-04 09:44:19,811 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 62 flow [2025-03-04 09:44:19,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:19,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:19,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:44:19,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:44:19,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-03-04 09:44:19,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash 220038403, now seen corresponding path program 1 times [2025-03-04 09:44:19,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:19,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333744119] [2025-03-04 09:44:19,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:19,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:19,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:19,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:19,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:19,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:19,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:19,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333744119] [2025-03-04 09:44:19,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333744119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:19,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:19,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:19,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398721263] [2025-03-04 09:44:19,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:19,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:19,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:19,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:19,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:19,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-03-04 09:44:19,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:19,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:19,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-03-04 09:44:19,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:20,052 INFO L124 PetriNetUnfolderBase]: 36/100 cut-off events. [2025-03-04 09:44:20,053 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:20,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 100 events. 36/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 354 event pairs, 28 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 188. Up to 78 conditions per place. [2025-03-04 09:44:20,055 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 20 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-03-04 09:44:20,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 106 flow [2025-03-04 09:44:20,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-04 09:44:20,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2025-03-04 09:44:20,058 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 62 flow. Second operand 3 states and 44 transitions. [2025-03-04 09:44:20,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 28 transitions, 106 flow [2025-03-04 09:44:20,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:20,059 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 62 flow [2025-03-04 09:44:20,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2025-03-04 09:44:20,061 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-03-04 09:44:20,061 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 62 flow [2025-03-04 09:44:20,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:20,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:20,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:44:20,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:44:20,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-03-04 09:44:20,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:20,063 INFO L85 PathProgramCache]: Analyzing trace with hash 220038404, now seen corresponding path program 1 times [2025-03-04 09:44:20,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:20,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210374209] [2025-03-04 09:44:20,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:20,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:20,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:20,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:20,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:20,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:20,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:20,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210374209] [2025-03-04 09:44:20,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210374209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:20,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:20,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:20,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366487585] [2025-03-04 09:44:20,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:20,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:44:20,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:20,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:44:20,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:44:20,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-03-04 09:44:20,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:20,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:20,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-03-04 09:44:20,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:20,242 INFO L124 PetriNetUnfolderBase]: 30/85 cut-off events. [2025-03-04 09:44:20,243 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:20,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 85 events. 30/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 278 event pairs, 24 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 165. Up to 71 conditions per place. [2025-03-04 09:44:20,244 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 17 selfloop transitions, 1 changer transitions 0/23 dead transitions. [2025-03-04 09:44:20,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 92 flow [2025-03-04 09:44:20,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-03-04 09:44:20,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2025-03-04 09:44:20,249 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 62 flow. Second operand 3 states and 39 transitions. [2025-03-04 09:44:20,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 92 flow [2025-03-04 09:44:20,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:20,250 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 52 flow [2025-03-04 09:44:20,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2025-03-04 09:44:20,250 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -8 predicate places. [2025-03-04 09:44:20,250 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 52 flow [2025-03-04 09:44:20,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:20,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:20,251 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 09:44:20,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:44:20,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-03-04 09:44:20,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:20,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1768759233, now seen corresponding path program 1 times [2025-03-04 09:44:20,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:20,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726718616] [2025-03-04 09:44:20,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:20,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:20,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:44:20,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:44:20,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:20,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:20,257 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:20,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:44:20,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:44:20,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:20,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:20,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:20,270 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:20,271 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2025-03-04 09:44:20,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 32 remaining) [2025-03-04 09:44:20,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2025-03-04 09:44:20,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2025-03-04 09:44:20,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2025-03-04 09:44:20,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (26 of 32 remaining) [2025-03-04 09:44:20,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 32 remaining) [2025-03-04 09:44:20,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 32 remaining) [2025-03-04 09:44:20,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2025-03-04 09:44:20,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2025-03-04 09:44:20,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2025-03-04 09:44:20,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2025-03-04 09:44:20,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2025-03-04 09:44:20,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2025-03-04 09:44:20,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2025-03-04 09:44:20,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2025-03-04 09:44:20,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (15 of 32 remaining) [2025-03-04 09:44:20,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2025-03-04 09:44:20,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2025-03-04 09:44:20,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2025-03-04 09:44:20,274 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2025-03-04 09:44:20,274 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (10 of 32 remaining) [2025-03-04 09:44:20,274 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2025-03-04 09:44:20,274 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2025-03-04 09:44:20,274 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2025-03-04 09:44:20,274 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2025-03-04 09:44:20,274 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2025-03-04 09:44:20,274 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2025-03-04 09:44:20,274 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2025-03-04 09:44:20,274 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2025-03-04 09:44:20,274 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 32 remaining) [2025-03-04 09:44:20,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 32 remaining) [2025-03-04 09:44:20,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:44:20,275 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 09:44:20,278 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:44:20,278 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 09:44:20,331 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:20,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 63 transitions, 136 flow [2025-03-04 09:44:20,341 INFO L124 PetriNetUnfolderBase]: 6/72 cut-off events. [2025-03-04 09:44:20,341 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:44:20,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 72 events. 6/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 306 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 59. Up to 3 conditions per place. [2025-03-04 09:44:20,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 63 transitions, 136 flow [2025-03-04 09:44:20,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 63 transitions, 136 flow [2025-03-04 09:44:20,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:20,343 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;@27cfccfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:20,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-03-04 09:44:20,344 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:20,344 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:44:20,344 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:20,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:20,344 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:20,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 09:44:20,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:20,345 INFO L85 PathProgramCache]: Analyzing trace with hash 291458, now seen corresponding path program 1 times [2025-03-04 09:44:20,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:20,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875762269] [2025-03-04 09:44:20,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:20,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:20,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:20,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:20,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:20,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:20,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:20,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875762269] [2025-03-04 09:44:20,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875762269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:20,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:20,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:20,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563515533] [2025-03-04 09:44:20,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:20,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:44:20,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:20,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:44:20,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:44:20,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 63 [2025-03-04 09:44:20,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 136 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:20,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:20,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 63 [2025-03-04 09:44:20,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:20,692 INFO L124 PetriNetUnfolderBase]: 1980/3340 cut-off events. [2025-03-04 09:44:20,693 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-04 09:44:20,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6525 conditions, 3340 events. 1980/3340 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 19318 event pairs, 1746 based on Foata normal form. 0/1690 useless extension candidates. Maximal degree in co-relation 4917. Up to 3123 conditions per place. [2025-03-04 09:44:20,731 INFO L140 encePairwiseOnDemand]: 56/63 looper letters, 45 selfloop transitions, 0 changer transitions 0/54 dead transitions. [2025-03-04 09:44:20,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 208 flow [2025-03-04 09:44:20,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:44:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:44:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2025-03-04 09:44:20,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 09:44:20,733 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 136 flow. Second operand 2 states and 72 transitions. [2025-03-04 09:44:20,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 208 flow [2025-03-04 09:44:20,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:20,735 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 118 flow [2025-03-04 09:44:20,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2025-03-04 09:44:20,736 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-03-04 09:44:20,737 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 118 flow [2025-03-04 09:44:20,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:20,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:20,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:44:20,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:44:20,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 09:44:20,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:20,738 INFO L85 PathProgramCache]: Analyzing trace with hash 280186429, now seen corresponding path program 1 times [2025-03-04 09:44:20,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:20,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228319000] [2025-03-04 09:44:20,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:20,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:20,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:20,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:20,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:20,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:20,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:20,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228319000] [2025-03-04 09:44:20,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228319000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:20,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:20,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:20,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013872346] [2025-03-04 09:44:20,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:20,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:44:20,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:20,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:44:20,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:44:20,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 63 [2025-03-04 09:44:20,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:20,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:20,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 63 [2025-03-04 09:44:20,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:21,210 INFO L124 PetriNetUnfolderBase]: 1508/2681 cut-off events. [2025-03-04 09:44:21,210 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-04 09:44:21,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5164 conditions, 2681 events. 1508/2681 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 16209 event pairs, 1078 based on Foata normal form. 0/1496 useless extension candidates. Maximal degree in co-relation 5159. Up to 1893 conditions per place. [2025-03-04 09:44:21,227 INFO L140 encePairwiseOnDemand]: 36/63 looper letters, 91 selfloop transitions, 25 changer transitions 0/125 dead transitions. [2025-03-04 09:44:21,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 125 transitions, 497 flow [2025-03-04 09:44:21,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:44:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:44:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2025-03-04 09:44:21,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 09:44:21,230 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 118 flow. Second operand 4 states and 168 transitions. [2025-03-04 09:44:21,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 125 transitions, 497 flow [2025-03-04 09:44:21,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 125 transitions, 497 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:21,234 INFO L231 Difference]: Finished difference. Result has 62 places, 78 transitions, 330 flow [2025-03-04 09:44:21,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=62, PETRI_TRANSITIONS=78} [2025-03-04 09:44:21,235 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2025-03-04 09:44:21,235 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 330 flow [2025-03-04 09:44:21,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:21,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:21,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:44:21,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:44:21,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 09:44:21,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:21,236 INFO L85 PathProgramCache]: Analyzing trace with hash 280186430, now seen corresponding path program 1 times [2025-03-04 09:44:21,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:21,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359863315] [2025-03-04 09:44:21,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:21,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:21,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:21,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:21,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:21,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:21,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:21,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359863315] [2025-03-04 09:44:21,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359863315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:21,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:21,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:21,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688673814] [2025-03-04 09:44:21,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:21,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:44:21,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:21,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:44:21,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:44:21,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 63 [2025-03-04 09:44:21,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:21,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:21,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 63 [2025-03-04 09:44:21,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:21,558 INFO L124 PetriNetUnfolderBase]: 1034/1882 cut-off events. [2025-03-04 09:44:21,558 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2025-03-04 09:44:21,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4715 conditions, 1882 events. 1034/1882 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 10860 event pairs, 682 based on Foata normal form. 261/1522 useless extension candidates. Maximal degree in co-relation 4707. Up to 1227 conditions per place. [2025-03-04 09:44:21,566 INFO L140 encePairwiseOnDemand]: 52/63 looper letters, 85 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2025-03-04 09:44:21,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 99 transitions, 589 flow [2025-03-04 09:44:21,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:44:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:44:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2025-03-04 09:44:21,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2025-03-04 09:44:21,569 INFO L175 Difference]: Start difference. First operand has 62 places, 78 transitions, 330 flow. Second operand 4 states and 122 transitions. [2025-03-04 09:44:21,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 99 transitions, 589 flow [2025-03-04 09:44:21,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 99 transitions, 589 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:21,577 INFO L231 Difference]: Finished difference. Result has 59 places, 72 transitions, 328 flow [2025-03-04 09:44:21,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=328, PETRI_PLACES=59, PETRI_TRANSITIONS=72} [2025-03-04 09:44:21,578 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2025-03-04 09:44:21,578 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 72 transitions, 328 flow [2025-03-04 09:44:21,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:21,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:21,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:21,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:44:21,578 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 09:44:21,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:21,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1323769402, now seen corresponding path program 1 times [2025-03-04 09:44:21,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:21,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972665355] [2025-03-04 09:44:21,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:21,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:21,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 09:44:21,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 09:44:21,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:21,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:21,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:21,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972665355] [2025-03-04 09:44:21,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972665355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:21,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:21,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:21,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934317070] [2025-03-04 09:44:21,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:21,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:21,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:21,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:21,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:21,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 63 [2025-03-04 09:44:21,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 72 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:21,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:21,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 63 [2025-03-04 09:44:21,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:21,846 INFO L124 PetriNetUnfolderBase]: 1001/1758 cut-off events. [2025-03-04 09:44:21,846 INFO L125 PetriNetUnfolderBase]: For 456/456 co-relation queries the response was YES. [2025-03-04 09:44:21,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4635 conditions, 1758 events. 1001/1758 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9948 event pairs, 134 based on Foata normal form. 0/1305 useless extension candidates. Maximal degree in co-relation 4626. Up to 1152 conditions per place. [2025-03-04 09:44:21,856 INFO L140 encePairwiseOnDemand]: 53/63 looper letters, 86 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2025-03-04 09:44:21,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 103 transitions, 649 flow [2025-03-04 09:44:21,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-04 09:44:21,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-03-04 09:44:21,857 INFO L175 Difference]: Start difference. First operand has 59 places, 72 transitions, 328 flow. Second operand 3 states and 99 transitions. [2025-03-04 09:44:21,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 103 transitions, 649 flow [2025-03-04 09:44:21,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 103 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:21,862 INFO L231 Difference]: Finished difference. Result has 61 places, 78 transitions, 412 flow [2025-03-04 09:44:21,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=61, PETRI_TRANSITIONS=78} [2025-03-04 09:44:21,863 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2025-03-04 09:44:21,863 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 78 transitions, 412 flow [2025-03-04 09:44:21,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:21,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:21,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:21,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:44:21,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 09:44:21,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:21,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1323769401, now seen corresponding path program 1 times [2025-03-04 09:44:21,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:21,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681587702] [2025-03-04 09:44:21,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:21,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:21,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 09:44:21,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 09:44:21,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:21,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:21,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:21,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681587702] [2025-03-04 09:44:21,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681587702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:21,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:21,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:21,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238532053] [2025-03-04 09:44:21,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:21,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:21,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:21,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:21,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:21,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2025-03-04 09:44:21,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 78 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:21,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:21,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2025-03-04 09:44:21,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:22,092 INFO L124 PetriNetUnfolderBase]: 782/1393 cut-off events. [2025-03-04 09:44:22,093 INFO L125 PetriNetUnfolderBase]: For 845/845 co-relation queries the response was YES. [2025-03-04 09:44:22,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4159 conditions, 1393 events. 782/1393 cut-off events. For 845/845 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7512 event pairs, 96 based on Foata normal form. 90/1189 useless extension candidates. Maximal degree in co-relation 4149. Up to 950 conditions per place. [2025-03-04 09:44:22,100 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 70 selfloop transitions, 9 changer transitions 0/88 dead transitions. [2025-03-04 09:44:22,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 88 transitions, 599 flow [2025-03-04 09:44:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-04 09:44:22,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-04 09:44:22,101 INFO L175 Difference]: Start difference. First operand has 61 places, 78 transitions, 412 flow. Second operand 3 states and 84 transitions. [2025-03-04 09:44:22,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 88 transitions, 599 flow [2025-03-04 09:44:22,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 88 transitions, 579 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:22,109 INFO L231 Difference]: Finished difference. Result has 58 places, 73 transitions, 388 flow [2025-03-04 09:44:22,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=58, PETRI_TRANSITIONS=73} [2025-03-04 09:44:22,109 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2025-03-04 09:44:22,109 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 73 transitions, 388 flow [2025-03-04 09:44:22,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:22,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:22,109 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-04 09:44:22,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:44:22,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 09:44:22,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:22,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2089363175, now seen corresponding path program 1 times [2025-03-04 09:44:22,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:22,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267939166] [2025-03-04 09:44:22,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:22,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:44:22,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:44:22,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:22,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:22,115 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:22,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:44:22,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:44:22,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:22,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:22,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:22,120 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (41 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (30 of 47 remaining) [2025-03-04 09:44:22,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (25 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (10 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 47 remaining) [2025-03-04 09:44:22,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 47 remaining) [2025-03-04 09:44:22,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:44:22,125 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 09:44:22,125 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:44:22,126 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 09:44:22,169 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:22,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 91 transitions, 200 flow [2025-03-04 09:44:22,180 INFO L124 PetriNetUnfolderBase]: 9/105 cut-off events. [2025-03-04 09:44:22,180 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 09:44:22,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 105 events. 9/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 474 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2025-03-04 09:44:22,181 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 91 transitions, 200 flow [2025-03-04 09:44:22,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 91 transitions, 200 flow [2025-03-04 09:44:22,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:22,183 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;@27cfccfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:22,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-03-04 09:44:22,183 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:22,183 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:44:22,183 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:22,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:22,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:22,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-03-04 09:44:22,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:22,184 INFO L85 PathProgramCache]: Analyzing trace with hash 381821, now seen corresponding path program 1 times [2025-03-04 09:44:22,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:22,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522548857] [2025-03-04 09:44:22,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:22,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:22,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:22,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:22,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:22,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:22,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:22,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522548857] [2025-03-04 09:44:22,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522548857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:22,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:22,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:22,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968782992] [2025-03-04 09:44:22,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:22,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:44:22,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:22,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:44:22,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:44:22,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 91 [2025-03-04 09:44:22,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 91 transitions, 200 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:22,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:22,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 91 [2025-03-04 09:44:22,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:26,950 INFO L124 PetriNetUnfolderBase]: 60462/86204 cut-off events. [2025-03-04 09:44:26,950 INFO L125 PetriNetUnfolderBase]: For 2429/2429 co-relation queries the response was YES. [2025-03-04 09:44:27,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169893 conditions, 86204 events. 60462/86204 cut-off events. For 2429/2429 co-relation queries the response was YES. Maximal size of possible extension queue 3221. Compared 598591 event pairs, 53730 based on Foata normal form. 0/40040 useless extension candidates. Maximal degree in co-relation 33051. Up to 82182 conditions per place. [2025-03-04 09:44:27,408 INFO L140 encePairwiseOnDemand]: 81/91 looper letters, 66 selfloop transitions, 0 changer transitions 0/79 dead transitions. [2025-03-04 09:44:27,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 79 transitions, 308 flow [2025-03-04 09:44:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:44:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:44:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2025-03-04 09:44:27,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 09:44:27,409 INFO L175 Difference]: Start difference. First operand has 89 places, 91 transitions, 200 flow. Second operand 2 states and 104 transitions. [2025-03-04 09:44:27,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 79 transitions, 308 flow [2025-03-04 09:44:27,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 306 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:27,412 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 174 flow [2025-03-04 09:44:27,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=174, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2025-03-04 09:44:27,412 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -8 predicate places. [2025-03-04 09:44:27,412 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 174 flow [2025-03-04 09:44:27,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:27,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:27,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:44:27,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:44:27,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-03-04 09:44:27,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash 367054131, now seen corresponding path program 1 times [2025-03-04 09:44:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:27,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3299625] [2025-03-04 09:44:27,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:27,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:27,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:27,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:27,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:27,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:27,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3299625] [2025-03-04 09:44:27,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3299625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:27,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:27,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:27,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649253697] [2025-03-04 09:44:27,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:27,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:27,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:27,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:27,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:27,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 91 [2025-03-04 09:44:27,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:27,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:27,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 91 [2025-03-04 09:44:27,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:30,483 INFO L124 PetriNetUnfolderBase]: 38385/56717 cut-off events. [2025-03-04 09:44:30,483 INFO L125 PetriNetUnfolderBase]: For 966/966 co-relation queries the response was YES. [2025-03-04 09:44:30,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109986 conditions, 56717 events. 38385/56717 cut-off events. For 966/966 co-relation queries the response was YES. Maximal size of possible extension queue 2454. Compared 407622 event pairs, 26389 based on Foata normal form. 0/29573 useless extension candidates. Maximal degree in co-relation 109980. Up to 39243 conditions per place. [2025-03-04 09:44:30,782 INFO L140 encePairwiseOnDemand]: 75/91 looper letters, 114 selfloop transitions, 7 changer transitions 0/134 dead transitions. [2025-03-04 09:44:30,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 134 transitions, 536 flow [2025-03-04 09:44:30,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2025-03-04 09:44:30,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63003663003663 [2025-03-04 09:44:30,784 INFO L175 Difference]: Start difference. First operand has 81 places, 79 transitions, 174 flow. Second operand 3 states and 172 transitions. [2025-03-04 09:44:30,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 134 transitions, 536 flow [2025-03-04 09:44:30,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 134 transitions, 536 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:30,788 INFO L231 Difference]: Finished difference. Result has 84 places, 85 transitions, 237 flow [2025-03-04 09:44:30,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=84, PETRI_TRANSITIONS=85} [2025-03-04 09:44:30,788 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -5 predicate places. [2025-03-04 09:44:30,788 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 85 transitions, 237 flow [2025-03-04 09:44:30,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:30,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:30,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:44:30,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:44:30,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-03-04 09:44:30,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:30,789 INFO L85 PathProgramCache]: Analyzing trace with hash 367054132, now seen corresponding path program 1 times [2025-03-04 09:44:30,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:30,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016660619] [2025-03-04 09:44:30,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:30,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:30,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:44:30,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:44:30,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:30,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:30,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016660619] [2025-03-04 09:44:30,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016660619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:30,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:30,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:30,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843603385] [2025-03-04 09:44:30,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:30,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:44:30,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:30,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:44:30,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:44:30,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 91 [2025-03-04 09:44:30,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 85 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:30,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:30,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 91 [2025-03-04 09:44:30,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:33,268 INFO L124 PetriNetUnfolderBase]: 21591/31694 cut-off events. [2025-03-04 09:44:33,269 INFO L125 PetriNetUnfolderBase]: For 2462/2462 co-relation queries the response was YES. [2025-03-04 09:44:33,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68682 conditions, 31694 events. 21591/31694 cut-off events. For 2462/2462 co-relation queries the response was YES. Maximal size of possible extension queue 1390. Compared 206351 event pairs, 18138 based on Foata normal form. 0/20534 useless extension candidates. Maximal degree in co-relation 68674. Up to 29504 conditions per place. [2025-03-04 09:44:33,399 INFO L140 encePairwiseOnDemand]: 81/91 looper letters, 62 selfloop transitions, 1 changer transitions 0/76 dead transitions. [2025-03-04 09:44:33,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 76 transitions, 345 flow [2025-03-04 09:44:33,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:33,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-03-04 09:44:33,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3956043956043956 [2025-03-04 09:44:33,400 INFO L175 Difference]: Start difference. First operand has 84 places, 85 transitions, 237 flow. Second operand 3 states and 108 transitions. [2025-03-04 09:44:33,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 76 transitions, 345 flow [2025-03-04 09:44:33,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:33,406 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 214 flow [2025-03-04 09:44:33,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2025-03-04 09:44:33,407 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -13 predicate places. [2025-03-04 09:44:33,407 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 214 flow [2025-03-04 09:44:33,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:33,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:33,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:33,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:44:33,407 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-03-04 09:44:33,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash 551716508, now seen corresponding path program 1 times [2025-03-04 09:44:33,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:33,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13031038] [2025-03-04 09:44:33,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:33,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:33,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 09:44:33,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 09:44:33,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:33,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:33,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:33,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13031038] [2025-03-04 09:44:33,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13031038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:33,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:33,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:33,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243950859] [2025-03-04 09:44:33,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:33,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:33,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:33,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:33,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:33,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 91 [2025-03-04 09:44:33,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:33,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:33,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 91 [2025-03-04 09:44:33,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:35,031 INFO L124 PetriNetUnfolderBase]: 22911/33055 cut-off events. [2025-03-04 09:44:35,031 INFO L125 PetriNetUnfolderBase]: For 2602/2602 co-relation queries the response was YES. [2025-03-04 09:44:35,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70377 conditions, 33055 events. 22911/33055 cut-off events. For 2602/2602 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 214138 event pairs, 6604 based on Foata normal form. 0/23221 useless extension candidates. Maximal degree in co-relation 70369. Up to 21002 conditions per place. [2025-03-04 09:44:35,350 INFO L140 encePairwiseOnDemand]: 79/91 looper letters, 107 selfloop transitions, 15 changer transitions 0/133 dead transitions. [2025-03-04 09:44:35,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 133 transitions, 620 flow [2025-03-04 09:44:35,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-03-04 09:44:35,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5531135531135531 [2025-03-04 09:44:35,351 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 214 flow. Second operand 3 states and 151 transitions. [2025-03-04 09:44:35,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 133 transitions, 620 flow [2025-03-04 09:44:35,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 133 transitions, 619 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:35,355 INFO L231 Difference]: Finished difference. Result has 79 places, 88 transitions, 347 flow [2025-03-04 09:44:35,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=79, PETRI_TRANSITIONS=88} [2025-03-04 09:44:35,356 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -10 predicate places. [2025-03-04 09:44:35,356 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 88 transitions, 347 flow [2025-03-04 09:44:35,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:35,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:35,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:35,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:44:35,356 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-03-04 09:44:35,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash 551716509, now seen corresponding path program 1 times [2025-03-04 09:44:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:35,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311625321] [2025-03-04 09:44:35,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:35,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 09:44:35,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 09:44:35,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:35,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:35,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:35,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311625321] [2025-03-04 09:44:35,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311625321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:35,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:35,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:35,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308848915] [2025-03-04 09:44:35,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:35,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:35,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:35,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:35,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:35,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 91 [2025-03-04 09:44:35,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 88 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:35,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:35,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 91 [2025-03-04 09:44:35,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:37,587 INFO L124 PetriNetUnfolderBase]: 17934/26391 cut-off events. [2025-03-04 09:44:37,588 INFO L125 PetriNetUnfolderBase]: For 13190/13190 co-relation queries the response was YES. [2025-03-04 09:44:37,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64617 conditions, 26391 events. 17934/26391 cut-off events. For 13190/13190 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 174935 event pairs, 3092 based on Foata normal form. 1326/21042 useless extension candidates. Maximal degree in co-relation 64608. Up to 19630 conditions per place. [2025-03-04 09:44:37,727 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 103 selfloop transitions, 7 changer transitions 0/123 dead transitions. [2025-03-04 09:44:37,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 123 transitions, 675 flow [2025-03-04 09:44:37,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2025-03-04 09:44:37,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4945054945054945 [2025-03-04 09:44:37,728 INFO L175 Difference]: Start difference. First operand has 79 places, 88 transitions, 347 flow. Second operand 3 states and 135 transitions. [2025-03-04 09:44:37,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 123 transitions, 675 flow [2025-03-04 09:44:37,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 123 transitions, 645 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:37,745 INFO L231 Difference]: Finished difference. Result has 76 places, 85 transitions, 325 flow [2025-03-04 09:44:37,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=76, PETRI_TRANSITIONS=85} [2025-03-04 09:44:37,745 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -13 predicate places. [2025-03-04 09:44:37,745 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 325 flow [2025-03-04 09:44:37,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:37,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:37,746 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:37,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:44:37,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-03-04 09:44:37,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:37,746 INFO L85 PathProgramCache]: Analyzing trace with hash -947392595, now seen corresponding path program 1 times [2025-03-04 09:44:37,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:37,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811088461] [2025-03-04 09:44:37,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:37,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:37,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:44:37,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:44:37,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:37,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:37,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:37,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:37,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811088461] [2025-03-04 09:44:37,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811088461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:37,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:37,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:37,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271014928] [2025-03-04 09:44:37,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:37,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:37,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:37,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:37,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:37,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 91 [2025-03-04 09:44:37,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 85 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:37,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:37,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 91 [2025-03-04 09:44:37,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:38,956 INFO L124 PetriNetUnfolderBase]: 15542/22695 cut-off events. [2025-03-04 09:44:38,956 INFO L125 PetriNetUnfolderBase]: For 11922/11922 co-relation queries the response was YES. [2025-03-04 09:44:39,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54572 conditions, 22695 events. 15542/22695 cut-off events. For 11922/11922 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 143082 event pairs, 3278 based on Foata normal form. 435/17235 useless extension candidates. Maximal degree in co-relation 54563. Up to 15831 conditions per place. [2025-03-04 09:44:39,087 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 105 selfloop transitions, 9 changer transitions 0/126 dead transitions. [2025-03-04 09:44:39,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 126 transitions, 724 flow [2025-03-04 09:44:39,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-03-04 09:44:39,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-03-04 09:44:39,088 INFO L175 Difference]: Start difference. First operand has 76 places, 85 transitions, 325 flow. Second operand 3 states and 130 transitions. [2025-03-04 09:44:39,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 126 transitions, 724 flow [2025-03-04 09:44:39,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 126 transitions, 696 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:39,105 INFO L231 Difference]: Finished difference. Result has 73 places, 82 transitions, 323 flow [2025-03-04 09:44:39,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=73, PETRI_TRANSITIONS=82} [2025-03-04 09:44:39,106 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -16 predicate places. [2025-03-04 09:44:39,106 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 82 transitions, 323 flow [2025-03-04 09:44:39,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:39,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:39,106 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:39,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:44:39,106 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-03-04 09:44:39,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:39,106 INFO L85 PathProgramCache]: Analyzing trace with hash -947392594, now seen corresponding path program 1 times [2025-03-04 09:44:39,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:39,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728905410] [2025-03-04 09:44:39,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:39,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:39,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:44:39,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:44:39,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:39,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:39,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:39,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728905410] [2025-03-04 09:44:39,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728905410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:39,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:39,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:39,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031985931] [2025-03-04 09:44:39,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:39,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:39,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:39,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:39,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:39,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 91 [2025-03-04 09:44:39,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 82 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:39,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:39,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 91 [2025-03-04 09:44:39,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:40,775 INFO L124 PetriNetUnfolderBase]: 17668/25780 cut-off events. [2025-03-04 09:44:40,775 INFO L125 PetriNetUnfolderBase]: For 11346/11346 co-relation queries the response was YES. [2025-03-04 09:44:40,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62708 conditions, 25780 events. 17668/25780 cut-off events. For 11346/11346 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 165105 event pairs, 4866 based on Foata normal form. 0/20167 useless extension candidates. Maximal degree in co-relation 62699. Up to 13225 conditions per place. [2025-03-04 09:44:41,107 INFO L140 encePairwiseOnDemand]: 79/91 looper letters, 108 selfloop transitions, 23 changer transitions 0/141 dead transitions. [2025-03-04 09:44:41,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 141 transitions, 808 flow [2025-03-04 09:44:41,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2025-03-04 09:44:41,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5201465201465202 [2025-03-04 09:44:41,108 INFO L175 Difference]: Start difference. First operand has 73 places, 82 transitions, 323 flow. Second operand 3 states and 142 transitions. [2025-03-04 09:44:41,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 141 transitions, 808 flow [2025-03-04 09:44:41,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 141 transitions, 782 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:41,115 INFO L231 Difference]: Finished difference. Result has 75 places, 100 transitions, 539 flow [2025-03-04 09:44:41,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=539, PETRI_PLACES=75, PETRI_TRANSITIONS=100} [2025-03-04 09:44:41,115 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -14 predicate places. [2025-03-04 09:44:41,115 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 100 transitions, 539 flow [2025-03-04 09:44:41,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:41,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:41,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:41,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:44:41,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-03-04 09:44:41,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:41,116 INFO L85 PathProgramCache]: Analyzing trace with hash -652817617, now seen corresponding path program 1 times [2025-03-04 09:44:41,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:41,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584493077] [2025-03-04 09:44:41,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:41,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:41,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:44:41,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:44:41,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:41,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:41,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:41,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584493077] [2025-03-04 09:44:41,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584493077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:41,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:41,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:44:41,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511939302] [2025-03-04 09:44:41,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:41,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:44:41,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:41,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:44:41,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:44:41,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 91 [2025-03-04 09:44:41,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 100 transitions, 539 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:41,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:41,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 91 [2025-03-04 09:44:41,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:43,930 INFO L124 PetriNetUnfolderBase]: 32033/48568 cut-off events. [2025-03-04 09:44:43,930 INFO L125 PetriNetUnfolderBase]: For 42027/42180 co-relation queries the response was YES. [2025-03-04 09:44:44,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126592 conditions, 48568 events. 32033/48568 cut-off events. For 42027/42180 co-relation queries the response was YES. Maximal size of possible extension queue 1863. Compared 357681 event pairs, 6782 based on Foata normal form. 21/38935 useless extension candidates. Maximal degree in co-relation 126582. Up to 20635 conditions per place. [2025-03-04 09:44:44,516 INFO L140 encePairwiseOnDemand]: 78/91 looper letters, 285 selfloop transitions, 28 changer transitions 0/324 dead transitions. [2025-03-04 09:44:44,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 324 transitions, 2321 flow [2025-03-04 09:44:44,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:44:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:44:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2025-03-04 09:44:44,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2025-03-04 09:44:44,518 INFO L175 Difference]: Start difference. First operand has 75 places, 100 transitions, 539 flow. Second operand 6 states and 287 transitions. [2025-03-04 09:44:44,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 324 transitions, 2321 flow [2025-03-04 09:44:44,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 324 transitions, 2181 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:44,613 INFO L231 Difference]: Finished difference. Result has 81 places, 130 transitions, 703 flow [2025-03-04 09:44:44,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=703, PETRI_PLACES=81, PETRI_TRANSITIONS=130} [2025-03-04 09:44:44,614 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -8 predicate places. [2025-03-04 09:44:44,614 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 130 transitions, 703 flow [2025-03-04 09:44:44,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:44,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:44,614 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:44,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:44:44,614 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2025-03-04 09:44:44,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash -928153125, now seen corresponding path program 1 times [2025-03-04 09:44:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:44,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619458790] [2025-03-04 09:44:44,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:44,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:44,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:44,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:44,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:44,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:44,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619458790] [2025-03-04 09:44:44,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619458790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:44,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:44,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:44,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416414677] [2025-03-04 09:44:44,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:44,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:44:44,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:44,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:44:44,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:44:44,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 91 [2025-03-04 09:44:44,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 130 transitions, 703 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:44,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:44,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 91 [2025-03-04 09:44:44,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand