./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.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/goblint-regression/09-regions_09-arraylist.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 bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:00:34,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:00:34,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:00:34,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:00:34,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:00:34,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:00:34,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:00:34,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:00:34,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:00:34,100 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:00:34,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:00:34,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:00:34,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:00:34,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:00:34,100 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:00:34,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:00:34,100 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:00:34,101 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:00:34,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:34,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:00:34,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:00:34,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:00:34,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:00:34,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:00:34,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:00:34,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:00:34,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:00:34,102 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 -> bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa [2025-03-04 10:00:34,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:00:34,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:00:34,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:00:34,341 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:00:34,341 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:00:34,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i [2025-03-04 10:00:35,518 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b84c1dc6/9eae8862eb544e90ab4c4472e7f8c518/FLAG059a33687 [2025-03-04 10:00:35,828 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:00:35,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i [2025-03-04 10:00:35,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b84c1dc6/9eae8862eb544e90ab4c4472e7f8c518/FLAG059a33687 [2025-03-04 10:00:35,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b84c1dc6/9eae8862eb544e90ab4c4472e7f8c518 [2025-03-04 10:00:35,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:00:35,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:00:35,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:35,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:00:35,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:00:35,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:35" (1/1) ... [2025-03-04 10:00:35,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b979095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:35, skipping insertion in model container [2025-03-04 10:00:35,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:35" (1/1) ... [2025-03-04 10:00:35,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:00:36,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:36,224 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:00:36,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:36,333 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:00:36,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:36 WrapperNode [2025-03-04 10:00:36,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:36,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:36,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:00:36,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:00:36,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:36" (1/1) ... [2025-03-04 10:00:36,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:36" (1/1) ... [2025-03-04 10:00:36,367 INFO L138 Inliner]: procedures = 372, calls = 43, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 130 [2025-03-04 10:00:36,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:36,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:00:36,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:00:36,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:00:36,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:36" (1/1) ... [2025-03-04 10:00:36,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:36" (1/1) ... [2025-03-04 10:00:36,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:36" (1/1) ... [2025-03-04 10:00:36,394 INFO L175 MemorySlicer]: Split 33 memory accesses to 3 slices as follows [5, 14, 14]. 42 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [5, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-03-04 10:00:36,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:36" (1/1) ... [2025-03-04 10:00:36,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:36" (1/1) ... [2025-03-04 10:00:36,400 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:36" (1/1) ... [2025-03-04 10:00:36,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:36" (1/1) ... [2025-03-04 10:00:36,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:36" (1/1) ... [2025-03-04 10:00:36,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:36" (1/1) ... [2025-03-04 10:00:36,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:00:36,410 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:00:36,410 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:00:36,410 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:00:36,411 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:36" (1/1) ... [2025-03-04 10:00:36,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:36,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:36,441 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 10:00:36,444 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 10:00:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 10:00:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 10:00:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 10:00:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:00:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:00:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 10:00:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:00:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:00:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:00:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:00:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:00:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:00:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:00:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:00:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:00:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:00:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 10:00:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 10:00:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 10:00:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 10:00:36,460 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 10:00:36,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:00:36,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:00:36,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:00:36,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:00:36,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:00:36,462 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 10:00:36,573 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:00:36,575 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:00:36,901 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:00:36,901 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:00:37,051 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:00:37,054 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:00:37,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:37 BoogieIcfgContainer [2025-03-04 10:00:37,054 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:00:37,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:00:37,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:00:37,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:00:37,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:00:35" (1/3) ... [2025-03-04 10:00:37,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df857b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:37, skipping insertion in model container [2025-03-04 10:00:37,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:36" (2/3) ... [2025-03-04 10:00:37,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df857b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:37, skipping insertion in model container [2025-03-04 10:00:37,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:37" (3/3) ... [2025-03-04 10:00:37,062 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist.i [2025-03-04 10:00:37,076 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:00:37,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_09-arraylist.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 37 error locations. [2025-03-04 10:00:37,079 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:00:37,131 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 10:00:37,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 146 flow [2025-03-04 10:00:37,196 INFO L124 PetriNetUnfolderBase]: 1/70 cut-off events. [2025-03-04 10:00:37,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:37,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 283 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-03-04 10:00:37,201 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 71 transitions, 146 flow [2025-03-04 10:00:37,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 70 transitions, 143 flow [2025-03-04 10:00:37,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:00:37,221 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;@66a32640, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:00:37,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-04 10:00:37,225 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:00:37,225 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-04 10:00:37,225 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:37,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:37,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:00:37,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:37,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:37,229 INFO L85 PathProgramCache]: Analyzing trace with hash 411029, now seen corresponding path program 1 times [2025-03-04 10:00:37,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:37,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528610514] [2025-03-04 10:00:37,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:37,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:37,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:00:37,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:00:37,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:37,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:37,447 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 10:00:37,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:37,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528610514] [2025-03-04 10:00:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528610514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:37,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:37,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:37,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790714095] [2025-03-04 10:00:37,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:37,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:37,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:37,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:37,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:37,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2025-03-04 10:00:37,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 10:00:37,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:37,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2025-03-04 10:00:37,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:37,655 INFO L124 PetriNetUnfolderBase]: 64/261 cut-off events. [2025-03-04 10:00:37,655 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:37,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 261 events. 64/261 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1343 event pairs, 63 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 376. Up to 151 conditions per place. [2025-03-04 10:00:37,658 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 24 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-03-04 10:00:37,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 191 flow [2025-03-04 10:00:37,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-03-04 10:00:37,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2025-03-04 10:00:37,670 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 143 flow. Second operand 3 states and 149 transitions. [2025-03-04 10:00:37,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 191 flow [2025-03-04 10:00:37,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 66 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:37,675 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 142 flow [2025-03-04 10:00:37,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2025-03-04 10:00:37,680 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2025-03-04 10:00:37,680 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 142 flow [2025-03-04 10:00:37,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 10:00:37,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:37,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:00:37,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:00:37,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:37,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:37,681 INFO L85 PathProgramCache]: Analyzing trace with hash 411030, now seen corresponding path program 1 times [2025-03-04 10:00:37,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:37,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492085442] [2025-03-04 10:00:37,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:37,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:37,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:00:37,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:00:37,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:37,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:37,828 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 10:00:37,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:37,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492085442] [2025-03-04 10:00:37,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492085442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:37,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:37,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:37,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331094558] [2025-03-04 10:00:37,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:37,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:37,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:37,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:37,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:37,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 71 [2025-03-04 10:00:37,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:37,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:37,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 71 [2025-03-04 10:00:37,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:37,974 INFO L124 PetriNetUnfolderBase]: 64/257 cut-off events. [2025-03-04 10:00:37,974 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:00:37,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 257 events. 64/257 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1307 event pairs, 63 based on Foata normal form. 4/205 useless extension candidates. Maximal degree in co-relation 384. Up to 151 conditions per place. [2025-03-04 10:00:37,976 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 22 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2025-03-04 10:00:37,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 62 transitions, 186 flow [2025-03-04 10:00:37,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-03-04 10:00:37,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7183098591549296 [2025-03-04 10:00:37,979 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 142 flow. Second operand 3 states and 153 transitions. [2025-03-04 10:00:37,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 62 transitions, 186 flow [2025-03-04 10:00:37,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 62 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:37,980 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 134 flow [2025-03-04 10:00:37,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2025-03-04 10:00:37,980 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2025-03-04 10:00:37,981 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 134 flow [2025-03-04 10:00:37,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:37,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:37,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:00:37,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:00:37,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:37,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:37,981 INFO L85 PathProgramCache]: Analyzing trace with hash 395010210, now seen corresponding path program 1 times [2025-03-04 10:00:37,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:37,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622251335] [2025-03-04 10:00:37,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:37,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:37,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:00:38,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:00:38,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:38,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:38,131 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 10:00:38,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:38,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622251335] [2025-03-04 10:00:38,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622251335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:38,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:38,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:38,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88143396] [2025-03-04 10:00:38,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:38,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:00:38,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:38,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:00:38,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:00:38,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2025-03-04 10:00:38,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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 10:00:38,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:38,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2025-03-04 10:00:38,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:38,348 INFO L124 PetriNetUnfolderBase]: 73/279 cut-off events. [2025-03-04 10:00:38,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:38,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 279 events. 73/279 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1417 event pairs, 72 based on Foata normal form. 1/228 useless extension candidates. Maximal degree in co-relation 427. Up to 173 conditions per place. [2025-03-04 10:00:38,350 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 28 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2025-03-04 10:00:38,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 184 flow [2025-03-04 10:00:38,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-03-04 10:00:38,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2025-03-04 10:00:38,352 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 134 flow. Second operand 3 states and 147 transitions. [2025-03-04 10:00:38,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 184 flow [2025-03-04 10:00:38,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:38,353 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 120 flow [2025-03-04 10:00:38,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2025-03-04 10:00:38,354 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2025-03-04 10:00:38,354 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 120 flow [2025-03-04 10:00:38,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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 10:00:38,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:38,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:00:38,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:00:38,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:38,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:38,355 INFO L85 PathProgramCache]: Analyzing trace with hash 395010211, now seen corresponding path program 1 times [2025-03-04 10:00:38,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:38,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094262802] [2025-03-04 10:00:38,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:38,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:38,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:00:38,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:00:38,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:38,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:38,563 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 10:00:38,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:38,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094262802] [2025-03-04 10:00:38,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094262802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:38,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:38,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:00:38,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240421827] [2025-03-04 10:00:38,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:38,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:00:38,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:38,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:00:38,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:00:38,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 71 [2025-03-04 10:00:38,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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 10:00:38,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:38,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 71 [2025-03-04 10:00:38,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:38,816 INFO L124 PetriNetUnfolderBase]: 64/265 cut-off events. [2025-03-04 10:00:38,816 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:38,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 265 events. 64/265 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1250 event pairs, 63 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 426. Up to 155 conditions per place. [2025-03-04 10:00:38,820 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 29 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2025-03-04 10:00:38,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 204 flow [2025-03-04 10:00:38,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:00:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:00:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2025-03-04 10:00:38,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6267605633802817 [2025-03-04 10:00:38,822 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 120 flow. Second operand 4 states and 178 transitions. [2025-03-04 10:00:38,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 204 flow [2025-03-04 10:00:38,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 65 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:38,827 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 167 flow [2025-03-04 10:00:38,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2025-03-04 10:00:38,828 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2025-03-04 10:00:38,828 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 167 flow [2025-03-04 10:00:38,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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 10:00:38,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:38,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:38,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:00:38,829 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:38,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1398782427, now seen corresponding path program 1 times [2025-03-04 10:00:38,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:38,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352105783] [2025-03-04 10:00:38,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:38,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:38,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:00:38,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:00:38,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:38,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:39,061 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 10:00:39,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:39,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352105783] [2025-03-04 10:00:39,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352105783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:39,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:39,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:00:39,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133452298] [2025-03-04 10:00:39,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:39,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:00:39,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:39,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:00:39,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:00:39,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 71 [2025-03-04 10:00:39,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 167 flow. Second operand has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 7 states have internal predecessors, (261), 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 10:00:39,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:39,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 71 [2025-03-04 10:00:39,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:39,373 INFO L124 PetriNetUnfolderBase]: 64/261 cut-off events. [2025-03-04 10:00:39,374 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:00:39,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 261 events. 64/261 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1222 event pairs, 63 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 444. Up to 148 conditions per place. [2025-03-04 10:00:39,375 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 23 selfloop transitions, 11 changer transitions 0/61 dead transitions. [2025-03-04 10:00:39,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 61 transitions, 231 flow [2025-03-04 10:00:39,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:00:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:00:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 283 transitions. [2025-03-04 10:00:39,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5694164989939637 [2025-03-04 10:00:39,377 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 167 flow. Second operand 7 states and 283 transitions. [2025-03-04 10:00:39,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 61 transitions, 231 flow [2025-03-04 10:00:39,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 61 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:39,378 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 183 flow [2025-03-04 10:00:39,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=183, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2025-03-04 10:00:39,379 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2025-03-04 10:00:39,379 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 183 flow [2025-03-04 10:00:39,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 7 states have internal predecessors, (261), 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 10:00:39,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:39,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:39,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:00:39,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:39,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:39,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1398782426, now seen corresponding path program 1 times [2025-03-04 10:00:39,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:39,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347876457] [2025-03-04 10:00:39,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:39,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:39,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:00:39,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:00:39,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:39,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:39,634 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 10:00:39,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:39,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347876457] [2025-03-04 10:00:39,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347876457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:39,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:39,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:00:39,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747759229] [2025-03-04 10:00:39,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:39,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:00:39,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:39,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:00:39,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:00:39,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2025-03-04 10:00:39,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 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 10:00:39,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:39,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2025-03-04 10:00:39,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:39,917 INFO L124 PetriNetUnfolderBase]: 64/257 cut-off events. [2025-03-04 10:00:39,917 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-04 10:00:39,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 257 events. 64/257 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1194 event pairs, 63 based on Foata normal form. 2/213 useless extension candidates. Maximal degree in co-relation 445. Up to 148 conditions per place. [2025-03-04 10:00:39,918 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 20 selfloop transitions, 11 changer transitions 0/59 dead transitions. [2025-03-04 10:00:39,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 59 transitions, 241 flow [2025-03-04 10:00:39,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:00:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:00:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 301 transitions. [2025-03-04 10:00:39,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6056338028169014 [2025-03-04 10:00:39,920 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 183 flow. Second operand 7 states and 301 transitions. [2025-03-04 10:00:39,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 59 transitions, 241 flow [2025-03-04 10:00:39,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 59 transitions, 219 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:00:39,921 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 179 flow [2025-03-04 10:00:39,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=179, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2025-03-04 10:00:39,922 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2025-03-04 10:00:39,922 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 179 flow [2025-03-04 10:00:39,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 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 10:00:39,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:39,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:39,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:00:39,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:39,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:39,923 INFO L85 PathProgramCache]: Analyzing trace with hash 94865657, now seen corresponding path program 1 times [2025-03-04 10:00:39,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:39,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020003819] [2025-03-04 10:00:39,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:39,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:00:39,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:00:39,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:39,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:40,008 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 10:00:40,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:40,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020003819] [2025-03-04 10:00:40,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020003819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:40,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:40,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:40,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210509919] [2025-03-04 10:00:40,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:40,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:00:40,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:40,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:00:40,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:00:40,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2025-03-04 10:00:40,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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 10:00:40,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:40,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2025-03-04 10:00:40,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:40,210 INFO L124 PetriNetUnfolderBase]: 64/255 cut-off events. [2025-03-04 10:00:40,210 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 10:00:40,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 255 events. 64/255 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1184 event pairs, 63 based on Foata normal form. 2/213 useless extension candidates. Maximal degree in co-relation 447. Up to 150 conditions per place. [2025-03-04 10:00:40,212 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 22 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2025-03-04 10:00:40,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 58 transitions, 243 flow [2025-03-04 10:00:40,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:00:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:00:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2025-03-04 10:00:40,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6169014084507042 [2025-03-04 10:00:40,213 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 179 flow. Second operand 5 states and 219 transitions. [2025-03-04 10:00:40,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 58 transitions, 243 flow [2025-03-04 10:00:40,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 221 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:00:40,214 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 177 flow [2025-03-04 10:00:40,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2025-03-04 10:00:40,215 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2025-03-04 10:00:40,215 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 177 flow [2025-03-04 10:00:40,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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 10:00:40,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:40,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:40,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:00:40,215 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:40,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash 94865658, now seen corresponding path program 1 times [2025-03-04 10:00:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:40,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36273542] [2025-03-04 10:00:40,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:40,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:40,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:00:40,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:00:40,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:40,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:40,367 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 10:00:40,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:40,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36273542] [2025-03-04 10:00:40,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36273542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:40,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:40,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:40,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380084886] [2025-03-04 10:00:40,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:40,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:00:40,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:40,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:00:40,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:00:40,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2025-03-04 10:00:40,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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 10:00:40,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:40,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2025-03-04 10:00:40,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:40,570 INFO L124 PetriNetUnfolderBase]: 64/253 cut-off events. [2025-03-04 10:00:40,570 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-04 10:00:40,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 253 events. 64/253 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1177 event pairs, 63 based on Foata normal form. 2/211 useless extension candidates. Maximal degree in co-relation 441. Up to 150 conditions per place. [2025-03-04 10:00:40,571 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 20 selfloop transitions, 11 changer transitions 0/57 dead transitions. [2025-03-04 10:00:40,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 57 transitions, 237 flow [2025-03-04 10:00:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:00:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:00:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2025-03-04 10:00:40,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6394366197183099 [2025-03-04 10:00:40,572 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 177 flow. Second operand 5 states and 227 transitions. [2025-03-04 10:00:40,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 57 transitions, 237 flow [2025-03-04 10:00:40,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 215 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:00:40,574 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 175 flow [2025-03-04 10:00:40,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2025-03-04 10:00:40,574 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2025-03-04 10:00:40,574 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 175 flow [2025-03-04 10:00:40,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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 10:00:40,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:40,574 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:40,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:00:40,575 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:40,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:40,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1696187006, now seen corresponding path program 1 times [2025-03-04 10:00:40,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:40,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440037547] [2025-03-04 10:00:40,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:40,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:40,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:00:40,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:00:40,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:40,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:40,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:40,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440037547] [2025-03-04 10:00:40,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440037547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:40,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635902022] [2025-03-04 10:00:40,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:40,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:40,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:40,827 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 10:00:40,835 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 10:00:40,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:00:40,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:00:40,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:40,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:40,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 10:00:40,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:41,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:41,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:00:41,078 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:00:41,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:00:41,106 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:00:41,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-03-04 10:00:41,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:41,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:00:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:41,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:41,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:41,460 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 43 treesize of output 61 [2025-03-04 10:00:41,540 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:00:41,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2025-03-04 10:00:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:41,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635902022] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:41,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:41,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 16 [2025-03-04 10:00:41,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229822683] [2025-03-04 10:00:41,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:41,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:00:41,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:41,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:00:41,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:00:42,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 71 [2025-03-04 10:00:42,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 175 flow. Second operand has 18 states, 18 states have (on average 35.833333333333336) internal successors, (645), 18 states have internal predecessors, (645), 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 10:00:42,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:42,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 71 [2025-03-04 10:00:42,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:43,329 INFO L124 PetriNetUnfolderBase]: 75/308 cut-off events. [2025-03-04 10:00:43,330 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-04 10:00:43,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 308 events. 75/308 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1442 event pairs, 72 based on Foata normal form. 7/267 useless extension candidates. Maximal degree in co-relation 564. Up to 170 conditions per place. [2025-03-04 10:00:43,331 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 38 selfloop transitions, 16 changer transitions 0/77 dead transitions. [2025-03-04 10:00:43,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 383 flow [2025-03-04 10:00:43,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:00:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:00:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 367 transitions. [2025-03-04 10:00:43,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5743348982785602 [2025-03-04 10:00:43,334 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 175 flow. Second operand 9 states and 367 transitions. [2025-03-04 10:00:43,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 383 flow [2025-03-04 10:00:43,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 77 transitions, 329 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:00:43,336 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 257 flow [2025-03-04 10:00:43,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=257, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-03-04 10:00:43,336 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2025-03-04 10:00:43,336 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 257 flow [2025-03-04 10:00:43,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 35.833333333333336) internal successors, (645), 18 states have internal predecessors, (645), 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 10:00:43,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:43,339 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:43,347 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 10:00:43,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:43,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:43,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:43,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1617620548, now seen corresponding path program 1 times [2025-03-04 10:00:43,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:43,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236008909] [2025-03-04 10:00:43,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:43,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:00:43,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:00:43,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:43,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:43,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:43,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236008909] [2025-03-04 10:00:43,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236008909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:43,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057960403] [2025-03-04 10:00:43,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:43,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:43,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:43,645 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 10:00:43,645 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 10:00:43,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:00:43,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:00:43,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:43,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:43,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:00:43,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:43,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:43,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057960403] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:43,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:43,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 10:00:43,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577954508] [2025-03-04 10:00:43,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:43,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:00:43,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:43,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:00:43,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:00:43,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2025-03-04 10:00:43,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 257 flow. Second operand has 9 states, 9 states have (on average 49.77777777777778) internal successors, (448), 9 states have internal predecessors, (448), 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 10:00:43,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:43,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2025-03-04 10:00:43,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:44,016 INFO L124 PetriNetUnfolderBase]: 64/294 cut-off events. [2025-03-04 10:00:44,016 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-03-04 10:00:44,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 294 events. 64/294 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1097 event pairs, 63 based on Foata normal form. 4/254 useless extension candidates. Maximal degree in co-relation 571. Up to 146 conditions per place. [2025-03-04 10:00:44,017 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 54 selfloop transitions, 8 changer transitions 0/87 dead transitions. [2025-03-04 10:00:44,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 87 transitions, 477 flow [2025-03-04 10:00:44,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:00:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:00:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 426 transitions. [2025-03-04 10:00:44,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-04 10:00:44,019 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 257 flow. Second operand 8 states and 426 transitions. [2025-03-04 10:00:44,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 87 transitions, 477 flow [2025-03-04 10:00:44,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 87 transitions, 457 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:44,022 INFO L231 Difference]: Finished difference. Result has 79 places, 66 transitions, 273 flow [2025-03-04 10:00:44,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=273, PETRI_PLACES=79, PETRI_TRANSITIONS=66} [2025-03-04 10:00:44,023 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2025-03-04 10:00:44,023 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 66 transitions, 273 flow [2025-03-04 10:00:44,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 49.77777777777778) internal successors, (448), 9 states have internal predecessors, (448), 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 10:00:44,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:44,023 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-03-04 10:00:44,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:00:44,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 10:00:44,224 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:44,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:44,225 INFO L85 PathProgramCache]: Analyzing trace with hash 252159375, now seen corresponding path program 2 times [2025-03-04 10:00:44,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:44,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801355326] [2025-03-04 10:00:44,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:44,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:44,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 10:00:44,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:00:44,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:00:44,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:45,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:45,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801355326] [2025-03-04 10:00:45,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801355326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:45,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403966643] [2025-03-04 10:00:45,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:45,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:45,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:45,612 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:00:45,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:00:45,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 10:00:45,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:00:45,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:00:45,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:45,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-04 10:00:45,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:45,866 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:00:45,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:00:45,880 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:00:45,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-03-04 10:00:45,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:45,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:00:45,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:00:46,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:46,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:00:46,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:46,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:00:46,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:46,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:00:46,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:46,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:00:46,385 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:00:46,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-03-04 10:00:46,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:00:46,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:00:46,491 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:00:46,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:00:46,508 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:00:46,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-03-04 10:00:46,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:00:46,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:00:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:46,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:46,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:46,963 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 43 treesize of output 61 [2025-03-04 10:00:47,053 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:00:47,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2025-03-04 10:00:47,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:47,236 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 43 treesize of output 61 [2025-03-04 10:00:47,305 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:00:47,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2025-03-04 10:00:47,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:47,496 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 43 treesize of output 61 [2025-03-04 10:00:47,576 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:00:47,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2025-03-04 10:00:47,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:00:47,754 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 43 treesize of output 61 [2025-03-04 10:00:47,823 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:00:47,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2025-03-04 10:00:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:47,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403966643] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:47,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:47,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 10] total 41 [2025-03-04 10:00:47,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040178830] [2025-03-04 10:00:47,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:47,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 10:00:47,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:47,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 10:00:47,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1490, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 10:00:54,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 71 [2025-03-04 10:00:54,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 66 transitions, 273 flow. Second operand has 43 states, 43 states have (on average 36.23255813953488) internal successors, (1558), 43 states have internal predecessors, (1558), 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 10:00:54,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:54,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 71 [2025-03-04 10:00:54,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:56,076 INFO L124 PetriNetUnfolderBase]: 77/370 cut-off events. [2025-03-04 10:00:56,077 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2025-03-04 10:00:56,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 370 events. 77/370 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1454 event pairs, 72 based on Foata normal form. 6/328 useless extension candidates. Maximal degree in co-relation 789. Up to 172 conditions per place. [2025-03-04 10:00:56,079 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 70 selfloop transitions, 28 changer transitions 0/121 dead transitions. [2025-03-04 10:00:56,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 121 transitions, 803 flow [2025-03-04 10:00:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:00:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:00:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 750 transitions. [2025-03-04 10:00:56,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5559673832468495 [2025-03-04 10:00:56,085 INFO L175 Difference]: Start difference. First operand has 79 places, 66 transitions, 273 flow. Second operand 19 states and 750 transitions. [2025-03-04 10:00:56,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 121 transitions, 803 flow [2025-03-04 10:00:56,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 121 transitions, 787 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 10:00:56,088 INFO L231 Difference]: Finished difference. Result has 105 places, 79 transitions, 501 flow [2025-03-04 10:00:56,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=501, PETRI_PLACES=105, PETRI_TRANSITIONS=79} [2025-03-04 10:00:56,090 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 32 predicate places. [2025-03-04 10:00:56,090 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 79 transitions, 501 flow [2025-03-04 10:00:56,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 36.23255813953488) internal successors, (1558), 43 states have internal predecessors, (1558), 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 10:00:56,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:56,091 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:56,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:00:56,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:56,296 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:56,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:56,296 INFO L85 PathProgramCache]: Analyzing trace with hash 612343208, now seen corresponding path program 2 times [2025-03-04 10:00:56,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:56,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104239266] [2025-03-04 10:00:56,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:56,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:56,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-04 10:00:56,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 10:00:56,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:00:56,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:56,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:56,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104239266] [2025-03-04 10:00:56,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104239266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:56,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909744639] [2025-03-04 10:00:56,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:56,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:56,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:56,583 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:00:56,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:00:56,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-04 10:00:56,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 10:00:56,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:00:56,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:56,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:00:56,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:56,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:56,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909744639] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:56,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:56,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-04 10:00:56,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275025786] [2025-03-04 10:00:56,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:56,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:00:56,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:56,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:00:56,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:00:57,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2025-03-04 10:00:57,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 79 transitions, 501 flow. Second operand has 13 states, 13 states have (on average 51.0) internal successors, (663), 13 states have internal predecessors, (663), 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 10:00:57,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:57,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2025-03-04 10:00:57,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:57,175 INFO L124 PetriNetUnfolderBase]: 64/336 cut-off events. [2025-03-04 10:00:57,175 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2025-03-04 10:00:57,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 336 events. 64/336 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1100 event pairs, 63 based on Foata normal form. 4/296 useless extension candidates. Maximal degree in co-relation 774. Up to 146 conditions per place. [2025-03-04 10:00:57,177 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 79 selfloop transitions, 12 changer transitions 0/116 dead transitions. [2025-03-04 10:00:57,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 116 transitions, 861 flow [2025-03-04 10:00:57,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:00:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:00:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 634 transitions. [2025-03-04 10:00:57,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.744131455399061 [2025-03-04 10:00:57,179 INFO L175 Difference]: Start difference. First operand has 105 places, 79 transitions, 501 flow. Second operand 12 states and 634 transitions. [2025-03-04 10:00:57,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 116 transitions, 861 flow [2025-03-04 10:00:57,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 116 transitions, 813 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-03-04 10:00:57,184 INFO L231 Difference]: Finished difference. Result has 110 places, 76 transitions, 434 flow [2025-03-04 10:00:57,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=434, PETRI_PLACES=110, PETRI_TRANSITIONS=76} [2025-03-04 10:00:57,186 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 37 predicate places. [2025-03-04 10:00:57,186 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 76 transitions, 434 flow [2025-03-04 10:00:57,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.0) internal successors, (663), 13 states have internal predecessors, (663), 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 10:00:57,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:57,186 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2025-03-04 10:00:57,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:00:57,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:57,391 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:00:57,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:57,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1731551119, now seen corresponding path program 3 times [2025-03-04 10:00:57,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:57,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189326210] [2025-03-04 10:00:57,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:00:57,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:57,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes. [2025-03-04 10:00:57,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 10:00:57,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:00:57,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:58,353 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 399 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:58,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:58,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189326210] [2025-03-04 10:00:58,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189326210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:58,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178224418] [2025-03-04 10:00:58,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:00:58,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:58,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:58,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:00:58,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:00:58,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes.