./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.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 b018c23c1a90f89310fc4f08bf16b02660af5a398ccd47f63d319e7a234c112b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:13:41,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:13:41,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:13:41,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:13:41,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:13:41,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:13:41,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:13:41,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:13:41,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:13:41,452 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:13:41,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:13:41,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:13:41,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:13:41,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:13:41,454 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:13:41,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:13:41,454 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:13:41,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:13:41,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:13:41,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:13:41,454 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:13:41,455 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:13:41,455 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:13:41,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:13:41,455 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:13:41,455 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:13:41,455 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:13:41,455 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:13:41,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:13:41,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:13:41,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:13:41,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:13:41,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:13:41,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:41,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:13:41,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:13:41,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:13:41,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:13:41,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:13:41,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:13:41,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:13:41,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:13:41,456 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 -> b018c23c1a90f89310fc4f08bf16b02660af5a398ccd47f63d319e7a234c112b [2025-03-09 01:13:41,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:13:41,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:13:41,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:13:41,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:13:41,706 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:13:41,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-03-09 01:13:42,933 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439a53f70/3651c200819f4f2284e28aa97ae1500e/FLAG24ef4b918 [2025-03-09 01:13:43,293 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:13:43,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-03-09 01:13:43,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439a53f70/3651c200819f4f2284e28aa97ae1500e/FLAG24ef4b918 [2025-03-09 01:13:43,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439a53f70/3651c200819f4f2284e28aa97ae1500e [2025-03-09 01:13:43,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:13:43,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:13:43,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:43,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:13:43,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:13:43,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:43" (1/1) ... [2025-03-09 01:13:43,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c65b47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:43, skipping insertion in model container [2025-03-09 01:13:43,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:43" (1/1) ... [2025-03-09 01:13:43,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:13:43,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:44,015 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:13:44,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:44,107 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:13:44,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44 WrapperNode [2025-03-09 01:13:44,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:44,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:44,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:13:44,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:13:44,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44" (1/1) ... [2025-03-09 01:13:44,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44" (1/1) ... [2025-03-09 01:13:44,153 INFO L138 Inliner]: procedures = 372, calls = 95, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 226 [2025-03-09 01:13:44,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:44,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:13:44,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:13:44,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:13:44,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44" (1/1) ... [2025-03-09 01:13:44,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44" (1/1) ... [2025-03-09 01:13:44,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44" (1/1) ... [2025-03-09 01:13:44,189 INFO L175 MemorySlicer]: Split 90 memory accesses to 3 slices as follows [50, 16, 24]. 56 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 19 writes are split as follows [0, 1, 18]. [2025-03-09 01:13:44,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44" (1/1) ... [2025-03-09 01:13:44,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44" (1/1) ... [2025-03-09 01:13:44,205 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44" (1/1) ... [2025-03-09 01:13:44,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44" (1/1) ... [2025-03-09 01:13:44,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44" (1/1) ... [2025-03-09 01:13:44,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44" (1/1) ... [2025-03-09 01:13:44,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:13:44,217 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:13:44,217 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:13:44,217 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:13:44,218 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44" (1/1) ... [2025-03-09 01:13:44,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:44,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:44,247 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:13:44,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:13:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:13:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:13:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 01:13:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 01:13:44,268 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 01:13:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:13:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:13:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:13:44,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:13:44,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:13:44,272 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:13:44,399 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:13:44,400 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:13:44,898 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:13:44,898 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:13:45,200 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:13:45,200 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:13:45,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:45 BoogieIcfgContainer [2025-03-09 01:13:45,201 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:13:45,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:13:45,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:13:45,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:13:45,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:13:43" (1/3) ... [2025-03-09 01:13:45,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ed2995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:45, skipping insertion in model container [2025-03-09 01:13:45,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44" (2/3) ... [2025-03-09 01:13:45,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ed2995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:45, skipping insertion in model container [2025-03-09 01:13:45,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:45" (3/3) ... [2025-03-09 01:13:45,207 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr.i [2025-03-09 01:13:45,219 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:13:45,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_13-arraycollapse_nr.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 61 error locations. [2025-03-09 01:13:45,221 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:13:45,270 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:13:45,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 107 transitions, 218 flow [2025-03-09 01:13:45,338 INFO L124 PetriNetUnfolderBase]: 1/106 cut-off events. [2025-03-09 01:13:45,339 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:45,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 106 events. 1/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2025-03-09 01:13:45,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 107 transitions, 218 flow [2025-03-09 01:13:45,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 106 transitions, 215 flow [2025-03-09 01:13:45,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:13:45,365 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;@4635e538, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:13:45,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-03-09 01:13:45,371 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:13:45,372 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-09 01:13:45,372 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:45,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:45,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:13:45,373 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-09 01:13:45,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash 685641, now seen corresponding path program 1 times [2025-03-09 01:13:45,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:45,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135316771] [2025-03-09 01:13:45,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:45,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:45,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:13:45,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:13:45,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:45,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:45,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:45,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135316771] [2025-03-09 01:13:45,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135316771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:45,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:45,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:45,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172761559] [2025-03-09 01:13:45,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:45,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:45,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:45,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:45,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 107 [2025-03-09 01:13:45,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 106 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:45,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:45,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 107 [2025-03-09 01:13:45,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:45,968 INFO L124 PetriNetUnfolderBase]: 64/293 cut-off events. [2025-03-09 01:13:45,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:45,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 293 events. 64/293 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1326 event pairs, 63 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 376. Up to 157 conditions per place. [2025-03-09 01:13:45,971 INFO L140 encePairwiseOnDemand]: 91/107 looper letters, 30 selfloop transitions, 8 changer transitions 0/98 dead transitions. [2025-03-09 01:13:45,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 98 transitions, 275 flow [2025-03-09 01:13:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2025-03-09 01:13:45,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7133956386292835 [2025-03-09 01:13:45,986 INFO L175 Difference]: Start difference. First operand has 109 places, 106 transitions, 215 flow. Second operand 3 states and 229 transitions. [2025-03-09 01:13:45,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 98 transitions, 275 flow [2025-03-09 01:13:45,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 98 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:45,993 INFO L231 Difference]: Finished difference. Result has 102 places, 98 transitions, 214 flow [2025-03-09 01:13:46,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=102, PETRI_TRANSITIONS=98} [2025-03-09 01:13:46,021 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -7 predicate places. [2025-03-09 01:13:46,021 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 98 transitions, 214 flow [2025-03-09 01:13:46,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:46,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:46,021 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:13:46,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:13:46,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-09 01:13:46,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:46,023 INFO L85 PathProgramCache]: Analyzing trace with hash 685642, now seen corresponding path program 1 times [2025-03-09 01:13:46,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:46,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273891047] [2025-03-09 01:13:46,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:46,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:46,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:13:46,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:13:46,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:46,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:46,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:46,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273891047] [2025-03-09 01:13:46,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273891047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:46,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:46,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:46,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460803801] [2025-03-09 01:13:46,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:46,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:46,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:46,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:46,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:46,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 107 [2025-03-09 01:13:46,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 98 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:46,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:46,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 107 [2025-03-09 01:13:46,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:46,408 INFO L124 PetriNetUnfolderBase]: 64/285 cut-off events. [2025-03-09 01:13:46,409 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-09 01:13:46,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 285 events. 64/285 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1286 event pairs, 63 based on Foata normal form. 8/226 useless extension candidates. Maximal degree in co-relation 395. Up to 157 conditions per place. [2025-03-09 01:13:46,411 INFO L140 encePairwiseOnDemand]: 91/107 looper letters, 26 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2025-03-09 01:13:46,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 266 flow [2025-03-09 01:13:46,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2025-03-09 01:13:46,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7383177570093458 [2025-03-09 01:13:46,413 INFO L175 Difference]: Start difference. First operand has 102 places, 98 transitions, 214 flow. Second operand 3 states and 237 transitions. [2025-03-09 01:13:46,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 266 flow [2025-03-09 01:13:46,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:46,414 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 198 flow [2025-03-09 01:13:46,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2025-03-09 01:13:46,415 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -15 predicate places. [2025-03-09 01:13:46,415 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 198 flow [2025-03-09 01:13:46,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:46,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:46,415 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:13:46,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:13:46,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-09 01:13:46,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash 658921911, now seen corresponding path program 1 times [2025-03-09 01:13:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:46,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169664267] [2025-03-09 01:13:46,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:46,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:13:46,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:13:46,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:46,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:46,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:46,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169664267] [2025-03-09 01:13:46,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169664267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:46,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:46,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:13:46,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541312122] [2025-03-09 01:13:46,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:46,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:13:46,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:46,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:13:46,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:13:46,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 107 [2025-03-09 01:13:46,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:46,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:46,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 107 [2025-03-09 01:13:46,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:46,893 INFO L124 PetriNetUnfolderBase]: 73/305 cut-off events. [2025-03-09 01:13:46,893 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:13:46,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 305 events. 73/305 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1391 event pairs, 72 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 437. Up to 183 conditions per place. [2025-03-09 01:13:46,897 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 38 selfloop transitions, 1 changer transitions 0/84 dead transitions. [2025-03-09 01:13:46,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 84 transitions, 264 flow [2025-03-09 01:13:46,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 231 transitions. [2025-03-09 01:13:46,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.719626168224299 [2025-03-09 01:13:46,898 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 198 flow. Second operand 3 states and 231 transitions. [2025-03-09 01:13:46,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 84 transitions, 264 flow [2025-03-09 01:13:46,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 84 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:46,900 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 172 flow [2025-03-09 01:13:46,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2025-03-09 01:13:46,902 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -21 predicate places. [2025-03-09 01:13:46,902 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 172 flow [2025-03-09 01:13:46,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:46,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:46,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:13:46,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:13:46,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-09 01:13:46,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:46,904 INFO L85 PathProgramCache]: Analyzing trace with hash 658921912, now seen corresponding path program 1 times [2025-03-09 01:13:46,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:46,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612566779] [2025-03-09 01:13:46,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:46,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:46,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:13:46,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:13:46,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:46,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:47,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612566779] [2025-03-09 01:13:47,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612566779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:47,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:47,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:13:47,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454063674] [2025-03-09 01:13:47,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:47,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:13:47,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:47,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:13:47,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:13:47,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 107 [2025-03-09 01:13:47,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:47,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:47,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 107 [2025-03-09 01:13:47,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:47,404 INFO L124 PetriNetUnfolderBase]: 64/291 cut-off events. [2025-03-09 01:13:47,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:47,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 291 events. 64/291 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1217 event pairs, 63 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 460. Up to 163 conditions per place. [2025-03-09 01:13:47,408 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 37 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2025-03-09 01:13:47,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 91 transitions, 272 flow [2025-03-09 01:13:47,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:13:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:13:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 274 transitions. [2025-03-09 01:13:47,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6401869158878505 [2025-03-09 01:13:47,410 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 172 flow. Second operand 4 states and 274 transitions. [2025-03-09 01:13:47,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 91 transitions, 272 flow [2025-03-09 01:13:47,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 91 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:47,416 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 219 flow [2025-03-09 01:13:47,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2025-03-09 01:13:47,417 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -17 predicate places. [2025-03-09 01:13:47,417 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 219 flow [2025-03-09 01:13:47,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:47,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:47,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:47,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:13:47,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-09 01:13:47,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash 96230033, now seen corresponding path program 1 times [2025-03-09 01:13:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:47,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95910377] [2025-03-09 01:13:47,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:47,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:47,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:13:47,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:13:47,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:47,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:47,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:47,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95910377] [2025-03-09 01:13:47,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95910377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:47,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:47,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:13:47,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495555982] [2025-03-09 01:13:47,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:47,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:13:47,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:47,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:13:47,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:13:48,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 107 [2025-03-09 01:13:48,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 219 flow. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:48,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:48,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 107 [2025-03-09 01:13:48,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:48,197 INFO L124 PetriNetUnfolderBase]: 64/285 cut-off events. [2025-03-09 01:13:48,198 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:13:48,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 285 events. 64/285 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1182 event pairs, 63 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 482. Up to 154 conditions per place. [2025-03-09 01:13:48,200 INFO L140 encePairwiseOnDemand]: 90/107 looper letters, 30 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2025-03-09 01:13:48,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 85 transitions, 307 flow [2025-03-09 01:13:48,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:13:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:13:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 463 transitions. [2025-03-09 01:13:48,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5408878504672897 [2025-03-09 01:13:48,204 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 219 flow. Second operand 8 states and 463 transitions. [2025-03-09 01:13:48,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 85 transitions, 307 flow [2025-03-09 01:13:48,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 85 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:48,207 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 245 flow [2025-03-09 01:13:48,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=245, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2025-03-09 01:13:48,208 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -15 predicate places. [2025-03-09 01:13:48,208 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 245 flow [2025-03-09 01:13:48,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:48,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:48,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:48,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:13:48,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-09 01:13:48,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:48,209 INFO L85 PathProgramCache]: Analyzing trace with hash 96230034, now seen corresponding path program 1 times [2025-03-09 01:13:48,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:48,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461164750] [2025-03-09 01:13:48,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:48,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:48,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:13:48,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:13:48,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:48,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:48,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461164750] [2025-03-09 01:13:48,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461164750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:48,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:48,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:13:48,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070910839] [2025-03-09 01:13:48,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:48,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:13:48,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:48,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:13:48,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:13:49,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 107 [2025-03-09 01:13:49,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:49,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:49,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 107 [2025-03-09 01:13:49,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:49,171 INFO L124 PetriNetUnfolderBase]: 64/281 cut-off events. [2025-03-09 01:13:49,172 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-09 01:13:49,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 281 events. 64/281 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1187 event pairs, 63 based on Foata normal form. 2/234 useless extension candidates. Maximal degree in co-relation 494. Up to 158 conditions per place. [2025-03-09 01:13:49,173 INFO L140 encePairwiseOnDemand]: 95/107 looper letters, 32 selfloop transitions, 15 changer transitions 0/83 dead transitions. [2025-03-09 01:13:49,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 83 transitions, 335 flow [2025-03-09 01:13:49,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:13:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:13:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 373 transitions. [2025-03-09 01:13:49,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4979973297730307 [2025-03-09 01:13:49,175 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 245 flow. Second operand 7 states and 373 transitions. [2025-03-09 01:13:49,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 83 transitions, 335 flow [2025-03-09 01:13:49,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 83 transitions, 299 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-09 01:13:49,178 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 235 flow [2025-03-09 01:13:49,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2025-03-09 01:13:49,179 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -18 predicate places. [2025-03-09 01:13:49,180 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 235 flow [2025-03-09 01:13:49,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:49,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:49,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:49,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:13:49,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-09 01:13:49,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:49,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2012196690, now seen corresponding path program 1 times [2025-03-09 01:13:49,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:49,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270237081] [2025-03-09 01:13:49,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:49,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:49,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:13:49,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:13:49,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:49,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:49,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:49,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270237081] [2025-03-09 01:13:49,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270237081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:49,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:49,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:13:49,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944681140] [2025-03-09 01:13:49,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:49,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:13:49,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:49,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:13:49,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:13:49,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 107 [2025-03-09 01:13:49,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:49,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:49,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 107 [2025-03-09 01:13:49,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:49,542 INFO L124 PetriNetUnfolderBase]: 64/279 cut-off events. [2025-03-09 01:13:49,542 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 01:13:49,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 279 events. 64/279 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1171 event pairs, 63 based on Foata normal form. 2/231 useless extension candidates. Maximal degree in co-relation 487. Up to 158 conditions per place. [2025-03-09 01:13:49,543 INFO L140 encePairwiseOnDemand]: 96/107 looper letters, 30 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2025-03-09 01:13:49,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 82 transitions, 323 flow [2025-03-09 01:13:49,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:13:49,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:13:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 331 transitions. [2025-03-09 01:13:49,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6186915887850467 [2025-03-09 01:13:49,547 INFO L175 Difference]: Start difference. First operand has 91 places, 83 transitions, 235 flow. Second operand 5 states and 331 transitions. [2025-03-09 01:13:49,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 82 transitions, 323 flow [2025-03-09 01:13:49,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 82 transitions, 293 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:13:49,550 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 233 flow [2025-03-09 01:13:49,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2025-03-09 01:13:49,553 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -21 predicate places. [2025-03-09 01:13:49,553 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 233 flow [2025-03-09 01:13:49,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:49,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:49,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:49,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:13:49,554 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-09 01:13:49,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:49,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2012196689, now seen corresponding path program 1 times [2025-03-09 01:13:49,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:49,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067462214] [2025-03-09 01:13:49,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:49,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:49,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:13:49,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:13:49,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:49,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:49,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:49,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067462214] [2025-03-09 01:13:49,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067462214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:49,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:49,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:13:49,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822631428] [2025-03-09 01:13:49,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:49,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:13:49,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:49,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:13:49,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:13:49,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 107 [2025-03-09 01:13:49,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:49,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:49,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 107 [2025-03-09 01:13:49,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:50,040 INFO L124 PetriNetUnfolderBase]: 64/277 cut-off events. [2025-03-09 01:13:50,040 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-09 01:13:50,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 277 events. 64/277 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1169 event pairs, 63 based on Foata normal form. 2/229 useless extension candidates. Maximal degree in co-relation 479. Up to 158 conditions per place. [2025-03-09 01:13:50,042 INFO L140 encePairwiseOnDemand]: 96/107 looper letters, 26 selfloop transitions, 15 changer transitions 0/81 dead transitions. [2025-03-09 01:13:50,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 81 transitions, 313 flow [2025-03-09 01:13:50,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:13:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:13:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 347 transitions. [2025-03-09 01:13:50,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6485981308411215 [2025-03-09 01:13:50,043 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 233 flow. Second operand 5 states and 347 transitions. [2025-03-09 01:13:50,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 81 transitions, 313 flow [2025-03-09 01:13:50,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 81 transitions, 283 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:13:50,045 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 231 flow [2025-03-09 01:13:50,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2025-03-09 01:13:50,046 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -22 predicate places. [2025-03-09 01:13:50,046 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 231 flow [2025-03-09 01:13:50,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:50,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:50,046 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:50,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:13:50,047 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-09 01:13:50,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1915427506, now seen corresponding path program 1 times [2025-03-09 01:13:50,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:50,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278446099] [2025-03-09 01:13:50,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:50,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:50,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:13:50,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:13:50,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:50,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:50,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:50,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:50,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278446099] [2025-03-09 01:13:50,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278446099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:50,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437106102] [2025-03-09 01:13:50,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:50,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:50,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:50,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:50,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:13:50,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:13:50,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:13:50,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:50,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:50,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 01:13:50,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:50,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:50,514 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-09 01:13:50,571 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:13:50,572 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-09 01:13:50,592 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:13:50,592 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-09 01:13:50,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:50,747 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-09 01:13:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:50,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:50,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:13:50,981 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-09 01:13:51,063 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:13:51,063 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-09 01:13:51,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:51,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437106102] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:51,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:51,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 16 [2025-03-09 01:13:51,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329584014] [2025-03-09 01:13:51,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:51,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:13:51,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:51,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:13:51,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:13:53,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 107 [2025-03-09 01:13:53,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 231 flow. Second operand has 18 states, 18 states have (on average 57.833333333333336) internal successors, (1041), 18 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:53,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:53,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 107 [2025-03-09 01:13:53,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:53,700 INFO L124 PetriNetUnfolderBase]: 75/332 cut-off events. [2025-03-09 01:13:53,700 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-09 01:13:53,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 332 events. 75/332 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1446 event pairs, 72 based on Foata normal form. 6/281 useless extension candidates. Maximal degree in co-relation 602. Up to 178 conditions per place. [2025-03-09 01:13:53,702 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 46 selfloop transitions, 16 changer transitions 0/101 dead transitions. [2025-03-09 01:13:53,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 101 transitions, 459 flow [2025-03-09 01:13:53,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:13:53,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:13:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 573 transitions. [2025-03-09 01:13:53,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5950155763239875 [2025-03-09 01:13:53,703 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 231 flow. Second operand 9 states and 573 transitions. [2025-03-09 01:13:53,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 101 transitions, 459 flow [2025-03-09 01:13:53,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 101 transitions, 393 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:13:53,705 INFO L231 Difference]: Finished difference. Result has 95 places, 89 transitions, 305 flow [2025-03-09 01:13:53,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=305, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2025-03-09 01:13:53,706 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -14 predicate places. [2025-03-09 01:13:53,706 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 305 flow [2025-03-09 01:13:53,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 57.833333333333336) internal successors, (1041), 18 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:53,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:53,707 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:13:53,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:13:53,911 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-09 01:13:53,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-09 01:13:53,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1568059270, now seen corresponding path program 1 times [2025-03-09 01:13:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100463784] [2025-03-09 01:13:53,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:53,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:13:53,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:13:53,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:53,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:54,049 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-09 01:13:54,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:54,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100463784] [2025-03-09 01:13:54,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100463784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:54,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113061059] [2025-03-09 01:13:54,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:54,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:54,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:54,051 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:54,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:13:54,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:13:54,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:13:54,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:54,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:54,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:13:54,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:54,251 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-09 01:13:54,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:54,286 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-09 01:13:54,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113061059] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:54,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:54,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-09 01:13:54,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976432193] [2025-03-09 01:13:54,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:54,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:13:54,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:54,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:13:54,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:13:54,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2025-03-09 01:13:54,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 305 flow. Second operand has 9 states, 9 states have (on average 77.55555555555556) internal successors, (698), 9 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:54,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:54,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2025-03-09 01:13:54,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:54,467 INFO L124 PetriNetUnfolderBase]: 64/318 cut-off events. [2025-03-09 01:13:54,467 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-03-09 01:13:54,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 318 events. 64/318 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1131 event pairs, 63 based on Foata normal form. 4/272 useless extension candidates. Maximal degree in co-relation 603. Up to 154 conditions per place. [2025-03-09 01:13:54,469 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 62 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2025-03-09 01:13:54,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 111 transitions, 541 flow [2025-03-09 01:13:54,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:13:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:13:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 658 transitions. [2025-03-09 01:13:54,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7686915887850467 [2025-03-09 01:13:54,470 INFO L175 Difference]: Start difference. First operand has 95 places, 89 transitions, 305 flow. Second operand 8 states and 658 transitions. [2025-03-09 01:13:54,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 111 transitions, 541 flow [2025-03-09 01:13:54,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 111 transitions, 521 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:54,473 INFO L231 Difference]: Finished difference. Result has 103 places, 90 transitions, 321 flow [2025-03-09 01:13:54,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=321, PETRI_PLACES=103, PETRI_TRANSITIONS=90} [2025-03-09 01:13:54,473 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -6 predicate places. [2025-03-09 01:13:54,473 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 90 transitions, 321 flow [2025-03-09 01:13:54,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 77.55555555555556) internal successors, (698), 9 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:54,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:54,474 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-03-09 01:13:54,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:13:54,674 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-09 01:13:54,675 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-09 01:13:54,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:54,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2034449056, now seen corresponding path program 2 times [2025-03-09 01:13:54,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:54,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063429966] [2025-03-09 01:13:54,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:13:54,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:54,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-09 01:13:54,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:13:54,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:13:54,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:55,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:55,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063429966] [2025-03-09 01:13:56,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063429966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:56,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504341499] [2025-03-09 01:13:56,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:13:56,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:56,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:56,002 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:13:56,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:13:56,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-09 01:13:56,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:13:56,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:13:56,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:56,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-09 01:13:56,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:56,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:56,256 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-09 01:13:56,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:56,305 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-09 01:13:56,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:56,388 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-09 01:13:56,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:56,442 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-09 01:13:56,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:56,517 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-09 01:13:56,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:56,563 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-09 01:13:56,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:56,631 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-09 01:13:56,689 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:13:56,689 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-09 01:13:56,701 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:13:56,701 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-09 01:13:56,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:56,843 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-09 01:13:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:56,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:57,028 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:13:57,028 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-09 01:13:57,104 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:13:57,104 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-09 01:13:57,270 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:13:57,271 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-09 01:13:57,353 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:13:57,354 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-09 01:13:57,507 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:13:57,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 13 treesize of output 12 [2025-03-09 01:13:57,590 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:13:57,590 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-09 01:13:57,736 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:13:57,736 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-09 01:13:57,827 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:13:57,827 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-09 01:13:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504341499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:57,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:57,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 15] total 45 [2025-03-09 01:13:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975227179] [2025-03-09 01:13:57,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:57,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-09 01:13:57,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:57,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-09 01:13:57,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1626, Unknown=0, NotChecked=0, Total=2162 [2025-03-09 01:14:03,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 107 [2025-03-09 01:14:03,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 90 transitions, 321 flow. Second operand has 47 states, 47 states have (on average 58.04255319148936) internal successors, (2728), 47 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:14:03,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:14:03,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 107 [2025-03-09 01:14:03,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:04,512 INFO L124 PetriNetUnfolderBase]: 77/394 cut-off events. [2025-03-09 01:14:04,513 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2025-03-09 01:14:04,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 394 events. 77/394 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1527 event pairs, 72 based on Foata normal form. 6/346 useless extension candidates. Maximal degree in co-relation 821. Up to 180 conditions per place. [2025-03-09 01:14:04,515 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 70 selfloop transitions, 36 changer transitions 0/145 dead transitions. [2025-03-09 01:14:04,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 145 transitions, 867 flow [2025-03-09 01:14:04,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:14:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 01:14:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1288 transitions. [2025-03-09 01:14:04,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.573208722741433 [2025-03-09 01:14:04,518 INFO L175 Difference]: Start difference. First operand has 103 places, 90 transitions, 321 flow. Second operand 21 states and 1288 transitions. [2025-03-09 01:14:04,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 145 transitions, 867 flow [2025-03-09 01:14:04,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 145 transitions, 851 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-09 01:14:04,522 INFO L231 Difference]: Finished difference. Result has 130 places, 110 transitions, 629 flow [2025-03-09 01:14:04,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=629, PETRI_PLACES=130, PETRI_TRANSITIONS=110} [2025-03-09 01:14:04,523 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 21 predicate places. [2025-03-09 01:14:04,523 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 110 transitions, 629 flow [2025-03-09 01:14:04,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 58.04255319148936) internal successors, (2728), 47 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:14:04,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:04,524 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-03-09 01:14:04,534 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-09 01:14:04,725 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-09 01:14:04,725 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-09 01:14:04,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:04,726 INFO L85 PathProgramCache]: Analyzing trace with hash 451021934, now seen corresponding path program 2 times [2025-03-09 01:14:04,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:04,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373880348] [2025-03-09 01:14:04,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:14:04,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:04,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-09 01:14:04,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 01:14:04,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:14:04,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-09 01:14:05,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:05,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373880348] [2025-03-09 01:14:05,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373880348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:14:05,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:14:05,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:14:05,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587165451] [2025-03-09 01:14:05,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:14:05,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:14:05,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:14:05,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:14:05,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:14:05,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 107 [2025-03-09 01:14:05,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 110 transitions, 629 flow. Second operand has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 6 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:14:05,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:14:05,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 107 [2025-03-09 01:14:05,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:05,561 INFO L124 PetriNetUnfolderBase]: 116/562 cut-off events. [2025-03-09 01:14:05,561 INFO L125 PetriNetUnfolderBase]: For 579/579 co-relation queries the response was YES. [2025-03-09 01:14:05,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 562 events. 116/562 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2939 event pairs, 36 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 1170. Up to 161 conditions per place. [2025-03-09 01:14:05,564 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 59 selfloop transitions, 26 changer transitions 0/123 dead transitions. [2025-03-09 01:14:05,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 123 transitions, 825 flow [2025-03-09 01:14:05,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:14:05,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:14:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 438 transitions. [2025-03-09 01:14:05,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6822429906542056 [2025-03-09 01:14:05,566 INFO L175 Difference]: Start difference. First operand has 130 places, 110 transitions, 629 flow. Second operand 6 states and 438 transitions. [2025-03-09 01:14:05,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 123 transitions, 825 flow [2025-03-09 01:14:05,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 123 transitions, 701 flow, removed 39 selfloop flow, removed 11 redundant places. [2025-03-09 01:14:05,571 INFO L231 Difference]: Finished difference. Result has 124 places, 111 transitions, 572 flow [2025-03-09 01:14:05,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=572, PETRI_PLACES=124, PETRI_TRANSITIONS=111} [2025-03-09 01:14:05,572 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 15 predicate places. [2025-03-09 01:14:05,572 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 111 transitions, 572 flow [2025-03-09 01:14:05,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 6 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:14:05,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:05,573 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2025-03-09 01:14:05,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:14:05,573 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-09 01:14:05,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:05,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1096778733, now seen corresponding path program 1 times [2025-03-09 01:14:05,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:05,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075199690] [2025-03-09 01:14:05,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:05,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:05,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 01:14:05,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 01:14:05,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:05,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:05,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:05,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075199690] [2025-03-09 01:14:05,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075199690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:14:05,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309329938] [2025-03-09 01:14:05,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:05,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:14:05,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:14:05,850 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:14:05,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:14:06,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 01:14:06,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 01:14:06,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:06,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:06,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:14:06,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:14:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:06,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:14:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:06,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309329938] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:14:06,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:14:06,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-09 01:14:06,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704078651] [2025-03-09 01:14:06,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:14:06,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:14:06,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:14:06,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:14:06,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:14:06,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2025-03-09 01:14:06,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 111 transitions, 572 flow. Second operand has 13 states, 13 states have (on average 78.92307692307692) internal successors, (1026), 13 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:14:06,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:14:06,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2025-03-09 01:14:06,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:06,470 INFO L124 PetriNetUnfolderBase]: 95/481 cut-off events. [2025-03-09 01:14:06,470 INFO L125 PetriNetUnfolderBase]: For 489/490 co-relation queries the response was YES. [2025-03-09 01:14:06,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 481 events. 95/481 cut-off events. For 489/490 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2048 event pairs, 87 based on Foata normal form. 4/410 useless extension candidates. Maximal degree in co-relation 1031. Up to 220 conditions per place. [2025-03-09 01:14:06,475 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 89 selfloop transitions, 12 changer transitions 0/141 dead transitions. [2025-03-09 01:14:06,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 141 transitions, 926 flow [2025-03-09 01:14:06,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:14:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:14:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 978 transitions. [2025-03-09 01:14:06,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7616822429906542 [2025-03-09 01:14:06,477 INFO L175 Difference]: Start difference. First operand has 124 places, 111 transitions, 572 flow. Second operand 12 states and 978 transitions. [2025-03-09 01:14:06,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 141 transitions, 926 flow [2025-03-09 01:14:06,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 141 transitions, 890 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-09 01:14:06,483 INFO L231 Difference]: Finished difference. Result has 133 places, 108 transitions, 516 flow [2025-03-09 01:14:06,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=516, PETRI_PLACES=133, PETRI_TRANSITIONS=108} [2025-03-09 01:14:06,484 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 24 predicate places. [2025-03-09 01:14:06,485 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 108 transitions, 516 flow [2025-03-09 01:14:06,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 78.92307692307692) internal successors, (1026), 13 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:14:06,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:06,485 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2025-03-09 01:14:06,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:14:06,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:14:06,686 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-03-09 01:14:06,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:06,687 INFO L85 PathProgramCache]: Analyzing trace with hash -773317380, now seen corresponding path program 3 times [2025-03-09 01:14:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:06,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372571973] [2025-03-09 01:14:06,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:14:06,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:06,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes. [2025-03-09 01:14:07,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 01:14:07,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:14:07,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 409 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:07,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:07,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372571973] [2025-03-09 01:14:07,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372571973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:14:07,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506026338] [2025-03-09 01:14:07,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:14:07,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:14:07,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:14:07,755 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:14:07,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:14:07,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes.