./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue_longer.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/queue_longer.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 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:42:00,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:42:00,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:42:00,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:42:00,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:42:00,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:42:00,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:42:00,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:42:00,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:42:00,664 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:42:00,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:42:00,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:42:00,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:42:00,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:42:00,665 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:42:00,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:42:00,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:42:00,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:42:00,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:42:00,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:42:00,666 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:42:00,666 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:42:00,666 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:42:00,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:42:00,666 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:42:00,666 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:42:00,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:42:00,666 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:42:00,666 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:42:00,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:42:00,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:42:00,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:42:00,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:42:00,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:42:00,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:42:00,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:42:00,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:42:00,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:42:00,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:42:00,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:42:00,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:42:00,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:42:00,668 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 -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2025-03-04 09:42:00,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:42:00,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:42:00,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:42:00,879 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:42:00,879 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:42:00,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_longer.i [2025-03-04 09:42:02,031 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114308068/57131177f3bc412cb5ecbce94f502a32/FLAGae161a14b [2025-03-04 09:42:02,326 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:42:02,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2025-03-04 09:42:02,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114308068/57131177f3bc412cb5ecbce94f502a32/FLAGae161a14b [2025-03-04 09:42:02,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114308068/57131177f3bc412cb5ecbce94f502a32 [2025-03-04 09:42:02,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:42:02,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:42:02,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:42:02,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:42:02,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:42:02,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:42:02" (1/1) ... [2025-03-04 09:42:02,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ffa047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:02, skipping insertion in model container [2025-03-04 09:42:02,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:42:02" (1/1) ... [2025-03-04 09:42:02,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:42:02,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:42:02,662 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:42:02,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:42:02,788 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:42:02,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:02 WrapperNode [2025-03-04 09:42:02,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:42:02,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:42:02,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:42:02,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:42:02,797 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:42:02" (1/1) ... [2025-03-04 09:42:02,814 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:42:02" (1/1) ... [2025-03-04 09:42:02,869 INFO L138 Inliner]: procedures = 274, calls = 859, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1040 [2025-03-04 09:42:02,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:42:02,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:42:02,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:42:02,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:42:02,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:02" (1/1) ... [2025-03-04 09:42:02,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:02" (1/1) ... [2025-03-04 09:42:02,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:02" (1/1) ... [2025-03-04 09:42:02,925 INFO L175 MemorySlicer]: Split 844 memory accesses to 4 slices as follows [2, 5, 403, 434]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 400, 403]. The 16 writes are split as follows [0, 0, 2, 14]. [2025-03-04 09:42:02,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:02" (1/1) ... [2025-03-04 09:42:02,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:02" (1/1) ... [2025-03-04 09:42:02,950 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:02" (1/1) ... [2025-03-04 09:42:02,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:02" (1/1) ... [2025-03-04 09:42:02,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:02" (1/1) ... [2025-03-04 09:42:02,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:02" (1/1) ... [2025-03-04 09:42:02,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:42:02,969 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:42:02,969 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:42:02,969 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:42:02,970 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:02" (1/1) ... [2025-03-04 09:42:02,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:42:02,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:42:02,999 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:42:03,001 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:42:03,020 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 09:42:03,021 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 09:42:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 09:42:03,021 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 09:42:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 09:42:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:42:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:42:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:42:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 09:42:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:42:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:42:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:42:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 09:42:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 09:42:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:42:03,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:42:03,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:42:03,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:42:03,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 09:42:03,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:42:03,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:42:03,023 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:42:03,137 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:42:03,138 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:42:04,191 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:42:04,195 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:42:09,200 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:42:09,201 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:42:09,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:42:09 BoogieIcfgContainer [2025-03-04 09:42:09,202 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:42:09,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:42:09,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:42:09,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:42:09,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:42:02" (1/3) ... [2025-03-04 09:42:09,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7e1956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:42:09, skipping insertion in model container [2025-03-04 09:42:09,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:42:02" (2/3) ... [2025-03-04 09:42:09,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7e1956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:42:09, skipping insertion in model container [2025-03-04 09:42:09,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:42:09" (3/3) ... [2025-03-04 09:42:09,209 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2025-03-04 09:42:09,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:42:09,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 159 locations, 1 initial locations, 2 loop locations, and 72 error locations. [2025-03-04 09:42:09,221 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:42:09,311 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 09:42:09,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 172 transitions, 358 flow [2025-03-04 09:42:09,399 INFO L124 PetriNetUnfolderBase]: 14/170 cut-off events. [2025-03-04 09:42:09,402 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:42:09,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 14/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 518 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 142. Up to 2 conditions per place. [2025-03-04 09:42:09,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 172 transitions, 358 flow [2025-03-04 09:42:09,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 169 transitions, 350 flow [2025-03-04 09:42:09,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:42:09,431 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;@1a4cf336, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:42:09,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 134 error locations. [2025-03-04 09:42:09,447 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:42:09,447 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-04 09:42:09,447 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:42:09,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:09,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 09:42:09,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:09,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:09,452 INFO L85 PathProgramCache]: Analyzing trace with hash 74642, now seen corresponding path program 1 times [2025-03-04 09:42:09,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:09,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197599213] [2025-03-04 09:42:09,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:09,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:09,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 09:42:09,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 09:42:09,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:09,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:42:10,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:10,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197599213] [2025-03-04 09:42:10,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197599213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:10,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:10,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:42:10,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188195120] [2025-03-04 09:42:10,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:10,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:10,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:10,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:10,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:10,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-03-04 09:42:10,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 169 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:42:10,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:10,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-03-04 09:42:10,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:10,674 INFO L124 PetriNetUnfolderBase]: 1744/4653 cut-off events. [2025-03-04 09:42:10,675 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-04 09:42:10,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7479 conditions, 4653 events. 1744/4653 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37061 event pairs, 1393 based on Foata normal form. 182/3587 useless extension candidates. Maximal degree in co-relation 7362. Up to 2745 conditions per place. [2025-03-04 09:42:10,703 INFO L140 encePairwiseOnDemand]: 162/172 looper letters, 58 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2025-03-04 09:42:10,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 154 transitions, 440 flow [2025-03-04 09:42:10,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2025-03-04 09:42:10,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7015503875968992 [2025-03-04 09:42:10,715 INFO L175 Difference]: Start difference. First operand has 162 places, 169 transitions, 350 flow. Second operand 3 states and 362 transitions. [2025-03-04 09:42:10,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 154 transitions, 440 flow [2025-03-04 09:42:10,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 154 transitions, 432 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:42:10,722 INFO L231 Difference]: Finished difference. Result has 151 places, 154 transitions, 316 flow [2025-03-04 09:42:10,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=151, PETRI_TRANSITIONS=154} [2025-03-04 09:42:10,727 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -11 predicate places. [2025-03-04 09:42:10,728 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 154 transitions, 316 flow [2025-03-04 09:42:10,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:42:10,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:10,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 09:42:10,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:42:10,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:10,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:10,729 INFO L85 PathProgramCache]: Analyzing trace with hash 74643, now seen corresponding path program 1 times [2025-03-04 09:42:10,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:10,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662823671] [2025-03-04 09:42:10,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:10,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:10,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 09:42:10,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 09:42:10,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:10,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:11,093 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:42:11,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:11,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662823671] [2025-03-04 09:42:11,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662823671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:11,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:11,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:42:11,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466503976] [2025-03-04 09:42:11,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:11,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:11,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:11,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:11,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:11,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-03-04 09:42:11,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 154 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:42:11,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:11,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-03-04 09:42:11,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:11,657 INFO L124 PetriNetUnfolderBase]: 1744/4650 cut-off events. [2025-03-04 09:42:11,657 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 09:42:11,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7430 conditions, 4650 events. 1744/4650 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37055 event pairs, 1393 based on Foata normal form. 3/3407 useless extension candidates. Maximal degree in co-relation 7419. Up to 2745 conditions per place. [2025-03-04 09:42:11,681 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 58 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-03-04 09:42:11,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 151 transitions, 430 flow [2025-03-04 09:42:11,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:11,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2025-03-04 09:42:11,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6918604651162791 [2025-03-04 09:42:11,684 INFO L175 Difference]: Start difference. First operand has 151 places, 154 transitions, 316 flow. Second operand 3 states and 357 transitions. [2025-03-04 09:42:11,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 151 transitions, 430 flow [2025-03-04 09:42:11,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 151 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:42:11,686 INFO L231 Difference]: Finished difference. Result has 148 places, 151 transitions, 310 flow [2025-03-04 09:42:11,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=148, PETRI_TRANSITIONS=151} [2025-03-04 09:42:11,686 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -14 predicate places. [2025-03-04 09:42:11,686 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 151 transitions, 310 flow [2025-03-04 09:42:11,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:42:11,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:11,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:42:11,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:42:11,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:11,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:11,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2069128958, now seen corresponding path program 1 times [2025-03-04 09:42:11,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:11,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090216010] [2025-03-04 09:42:11,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:11,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:11,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:42:11,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:42:11,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:11,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:12,172 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:42:12,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:12,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090216010] [2025-03-04 09:42:12,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090216010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:12,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:12,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:42:12,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484106068] [2025-03-04 09:42:12,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:12,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:42:12,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:12,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:42:12,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:42:12,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-03-04 09:42:12,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 151 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 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:42:12,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:12,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-03-04 09:42:12,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:12,771 INFO L124 PetriNetUnfolderBase]: 1744/4648 cut-off events. [2025-03-04 09:42:12,772 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 09:42:12,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 4648 events. 1744/4648 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37022 event pairs, 1393 based on Foata normal form. 1/3405 useless extension candidates. Maximal degree in co-relation 7417. Up to 2744 conditions per place. [2025-03-04 09:42:12,794 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 58 selfloop transitions, 3 changer transitions 0/149 dead transitions. [2025-03-04 09:42:12,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 149 transitions, 428 flow [2025-03-04 09:42:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:42:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:42:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2025-03-04 09:42:12,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6613372093023255 [2025-03-04 09:42:12,796 INFO L175 Difference]: Start difference. First operand has 148 places, 151 transitions, 310 flow. Second operand 4 states and 455 transitions. [2025-03-04 09:42:12,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 149 transitions, 428 flow [2025-03-04 09:42:12,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 149 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:42:12,800 INFO L231 Difference]: Finished difference. Result has 147 places, 149 transitions, 308 flow [2025-03-04 09:42:12,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=147, PETRI_TRANSITIONS=149} [2025-03-04 09:42:12,800 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -15 predicate places. [2025-03-04 09:42:12,800 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 149 transitions, 308 flow [2025-03-04 09:42:12,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 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:42:12,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:12,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:42:12,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:42:12,801 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:12,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:12,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2069128959, now seen corresponding path program 1 times [2025-03-04 09:42:12,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:12,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591296817] [2025-03-04 09:42:12,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:12,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:12,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:42:12,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:42:12,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:12,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:12,963 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:42:12,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:12,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591296817] [2025-03-04 09:42:12,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591296817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:12,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:12,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:42:12,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444368922] [2025-03-04 09:42:12,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:12,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:42:12,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:12,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:42:12,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:42:13,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-03-04 09:42:13,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 149 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 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:42:13,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:13,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-03-04 09:42:13,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:13,650 INFO L124 PetriNetUnfolderBase]: 1744/4646 cut-off events. [2025-03-04 09:42:13,651 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 09:42:13,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7430 conditions, 4646 events. 1744/4646 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36999 event pairs, 1393 based on Foata normal form. 1/3404 useless extension candidates. Maximal degree in co-relation 7412. Up to 2744 conditions per place. [2025-03-04 09:42:13,673 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 60 selfloop transitions, 3 changer transitions 0/147 dead transitions. [2025-03-04 09:42:13,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 147 transitions, 430 flow [2025-03-04 09:42:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:42:13,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:42:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2025-03-04 09:42:13,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6351744186046512 [2025-03-04 09:42:13,676 INFO L175 Difference]: Start difference. First operand has 147 places, 149 transitions, 308 flow. Second operand 4 states and 437 transitions. [2025-03-04 09:42:13,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 147 transitions, 430 flow [2025-03-04 09:42:13,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 147 transitions, 424 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:42:13,680 INFO L231 Difference]: Finished difference. Result has 145 places, 147 transitions, 304 flow [2025-03-04 09:42:13,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=145, PETRI_TRANSITIONS=147} [2025-03-04 09:42:13,681 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -17 predicate places. [2025-03-04 09:42:13,681 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 147 transitions, 304 flow [2025-03-04 09:42:13,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 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:42:13,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:13,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:13,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:42:13,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:13,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash 584442062, now seen corresponding path program 1 times [2025-03-04 09:42:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:13,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596231086] [2025-03-04 09:42:13,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:13,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:42:13,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:42:13,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:13,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:13,972 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:42:13,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:13,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596231086] [2025-03-04 09:42:13,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596231086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:13,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:13,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:42:13,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915389107] [2025-03-04 09:42:13,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:13,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:42:13,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:13,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:42:13,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:42:14,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 172 [2025-03-04 09:42:14,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 147 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 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:42:14,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:14,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 172 [2025-03-04 09:42:14,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:14,644 INFO L124 PetriNetUnfolderBase]: 2019/4463 cut-off events. [2025-03-04 09:42:14,644 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 09:42:14,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7727 conditions, 4463 events. 2019/4463 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 31647 event pairs, 705 based on Foata normal form. 0/3899 useless extension candidates. Maximal degree in co-relation 7710. Up to 1807 conditions per place. [2025-03-04 09:42:14,664 INFO L140 encePairwiseOnDemand]: 150/172 looper letters, 81 selfloop transitions, 6 changer transitions 0/150 dead transitions. [2025-03-04 09:42:14,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 150 transitions, 485 flow [2025-03-04 09:42:14,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:42:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:42:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2025-03-04 09:42:14,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-04 09:42:14,666 INFO L175 Difference]: Start difference. First operand has 145 places, 147 transitions, 304 flow. Second operand 5 states and 473 transitions. [2025-03-04 09:42:14,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 150 transitions, 485 flow [2025-03-04 09:42:14,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 150 transitions, 479 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:42:14,669 INFO L231 Difference]: Finished difference. Result has 130 places, 131 transitions, 278 flow [2025-03-04 09:42:14,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=130, PETRI_TRANSITIONS=131} [2025-03-04 09:42:14,669 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -32 predicate places. [2025-03-04 09:42:14,669 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 131 transitions, 278 flow [2025-03-04 09:42:14,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 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:42:14,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:14,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:14,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:42:14,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:14,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:14,671 INFO L85 PathProgramCache]: Analyzing trace with hash 584442063, now seen corresponding path program 1 times [2025-03-04 09:42:14,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:14,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829984363] [2025-03-04 09:42:14,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:14,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:14,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:42:14,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:42:14,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:14,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:15,252 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:42:15,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:15,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829984363] [2025-03-04 09:42:15,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829984363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:15,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:15,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:42:15,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10532735] [2025-03-04 09:42:15,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:15,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:42:15,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:15,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:42:15,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:42:15,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 172 [2025-03-04 09:42:15,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 131 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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:42:15,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:15,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 172 [2025-03-04 09:42:15,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:15,927 INFO L124 PetriNetUnfolderBase]: 1703/3676 cut-off events. [2025-03-04 09:42:15,927 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-03-04 09:42:15,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6548 conditions, 3676 events. 1703/3676 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 24515 event pairs, 702 based on Foata normal form. 204/3341 useless extension candidates. Maximal degree in co-relation 2518. Up to 1413 conditions per place. [2025-03-04 09:42:15,942 INFO L140 encePairwiseOnDemand]: 152/172 looper letters, 73 selfloop transitions, 6 changer transitions 0/136 dead transitions. [2025-03-04 09:42:15,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 136 transitions, 447 flow [2025-03-04 09:42:15,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:42:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:42:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2025-03-04 09:42:15,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6139534883720931 [2025-03-04 09:42:15,944 INFO L175 Difference]: Start difference. First operand has 130 places, 131 transitions, 278 flow. Second operand 5 states and 528 transitions. [2025-03-04 09:42:15,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 136 transitions, 447 flow [2025-03-04 09:42:15,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 136 transitions, 435 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:42:15,947 INFO L231 Difference]: Finished difference. Result has 116 places, 117 transitions, 250 flow [2025-03-04 09:42:15,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=116, PETRI_TRANSITIONS=117} [2025-03-04 09:42:15,947 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -46 predicate places. [2025-03-04 09:42:15,947 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 117 transitions, 250 flow [2025-03-04 09:42:15,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 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:42:15,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:15,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:15,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:42:15,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:15,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:15,948 INFO L85 PathProgramCache]: Analyzing trace with hash 937837040, now seen corresponding path program 1 times [2025-03-04 09:42:15,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:15,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525904527] [2025-03-04 09:42:15,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:15,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:15,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:42:16,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:42:16,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:16,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:16,784 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:42:16,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:16,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525904527] [2025-03-04 09:42:16,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525904527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:16,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:16,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:42:16,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535400373] [2025-03-04 09:42:16,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:16,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:42:16,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:16,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:42:16,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:42:17,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 172 [2025-03-04 09:42:17,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 117 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 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:42:17,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:17,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 172 [2025-03-04 09:42:17,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:17,906 INFO L124 PetriNetUnfolderBase]: 2502/5392 cut-off events. [2025-03-04 09:42:17,907 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-04 09:42:17,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9550 conditions, 5392 events. 2502/5392 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 38773 event pairs, 536 based on Foata normal form. 0/4394 useless extension candidates. Maximal degree in co-relation 3717. Up to 3436 conditions per place. [2025-03-04 09:42:17,921 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 125 selfloop transitions, 11 changer transitions 0/184 dead transitions. [2025-03-04 09:42:17,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 184 transitions, 661 flow [2025-03-04 09:42:17,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:42:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:42:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2025-03-04 09:42:17,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5506644518272426 [2025-03-04 09:42:17,923 INFO L175 Difference]: Start difference. First operand has 116 places, 117 transitions, 250 flow. Second operand 7 states and 663 transitions. [2025-03-04 09:42:17,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 184 transitions, 661 flow [2025-03-04 09:42:17,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 184 transitions, 647 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:42:17,930 INFO L231 Difference]: Finished difference. Result has 122 places, 127 transitions, 312 flow [2025-03-04 09:42:17,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=122, PETRI_TRANSITIONS=127} [2025-03-04 09:42:17,930 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -40 predicate places. [2025-03-04 09:42:17,932 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 127 transitions, 312 flow [2025-03-04 09:42:17,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 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:42:17,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:17,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:17,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:42:17,932 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:17,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:17,932 INFO L85 PathProgramCache]: Analyzing trace with hash 584202995, now seen corresponding path program 1 times [2025-03-04 09:42:17,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:17,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293813041] [2025-03-04 09:42:17,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:17,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:17,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:42:17,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:42:17,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:17,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:18,092 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:42:18,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:18,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293813041] [2025-03-04 09:42:18,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293813041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:18,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:18,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:42:18,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753859689] [2025-03-04 09:42:18,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:18,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:42:18,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:18,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:42:18,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:42:18,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 172 [2025-03-04 09:42:18,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 127 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 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:42:18,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:18,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 172 [2025-03-04 09:42:18,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:18,635 INFO L124 PetriNetUnfolderBase]: 2427/5009 cut-off events. [2025-03-04 09:42:18,635 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-03-04 09:42:18,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9367 conditions, 5009 events. 2427/5009 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 34391 event pairs, 906 based on Foata normal form. 87/4642 useless extension candidates. Maximal degree in co-relation 9056. Up to 2023 conditions per place. [2025-03-04 09:42:18,653 INFO L140 encePairwiseOnDemand]: 160/172 looper letters, 109 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2025-03-04 09:42:18,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 158 transitions, 621 flow [2025-03-04 09:42:18,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:42:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:42:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2025-03-04 09:42:18,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6151162790697674 [2025-03-04 09:42:18,655 INFO L175 Difference]: Start difference. First operand has 122 places, 127 transitions, 312 flow. Second operand 5 states and 529 transitions. [2025-03-04 09:42:18,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 158 transitions, 621 flow [2025-03-04 09:42:18,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 158 transitions, 619 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:42:18,658 INFO L231 Difference]: Finished difference. Result has 117 places, 119 transitions, 302 flow [2025-03-04 09:42:18,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=117, PETRI_TRANSITIONS=119} [2025-03-04 09:42:18,661 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -45 predicate places. [2025-03-04 09:42:18,661 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 119 transitions, 302 flow [2025-03-04 09:42:18,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 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:42:18,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:18,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:18,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:42:18,662 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:18,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:18,663 INFO L85 PathProgramCache]: Analyzing trace with hash 584202996, now seen corresponding path program 1 times [2025-03-04 09:42:18,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:18,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059264970] [2025-03-04 09:42:18,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:18,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:42:18,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:42:18,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:18,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:18,811 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:42:18,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:18,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059264970] [2025-03-04 09:42:18,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059264970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:18,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:18,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:42:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25049651] [2025-03-04 09:42:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:18,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:18,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:18,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:18,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-03-04 09:42:18,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 119 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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:42:18,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:18,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-03-04 09:42:18,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:19,036 INFO L124 PetriNetUnfolderBase]: 1382/3055 cut-off events. [2025-03-04 09:42:19,036 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-03-04 09:42:19,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5512 conditions, 3055 events. 1382/3055 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17536 event pairs, 703 based on Foata normal form. 55/2727 useless extension candidates. Maximal degree in co-relation 5504. Up to 1211 conditions per place. [2025-03-04 09:42:19,046 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 81 selfloop transitions, 3 changer transitions 0/132 dead transitions. [2025-03-04 09:42:19,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 132 transitions, 470 flow [2025-03-04 09:42:19,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2025-03-04 09:42:19,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751937984496124 [2025-03-04 09:42:19,048 INFO L175 Difference]: Start difference. First operand has 117 places, 119 transitions, 302 flow. Second operand 3 states and 388 transitions. [2025-03-04 09:42:19,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 132 transitions, 470 flow [2025-03-04 09:42:19,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 132 transitions, 439 flow, removed 1 selfloop flow, removed 11 redundant places. [2025-03-04 09:42:19,052 INFO L231 Difference]: Finished difference. Result has 107 places, 109 transitions, 235 flow [2025-03-04 09:42:19,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=107, PETRI_TRANSITIONS=109} [2025-03-04 09:42:19,053 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -55 predicate places. [2025-03-04 09:42:19,053 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 109 transitions, 235 flow [2025-03-04 09:42:19,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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:42:19,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:19,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:19,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:42:19,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:19,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:19,054 INFO L85 PathProgramCache]: Analyzing trace with hash -576181152, now seen corresponding path program 1 times [2025-03-04 09:42:19,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:19,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796608827] [2025-03-04 09:42:19,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:19,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:19,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:42:19,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:42:19,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:19,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:19,230 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:42:19,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:19,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796608827] [2025-03-04 09:42:19,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796608827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:19,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:19,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:42:19,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670463666] [2025-03-04 09:42:19,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:19,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:19,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:19,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:19,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:19,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-03-04 09:42:19,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 109 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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:42:19,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:19,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-03-04 09:42:19,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:19,516 INFO L124 PetriNetUnfolderBase]: 1392/3119 cut-off events. [2025-03-04 09:42:19,516 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-04 09:42:19,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5502 conditions, 3119 events. 1392/3119 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 18132 event pairs, 1089 based on Foata normal form. 0/2730 useless extension candidates. Maximal degree in co-relation 5497. Up to 2216 conditions per place. [2025-03-04 09:42:19,525 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 60 selfloop transitions, 1 changer transitions 0/108 dead transitions. [2025-03-04 09:42:19,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 108 transitions, 355 flow [2025-03-04 09:42:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-03-04 09:42:19,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6996124031007752 [2025-03-04 09:42:19,527 INFO L175 Difference]: Start difference. First operand has 107 places, 109 transitions, 235 flow. Second operand 3 states and 361 transitions. [2025-03-04 09:42:19,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 108 transitions, 355 flow [2025-03-04 09:42:19,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 108 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:42:19,528 INFO L231 Difference]: Finished difference. Result has 107 places, 108 transitions, 232 flow [2025-03-04 09:42:19,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=107, PETRI_TRANSITIONS=108} [2025-03-04 09:42:19,530 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -55 predicate places. [2025-03-04 09:42:19,530 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 108 transitions, 232 flow [2025-03-04 09:42:19,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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:42:19,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:19,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:19,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:42:19,531 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:19,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:19,531 INFO L85 PathProgramCache]: Analyzing trace with hash -576181153, now seen corresponding path program 1 times [2025-03-04 09:42:19,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:19,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909787949] [2025-03-04 09:42:19,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:19,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:19,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:42:19,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:42:19,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:19,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:19,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:42:19,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:19,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909787949] [2025-03-04 09:42:19,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909787949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:19,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:19,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:42:19,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487091011] [2025-03-04 09:42:19,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:19,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:19,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:19,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:19,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:19,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2025-03-04 09:42:19,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 108 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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:42:19,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:19,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2025-03-04 09:42:19,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:19,893 INFO L124 PetriNetUnfolderBase]: 1392/3052 cut-off events. [2025-03-04 09:42:19,894 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 09:42:19,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5422 conditions, 3052 events. 1392/3052 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17356 event pairs, 1089 based on Foata normal form. 77/2795 useless extension candidates. Maximal degree in co-relation 5417. Up to 2216 conditions per place. [2025-03-04 09:42:19,902 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 60 selfloop transitions, 1 changer transitions 0/105 dead transitions. [2025-03-04 09:42:19,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 105 transitions, 348 flow [2025-03-04 09:42:19,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2025-03-04 09:42:19,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6918604651162791 [2025-03-04 09:42:19,904 INFO L175 Difference]: Start difference. First operand has 107 places, 108 transitions, 232 flow. Second operand 3 states and 357 transitions. [2025-03-04 09:42:19,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 105 transitions, 348 flow [2025-03-04 09:42:19,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 105 transitions, 347 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:42:19,905 INFO L231 Difference]: Finished difference. Result has 105 places, 105 transitions, 227 flow [2025-03-04 09:42:19,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=227, PETRI_PLACES=105, PETRI_TRANSITIONS=105} [2025-03-04 09:42:19,906 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -57 predicate places. [2025-03-04 09:42:19,906 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 105 transitions, 227 flow [2025-03-04 09:42:19,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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:42:19,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:19,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:19,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:42:19,906 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:19,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:19,907 INFO L85 PathProgramCache]: Analyzing trace with hash -681744132, now seen corresponding path program 1 times [2025-03-04 09:42:19,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:19,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562421184] [2025-03-04 09:42:19,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:19,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:19,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 09:42:19,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 09:42:19,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:19,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:20,042 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:42:20,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:20,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562421184] [2025-03-04 09:42:20,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562421184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:20,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:20,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:42:20,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059134755] [2025-03-04 09:42:20,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:20,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:42:20,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:20,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:42:20,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:42:20,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-03-04 09:42:20,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 105 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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:42:20,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:20,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-03-04 09:42:20,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:20,503 INFO L124 PetriNetUnfolderBase]: 1409/3045 cut-off events. [2025-03-04 09:42:20,504 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 09:42:20,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5448 conditions, 3045 events. 1409/3045 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17110 event pairs, 1074 based on Foata normal form. 0/2747 useless extension candidates. Maximal degree in co-relation 5443. Up to 2186 conditions per place. [2025-03-04 09:42:20,512 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 68 selfloop transitions, 4 changer transitions 0/111 dead transitions. [2025-03-04 09:42:20,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 111 transitions, 384 flow [2025-03-04 09:42:20,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:42:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:42:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2025-03-04 09:42:20,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6255813953488372 [2025-03-04 09:42:20,514 INFO L175 Difference]: Start difference. First operand has 105 places, 105 transitions, 227 flow. Second operand 5 states and 538 transitions. [2025-03-04 09:42:20,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 111 transitions, 384 flow [2025-03-04 09:42:20,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 111 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:42:20,515 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 230 flow [2025-03-04 09:42:20,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2025-03-04 09:42:20,516 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -56 predicate places. [2025-03-04 09:42:20,516 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 230 flow [2025-03-04 09:42:20,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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:42:20,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:20,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:20,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:42:20,517 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:20,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:20,517 INFO L85 PathProgramCache]: Analyzing trace with hash -681744131, now seen corresponding path program 1 times [2025-03-04 09:42:20,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:20,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706388725] [2025-03-04 09:42:20,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:20,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:20,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 09:42:20,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 09:42:20,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:20,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:20,966 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:42:20,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:20,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706388725] [2025-03-04 09:42:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706388725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:20,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:20,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:42:20,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274324415] [2025-03-04 09:42:20,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:20,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:42:20,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:20,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:42:20,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:42:21,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-03-04 09:42:21,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 230 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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:42:21,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:21,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-03-04 09:42:21,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:21,454 INFO L124 PetriNetUnfolderBase]: 1392/3004 cut-off events. [2025-03-04 09:42:21,454 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-04 09:42:21,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5401 conditions, 3004 events. 1392/3004 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 16851 event pairs, 1074 based on Foata normal form. 24/2730 useless extension candidates. Maximal degree in co-relation 5396. Up to 2186 conditions per place. [2025-03-04 09:42:21,464 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 65 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2025-03-04 09:42:21,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 109 transitions, 381 flow [2025-03-04 09:42:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:42:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:42:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2025-03-04 09:42:21,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6569767441860465 [2025-03-04 09:42:21,466 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 230 flow. Second operand 5 states and 565 transitions. [2025-03-04 09:42:21,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 109 transitions, 381 flow [2025-03-04 09:42:21,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 109 transitions, 373 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:42:21,467 INFO L231 Difference]: Finished difference. Result has 104 places, 101 transitions, 226 flow [2025-03-04 09:42:21,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=104, PETRI_TRANSITIONS=101} [2025-03-04 09:42:21,468 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -58 predicate places. [2025-03-04 09:42:21,468 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 101 transitions, 226 flow [2025-03-04 09:42:21,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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:42:21,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:21,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:21,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:42:21,469 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:21,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:21,469 INFO L85 PathProgramCache]: Analyzing trace with hash 340738021, now seen corresponding path program 1 times [2025-03-04 09:42:21,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:21,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854519354] [2025-03-04 09:42:21,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:21,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:21,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:42:21,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:42:21,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:21,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:21,552 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:42:21,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:21,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854519354] [2025-03-04 09:42:21,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854519354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:21,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:21,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:42:21,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132146889] [2025-03-04 09:42:21,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:21,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:21,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:21,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:21,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:21,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-03-04 09:42:21,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 101 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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:42:21,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:21,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-03-04 09:42:21,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:21,748 INFO L124 PetriNetUnfolderBase]: 1380/2992 cut-off events. [2025-03-04 09:42:21,748 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-04 09:42:21,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5377 conditions, 2992 events. 1380/2992 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 16804 event pairs, 1074 based on Foata normal form. 0/2706 useless extension candidates. Maximal degree in co-relation 5372. Up to 2176 conditions per place. [2025-03-04 09:42:21,755 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 66 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2025-03-04 09:42:21,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 108 transitions, 377 flow [2025-03-04 09:42:21,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2025-03-04 09:42:21,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7189922480620154 [2025-03-04 09:42:21,756 INFO L175 Difference]: Start difference. First operand has 104 places, 101 transitions, 226 flow. Second operand 3 states and 371 transitions. [2025-03-04 09:42:21,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 108 transitions, 377 flow [2025-03-04 09:42:21,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 108 transitions, 369 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:42:21,757 INFO L231 Difference]: Finished difference. Result has 102 places, 100 transitions, 220 flow [2025-03-04 09:42:21,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=102, PETRI_TRANSITIONS=100} [2025-03-04 09:42:21,758 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -60 predicate places. [2025-03-04 09:42:21,758 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 220 flow [2025-03-04 09:42:21,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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:42:21,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:21,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:21,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:42:21,758 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:21,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:21,759 INFO L85 PathProgramCache]: Analyzing trace with hash -436164801, now seen corresponding path program 1 times [2025-03-04 09:42:21,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:21,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515872341] [2025-03-04 09:42:21,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:21,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:21,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 09:42:21,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 09:42:21,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:21,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:22,499 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:42:22,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:22,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515872341] [2025-03-04 09:42:22,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515872341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:22,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:22,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 09:42:22,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086519718] [2025-03-04 09:42:22,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:22,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 09:42:22,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:22,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 09:42:22,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:42:22,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 172 [2025-03-04 09:42:22,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 220 flow. Second operand has 9 states, 9 states have (on average 94.55555555555556) internal successors, (851), 9 states have internal predecessors, (851), 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:42:22,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:22,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 172 [2025-03-04 09:42:22,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:23,131 INFO L124 PetriNetUnfolderBase]: 1717/3481 cut-off events. [2025-03-04 09:42:23,131 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-04 09:42:23,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6486 conditions, 3481 events. 1717/3481 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 19000 event pairs, 388 based on Foata normal form. 0/3243 useless extension candidates. Maximal degree in co-relation 6481. Up to 2364 conditions per place. [2025-03-04 09:42:23,139 INFO L140 encePairwiseOnDemand]: 159/172 looper letters, 117 selfloop transitions, 12 changer transitions 0/160 dead transitions. [2025-03-04 09:42:23,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 160 transitions, 608 flow [2025-03-04 09:42:23,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:42:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:42:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 957 transitions. [2025-03-04 09:42:23,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6182170542635659 [2025-03-04 09:42:23,141 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 220 flow. Second operand 9 states and 957 transitions. [2025-03-04 09:42:23,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 160 transitions, 608 flow [2025-03-04 09:42:23,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 160 transitions, 604 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:42:23,143 INFO L231 Difference]: Finished difference. Result has 108 places, 101 transitions, 252 flow [2025-03-04 09:42:23,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=252, PETRI_PLACES=108, PETRI_TRANSITIONS=101} [2025-03-04 09:42:23,145 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -54 predicate places. [2025-03-04 09:42:23,145 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 101 transitions, 252 flow [2025-03-04 09:42:23,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.55555555555556) internal successors, (851), 9 states have internal predecessors, (851), 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:42:23,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:23,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:23,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:42:23,146 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:23,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:23,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1976594070, now seen corresponding path program 1 times [2025-03-04 09:42:23,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:23,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305246073] [2025-03-04 09:42:23,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:23,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:23,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 09:42:23,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 09:42:23,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:23,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:24,690 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:42:24,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:24,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305246073] [2025-03-04 09:42:24,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305246073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:24,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:24,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 09:42:24,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371496002] [2025-03-04 09:42:24,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:24,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:42:24,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:24,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:42:24,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:42:25,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 172 [2025-03-04 09:42:25,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 101 transitions, 252 flow. Second operand has 15 states, 15 states have (on average 92.66666666666667) internal successors, (1390), 15 states have internal predecessors, (1390), 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:42:25,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:25,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 172 [2025-03-04 09:42:25,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:26,119 INFO L124 PetriNetUnfolderBase]: 1711/3420 cut-off events. [2025-03-04 09:42:26,119 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-03-04 09:42:26,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6719 conditions, 3420 events. 1711/3420 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 18673 event pairs, 438 based on Foata normal form. 0/3216 useless extension candidates. Maximal degree in co-relation 6713. Up to 2065 conditions per place. [2025-03-04 09:42:26,128 INFO L140 encePairwiseOnDemand]: 157/172 looper letters, 129 selfloop transitions, 14 changer transitions 0/170 dead transitions. [2025-03-04 09:42:26,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 170 transitions, 686 flow [2025-03-04 09:42:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:42:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 09:42:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1323 transitions. [2025-03-04 09:42:26,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5916815742397138 [2025-03-04 09:42:26,131 INFO L175 Difference]: Start difference. First operand has 108 places, 101 transitions, 252 flow. Second operand 13 states and 1323 transitions. [2025-03-04 09:42:26,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 170 transitions, 686 flow [2025-03-04 09:42:26,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 170 transitions, 666 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 09:42:26,133 INFO L231 Difference]: Finished difference. Result has 110 places, 98 transitions, 260 flow [2025-03-04 09:42:26,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=260, PETRI_PLACES=110, PETRI_TRANSITIONS=98} [2025-03-04 09:42:26,134 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -52 predicate places. [2025-03-04 09:42:26,134 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 98 transitions, 260 flow [2025-03-04 09:42:26,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 92.66666666666667) internal successors, (1390), 15 states have internal predecessors, (1390), 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:42:26,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:26,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:26,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:42:26,135 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:26,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:26,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1096243311, now seen corresponding path program 1 times [2025-03-04 09:42:26,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:26,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897731664] [2025-03-04 09:42:26,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:26,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:26,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 09:42:26,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 09:42:26,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:26,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:27,405 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:42:27,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:27,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897731664] [2025-03-04 09:42:27,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897731664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:27,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:27,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:42:27,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267630605] [2025-03-04 09:42:27,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:27,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:42:27,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:27,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:42:27,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:42:28,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 172 [2025-03-04 09:42:28,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 98 transitions, 260 flow. Second operand has 11 states, 11 states have (on average 76.63636363636364) internal successors, (843), 11 states have internal predecessors, (843), 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:42:28,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:28,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 172 [2025-03-04 09:42:28,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:28,588 INFO L124 PetriNetUnfolderBase]: 2375/4664 cut-off events. [2025-03-04 09:42:28,588 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-03-04 09:42:28,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9286 conditions, 4664 events. 2375/4664 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 27631 event pairs, 226 based on Foata normal form. 56/4467 useless extension candidates. Maximal degree in co-relation 9279. Up to 2173 conditions per place. [2025-03-04 09:42:28,601 INFO L140 encePairwiseOnDemand]: 157/172 looper letters, 154 selfloop transitions, 19 changer transitions 0/201 dead transitions. [2025-03-04 09:42:28,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 201 transitions, 851 flow [2025-03-04 09:42:28,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:42:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 09:42:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 982 transitions. [2025-03-04 09:42:28,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5190274841437632 [2025-03-04 09:42:28,603 INFO L175 Difference]: Start difference. First operand has 110 places, 98 transitions, 260 flow. Second operand 11 states and 982 transitions. [2025-03-04 09:42:28,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 201 transitions, 851 flow [2025-03-04 09:42:28,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 201 transitions, 827 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-03-04 09:42:28,606 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 346 flow [2025-03-04 09:42:28,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=346, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2025-03-04 09:42:28,607 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -49 predicate places. [2025-03-04 09:42:28,607 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 346 flow [2025-03-04 09:42:28,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 76.63636363636364) internal successors, (843), 11 states have internal predecessors, (843), 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:42:28,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:28,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:28,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:42:28,608 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:28,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:28,608 INFO L85 PathProgramCache]: Analyzing trace with hash 573709039, now seen corresponding path program 1 times [2025-03-04 09:42:28,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:28,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970456420] [2025-03-04 09:42:28,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:28,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:28,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 09:42:28,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 09:42:28,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:28,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:42:28,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:28,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970456420] [2025-03-04 09:42:28,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970456420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:28,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:28,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:42:28,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888235177] [2025-03-04 09:42:28,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:28,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:28,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:28,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:28,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:28,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-03-04 09:42:28,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:42:28,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:28,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-03-04 09:42:28,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:29,155 INFO L124 PetriNetUnfolderBase]: 3330/7329 cut-off events. [2025-03-04 09:42:29,155 INFO L125 PetriNetUnfolderBase]: For 1674/1740 co-relation queries the response was YES. [2025-03-04 09:42:29,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14796 conditions, 7329 events. 3330/7329 cut-off events. For 1674/1740 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 54336 event pairs, 1490 based on Foata normal form. 183/6957 useless extension candidates. Maximal degree in co-relation 14785. Up to 3220 conditions per place. [2025-03-04 09:42:29,179 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 127 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2025-03-04 09:42:29,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 167 transitions, 823 flow [2025-03-04 09:42:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2025-03-04 09:42:29,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7887596899224806 [2025-03-04 09:42:29,181 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 346 flow. Second operand 3 states and 407 transitions. [2025-03-04 09:42:29,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 167 transitions, 823 flow [2025-03-04 09:42:29,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 167 transitions, 788 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 09:42:29,185 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 338 flow [2025-03-04 09:42:29,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2025-03-04 09:42:29,186 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2025-03-04 09:42:29,186 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 338 flow [2025-03-04 09:42:29,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:42:29,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:29,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:29,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:42:29,186 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:29,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:29,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1254586864, now seen corresponding path program 1 times [2025-03-04 09:42:29,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:29,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170911854] [2025-03-04 09:42:29,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:29,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:29,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 09:42:29,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 09:42:29,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:29,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 09:42:29,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:29,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170911854] [2025-03-04 09:42:29,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170911854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:29,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:29,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:42:29,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816163540] [2025-03-04 09:42:29,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:29,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:42:29,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:29,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:42:29,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:42:29,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-03-04 09:42:29,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 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:42:29,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:29,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-03-04 09:42:29,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:30,226 INFO L124 PetriNetUnfolderBase]: 4187/8368 cut-off events. [2025-03-04 09:42:30,226 INFO L125 PetriNetUnfolderBase]: For 2332/2370 co-relation queries the response was YES. [2025-03-04 09:42:30,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18423 conditions, 8368 events. 4187/8368 cut-off events. For 2332/2370 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 58965 event pairs, 2277 based on Foata normal form. 92/7986 useless extension candidates. Maximal degree in co-relation 18410. Up to 5629 conditions per place. [2025-03-04 09:42:30,259 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 104 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2025-03-04 09:42:30,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 144 transitions, 667 flow [2025-03-04 09:42:30,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:42:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:42:30,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2025-03-04 09:42:30,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7093023255813954 [2025-03-04 09:42:30,260 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 338 flow. Second operand 4 states and 488 transitions. [2025-03-04 09:42:30,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 144 transitions, 667 flow [2025-03-04 09:42:30,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 144 transitions, 663 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:42:30,267 INFO L231 Difference]: Finished difference. Result has 114 places, 110 transitions, 352 flow [2025-03-04 09:42:30,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=114, PETRI_TRANSITIONS=110} [2025-03-04 09:42:30,267 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -48 predicate places. [2025-03-04 09:42:30,267 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 352 flow [2025-03-04 09:42:30,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 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:42:30,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:30,268 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:30,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:42:30,268 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:30,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:30,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1927667799, now seen corresponding path program 1 times [2025-03-04 09:42:30,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:30,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834479854] [2025-03-04 09:42:30,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:30,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:30,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:42:30,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:42:30,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:30,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 09:42:30,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:30,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834479854] [2025-03-04 09:42:30,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834479854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:30,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:30,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:42:30,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900059129] [2025-03-04 09:42:30,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:30,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:30,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:30,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:30,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:30,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-03-04 09:42:30,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:42:30,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:30,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-03-04 09:42:30,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:30,658 INFO L124 PetriNetUnfolderBase]: 2481/5250 cut-off events. [2025-03-04 09:42:30,658 INFO L125 PetriNetUnfolderBase]: For 1237/1237 co-relation queries the response was YES. [2025-03-04 09:42:30,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11266 conditions, 5250 events. 2481/5250 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 33856 event pairs, 1218 based on Foata normal form. 124/5126 useless extension candidates. Maximal degree in co-relation 11252. Up to 2282 conditions per place. [2025-03-04 09:42:30,674 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 80 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2025-03-04 09:42:30,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 119 transitions, 523 flow [2025-03-04 09:42:30,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-03-04 09:42:30,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7248062015503876 [2025-03-04 09:42:30,675 INFO L175 Difference]: Start difference. First operand has 114 places, 110 transitions, 352 flow. Second operand 3 states and 374 transitions. [2025-03-04 09:42:30,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 119 transitions, 523 flow [2025-03-04 09:42:30,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 119 transitions, 501 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 09:42:30,680 INFO L231 Difference]: Finished difference. Result has 111 places, 103 transitions, 304 flow [2025-03-04 09:42:30,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=111, PETRI_TRANSITIONS=103} [2025-03-04 09:42:30,680 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2025-03-04 09:42:30,680 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 304 flow [2025-03-04 09:42:30,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:42:30,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:30,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:30,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:42:30,681 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:30,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:30,681 INFO L85 PathProgramCache]: Analyzing trace with hash -678088190, now seen corresponding path program 1 times [2025-03-04 09:42:30,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:30,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531044824] [2025-03-04 09:42:30,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:30,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:30,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 09:42:30,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 09:42:30,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:30,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 09:42:31,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:31,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531044824] [2025-03-04 09:42:31,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531044824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:31,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:31,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:42:31,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391278482] [2025-03-04 09:42:31,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:31,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:31,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:31,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:31,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:42:31,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-03-04 09:42:31,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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:42:31,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:31,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-03-04 09:42:31,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:31,315 INFO L124 PetriNetUnfolderBase]: 1512/3602 cut-off events. [2025-03-04 09:42:31,315 INFO L125 PetriNetUnfolderBase]: For 1075/1075 co-relation queries the response was YES. [2025-03-04 09:42:31,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7826 conditions, 3602 events. 1512/3602 cut-off events. For 1075/1075 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 21560 event pairs, 368 based on Foata normal form. 218/3654 useless extension candidates. Maximal degree in co-relation 7813. Up to 1849 conditions per place. [2025-03-04 09:42:31,327 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 72 selfloop transitions, 6 changer transitions 0/116 dead transitions. [2025-03-04 09:42:31,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 116 transitions, 504 flow [2025-03-04 09:42:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:31,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:31,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-03-04 09:42:31,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7248062015503876 [2025-03-04 09:42:31,328 INFO L175 Difference]: Start difference. First operand has 111 places, 103 transitions, 304 flow. Second operand 3 states and 374 transitions. [2025-03-04 09:42:31,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 116 transitions, 504 flow [2025-03-04 09:42:31,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:42:31,331 INFO L231 Difference]: Finished difference. Result has 111 places, 103 transitions, 310 flow [2025-03-04 09:42:31,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=111, PETRI_TRANSITIONS=103} [2025-03-04 09:42:31,332 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2025-03-04 09:42:31,332 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 310 flow [2025-03-04 09:42:31,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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:42:31,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:31,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:31,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 09:42:31,332 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:31,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:31,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1268949368, now seen corresponding path program 1 times [2025-03-04 09:42:31,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:31,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410936391] [2025-03-04 09:42:31,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:31,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:31,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 09:42:31,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 09:42:31,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:31,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 09:42:31,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:31,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410936391] [2025-03-04 09:42:31,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410936391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:31,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:42:31,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:42:31,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424492200] [2025-03-04 09:42:31,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:31,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:42:31,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:31,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:42:31,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:42:32,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-03-04 09:42:32,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 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:42:32,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:32,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-03-04 09:42:32,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:32,368 INFO L124 PetriNetUnfolderBase]: 1512/3353 cut-off events. [2025-03-04 09:42:32,368 INFO L125 PetriNetUnfolderBase]: For 1228/1228 co-relation queries the response was YES. [2025-03-04 09:42:32,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7875 conditions, 3353 events. 1512/3353 cut-off events. For 1228/1228 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 18801 event pairs, 1021 based on Foata normal form. 126/3391 useless extension candidates. Maximal degree in co-relation 7862. Up to 2206 conditions per place. [2025-03-04 09:42:32,377 INFO L140 encePairwiseOnDemand]: 161/172 looper letters, 67 selfloop transitions, 4 changer transitions 0/101 dead transitions. [2025-03-04 09:42:32,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 101 transitions, 455 flow [2025-03-04 09:42:32,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:42:32,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:42:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2025-03-04 09:42:32,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6209302325581395 [2025-03-04 09:42:32,378 INFO L175 Difference]: Start difference. First operand has 111 places, 103 transitions, 310 flow. Second operand 5 states and 534 transitions. [2025-03-04 09:42:32,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 101 transitions, 455 flow [2025-03-04 09:42:32,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 101 transitions, 449 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:42:32,381 INFO L231 Difference]: Finished difference. Result has 107 places, 96 transitions, 298 flow [2025-03-04 09:42:32,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=107, PETRI_TRANSITIONS=96} [2025-03-04 09:42:32,382 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -55 predicate places. [2025-03-04 09:42:32,382 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 96 transitions, 298 flow [2025-03-04 09:42:32,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 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:42:32,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:32,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:32,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 09:42:32,382 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:32,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:32,383 INFO L85 PathProgramCache]: Analyzing trace with hash -387939339, now seen corresponding path program 1 times [2025-03-04 09:42:32,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:32,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768372601] [2025-03-04 09:42:32,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:32,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:32,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 09:42:32,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 09:42:32,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:32,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:32,469 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 09:42:32,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:32,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768372601] [2025-03-04 09:42:32,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768372601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:42:32,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323750454] [2025-03-04 09:42:32,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:32,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:42:32,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:42:32,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:42:32,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:42:32,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 09:42:32,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 09:42:32,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:32,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:32,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 1951 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 09:42:32,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:42:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 09:42:32,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:42:32,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323750454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:42:32,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 09:42:32,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-04 09:42:32,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336748176] [2025-03-04 09:42:32,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:42:32,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:42:32,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:42:32,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:42:32,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:42:32,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-03-04 09:42:32,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 96 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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:42:32,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:42:32,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-03-04 09:42:32,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:42:33,024 INFO L124 PetriNetUnfolderBase]: 1512/3356 cut-off events. [2025-03-04 09:42:33,024 INFO L125 PetriNetUnfolderBase]: For 1154/1154 co-relation queries the response was YES. [2025-03-04 09:42:33,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7762 conditions, 3356 events. 1512/3356 cut-off events. For 1154/1154 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 18831 event pairs, 1201 based on Foata normal form. 5/3259 useless extension candidates. Maximal degree in co-relation 7748. Up to 2625 conditions per place. [2025-03-04 09:42:33,031 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 63 selfloop transitions, 1 changer transitions 2/95 dead transitions. [2025-03-04 09:42:33,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 95 transitions, 426 flow [2025-03-04 09:42:33,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:42:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:42:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2025-03-04 09:42:33,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6937984496124031 [2025-03-04 09:42:33,032 INFO L175 Difference]: Start difference. First operand has 107 places, 96 transitions, 298 flow. Second operand 3 states and 358 transitions. [2025-03-04 09:42:33,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 95 transitions, 426 flow [2025-03-04 09:42:33,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 95 transitions, 418 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:42:33,034 INFO L231 Difference]: Finished difference. Result has 104 places, 93 transitions, 285 flow [2025-03-04 09:42:33,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=104, PETRI_TRANSITIONS=93} [2025-03-04 09:42:33,035 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -58 predicate places. [2025-03-04 09:42:33,035 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 93 transitions, 285 flow [2025-03-04 09:42:33,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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:42:33,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:42:33,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:42:33,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:42:33,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 09:42:33,235 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-04 09:42:33,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:42:33,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1520032443, now seen corresponding path program 1 times [2025-03-04 09:42:33,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:42:33,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730829046] [2025-03-04 09:42:33,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:33,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:42:33,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 09:42:33,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 09:42:33,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:33,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 09:42:34,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:42:34,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730829046] [2025-03-04 09:42:34,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730829046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:42:34,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596545239] [2025-03-04 09:42:34,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:42:34,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:42:34,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:42:34,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:42:34,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:42:34,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 09:42:34,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 09:42:34,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:42:34,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:42:34,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 2005 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-04 09:42:34,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:42:35,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:42:35,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 09:42:35,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:42:35,217 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 09:42:35,240 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2025-03-04 09:42:35,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2025-03-04 09:42:35,272 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 09:42:35,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2025-03-04 09:42:35,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-04 09:42:35,482 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-04 09:42:35,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2025-03-04 09:42:35,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 09:42:35,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-04 09:42:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:42:35,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:04,604 INFO L349 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2025-03-04 09:43:04,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 183 [2025-03-04 09:43:04,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:43:04,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 155 [2025-03-04 09:43:04,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 09:43:04,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:43:04,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 284 treesize of output 238 [2025-03-04 09:43:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:43:04,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596545239] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:04,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:04,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 16] total 39 [2025-03-04 09:43:04,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665846089] [2025-03-04 09:43:04,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:04,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 09:43:04,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:04,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 09:43:04,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1307, Unknown=7, NotChecked=0, Total=1560 [2025-03-04 09:43:08,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 09:43:12,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 09:43:17,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 09:43:21,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 09:43:25,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 09:43:29,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]