./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.c -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 d1ab298b15ff3e93e3a25e88a66e704a5aedd8d8523826dd902097f6af136d70 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:15:54,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:15:54,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:15:54,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:15:54,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:15:54,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:15:54,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:15:54,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:15:54,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:15:54,441 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:15:54,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:15:54,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:15:54,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:15:54,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:15:54,442 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:15:54,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:15:54,443 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:15:54,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:15:54,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:15:54,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:15:54,443 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:15:54,443 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:15:54,443 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:15:54,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:15:54,443 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:15:54,443 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:15:54,443 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:15:54,444 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:15:54,444 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:15:54,444 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:15:54,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:54,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:54,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:54,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:54,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:15:54,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:54,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:54,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:54,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:54,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:15:54,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:15:54,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:15:54,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:15:54,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:15:54,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:15:54,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:15:54,445 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 -> d1ab298b15ff3e93e3a25e88a66e704a5aedd8d8523826dd902097f6af136d70 [2025-04-29 11:15:54,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:15:54,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:15:54,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:15:54,665 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:15:54,665 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:15:54,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.c [2025-04-29 11:15:55,936 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4253b1f/382c20a4881840e08e8d716ad66c2364/FLAGde8de52bb [2025-04-29 11:15:56,135 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:15:56,135 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.c [2025-04-29 11:15:56,136 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:15:56,136 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:15:56,136 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:15:56,143 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4253b1f/382c20a4881840e08e8d716ad66c2364/FLAGde8de52bb [2025-04-29 11:15:56,940 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4253b1f/382c20a4881840e08e8d716ad66c2364 [2025-04-29 11:15:56,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:15:56,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:15:56,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:56,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:15:56,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:15:56,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f9b7e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56, skipping insertion in model container [2025-04-29 11:15:56,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:15:57,134 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:57,146 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:15:57,187 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:57,202 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:15:57,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57 WrapperNode [2025-04-29 11:15:57,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:57,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:57,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:15:57,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:15:57,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,240 INFO L138 Inliner]: procedures = 20, calls = 48, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 142 [2025-04-29 11:15:57,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:57,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:15:57,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:15:57,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:15:57,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,273 INFO L175 MemorySlicer]: Split 38 memory accesses to 3 slices as follows [10, 14, 14]. 37 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [10, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-04-29 11:15:57,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,283 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:15:57,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:15:57,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:15:57,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:15:57,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:57,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:57,331 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-04-29 11:15:57,333 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-04-29 11:15:57,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:15:57,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:15:57,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:15:57,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:15:57,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:15:57,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-29 11:15:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:15:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:15:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:15:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 11:15:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-29 11:15:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:15:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:15:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-29 11:15:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:15:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:15:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-29 11:15:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:15:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:15:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:15:57,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:15:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:15:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:15:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-29 11:15:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:15:57,360 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:15:57,361 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:15:57,468 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:15:57,469 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:15:57,746 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:15:57,746 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:15:57,917 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:15:57,918 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:15:57,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:57 BoogieIcfgContainer [2025-04-29 11:15:57,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:15:57,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:15:57,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:15:57,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:15:57,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:15:56" (1/3) ... [2025-04-29 11:15:57,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c4fd33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:15:57, skipping insertion in model container [2025-04-29 11:15:57,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (2/3) ... [2025-04-29 11:15:57,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c4fd33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:15:57, skipping insertion in model container [2025-04-29 11:15:57,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:57" (3/3) ... [2025-04-29 11:15:57,928 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr.c [2025-04-29 11:15:57,938 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:15:57,941 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_11-arraylist_nr.c that has 2 procedures, 72 locations, 72 edges, 1 initial locations, 2 loop locations, and 37 error locations. [2025-04-29 11:15:57,941 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:15:57,994 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:15:58,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 73 transitions, 150 flow [2025-04-29 11:15:58,059 INFO L116 PetriNetUnfolderBase]: 2/72 cut-off events. [2025-04-29 11:15:58,062 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:58,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 286 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-04-29 11:15:58,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 73 transitions, 150 flow [2025-04-29 11:15:58,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 72 transitions, 147 flow [2025-04-29 11:15:58,079 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:15:58,089 INFO L340 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;@582eec1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:15:58,091 INFO L341 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-04-29 11:15:58,095 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:15:58,095 INFO L116 PetriNetUnfolderBase]: 1/7 cut-off events. [2025-04-29 11:15:58,095 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:58,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:58,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-29 11:15:58,096 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:58,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:58,102 INFO L85 PathProgramCache]: Analyzing trace with hash 13587737, now seen corresponding path program 1 times [2025-04-29 11:15:58,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:58,108 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808379661] [2025-04-29 11:15:58,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:58,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:58,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-29 11:15:58,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-29 11:15:58,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:58,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:58,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:58,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808379661] [2025-04-29 11:15:58,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808379661] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:58,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:58,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:58,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710405051] [2025-04-29 11:15:58,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:58,288 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:58,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:58,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:58,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:58,307 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-04-29 11:15:58,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-04-29 11:15:58,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:58,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-04-29 11:15:58,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:58,422 INFO L116 PetriNetUnfolderBase]: 65/269 cut-off events. [2025-04-29 11:15:58,422 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:58,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 269 events. 65/269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1400 event pairs, 63 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 377. Up to 155 conditions per place. [2025-04-29 11:15:58,426 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 27 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-04-29 11:15:58,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 73 transitions, 207 flow [2025-04-29 11:15:58,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:58,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-04-29 11:15:58,437 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7534246575342466 [2025-04-29 11:15:58,438 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 147 flow. Second operand 3 states and 165 transitions. [2025-04-29 11:15:58,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 73 transitions, 207 flow [2025-04-29 11:15:58,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 73 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:58,443 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 158 flow [2025-04-29 11:15:58,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2025-04-29 11:15:58,447 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 2 predicate places. [2025-04-29 11:15:58,447 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 158 flow [2025-04-29 11:15:58,448 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-04-29 11:15:58,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:58,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:15:58,448 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:15:58,448 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:58,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:58,449 INFO L85 PathProgramCache]: Analyzing trace with hash 421188199, now seen corresponding path program 1 times [2025-04-29 11:15:58,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:58,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085103113] [2025-04-29 11:15:58,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:58,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:58,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:15:58,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:15:58,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:58,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:58,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:58,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085103113] [2025-04-29 11:15:58,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085103113] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:58,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883018707] [2025-04-29 11:15:58,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:58,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:58,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:58,546 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-04-29 11:15:58,549 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-04-29 11:15:58,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:15:58,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:15:58,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:58,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:58,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:15:58,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:58,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:58,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883018707] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:58,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:58,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-29 11:15:58,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769593124] [2025-04-29 11:15:58,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:58,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:15:58,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:58,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:15:58,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:15:58,675 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-04-29 11:15:58,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 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-04-29 11:15:58,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:58,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-04-29 11:15:58,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:58,792 INFO L116 PetriNetUnfolderBase]: 65/272 cut-off events. [2025-04-29 11:15:58,792 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:58,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 272 events. 65/272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1397 event pairs, 63 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 433. Up to 155 conditions per place. [2025-04-29 11:15:58,796 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 27 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-04-29 11:15:58,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 76 transitions, 234 flow [2025-04-29 11:15:58,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:15:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:15:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 305 transitions. [2025-04-29 11:15:58,799 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6963470319634704 [2025-04-29 11:15:58,799 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 158 flow. Second operand 6 states and 305 transitions. [2025-04-29 11:15:58,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 76 transitions, 234 flow [2025-04-29 11:15:58,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 230 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:58,801 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 190 flow [2025-04-29 11:15:58,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2025-04-29 11:15:58,804 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 9 predicate places. [2025-04-29 11:15:58,804 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 190 flow [2025-04-29 11:15:58,804 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 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-04-29 11:15:58,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:58,804 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-04-29 11:15:58,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:59,005 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:59,006 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:59,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:59,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1986738329, now seen corresponding path program 2 times [2025-04-29 11:15:59,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:59,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007508802] [2025-04-29 11:15:59,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:59,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:59,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-04-29 11:15:59,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-04-29 11:15:59,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:15:59,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:15:59,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:59,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007508802] [2025-04-29 11:15:59,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007508802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:59,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:59,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:59,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309470698] [2025-04-29 11:15:59,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:59,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:59,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:59,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:59,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:59,121 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 73 [2025-04-29 11:15:59,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-04-29 11:15:59,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:59,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 73 [2025-04-29 11:15:59,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:59,191 INFO L116 PetriNetUnfolderBase]: 65/268 cut-off events. [2025-04-29 11:15:59,191 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:15:59,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 268 events. 65/268 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1362 event pairs, 63 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 422. Up to 157 conditions per place. [2025-04-29 11:15:59,193 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 30 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2025-04-29 11:15:59,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 72 transitions, 250 flow [2025-04-29 11:15:59,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-04-29 11:15:59,194 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6894977168949772 [2025-04-29 11:15:59,194 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 190 flow. Second operand 3 states and 151 transitions. [2025-04-29 11:15:59,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 72 transitions, 250 flow [2025-04-29 11:15:59,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 72 transitions, 236 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:59,196 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 176 flow [2025-04-29 11:15:59,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2025-04-29 11:15:59,196 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 6 predicate places. [2025-04-29 11:15:59,196 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 176 flow [2025-04-29 11:15:59,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-04-29 11:15:59,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:59,197 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-04-29 11:15:59,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:15:59,197 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:59,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:59,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1986738330, now seen corresponding path program 1 times [2025-04-29 11:15:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:59,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88078738] [2025-04-29 11:15:59,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:59,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:15:59,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:15:59,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:59,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:59,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:59,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88078738] [2025-04-29 11:15:59,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88078738] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:59,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143282167] [2025-04-29 11:15:59,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:59,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:59,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:59,334 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-04-29 11:15:59,341 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-04-29 11:15:59,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:15:59,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:15:59,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:59,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:59,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:15:59,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:59,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:59,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143282167] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:59,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:59,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-29 11:15:59,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216500827] [2025-04-29 11:15:59,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:59,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:15:59,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:59,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:15:59,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:15:59,469 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-04-29 11:15:59,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 176 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 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-04-29 11:15:59,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:59,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-04-29 11:15:59,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:59,574 INFO L116 PetriNetUnfolderBase]: 65/274 cut-off events. [2025-04-29 11:15:59,574 INFO L117 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-04-29 11:15:59,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 274 events. 65/274 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1347 event pairs, 63 based on Foata normal form. 6/223 useless extension candidates. Maximal degree in co-relation 432. Up to 155 conditions per place. [2025-04-29 11:15:59,576 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 27 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2025-04-29 11:15:59,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 78 transitions, 288 flow [2025-04-29 11:15:59,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:15:59,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:15:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 584 transitions. [2025-04-29 11:15:59,577 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-29 11:15:59,577 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 176 flow. Second operand 12 states and 584 transitions. [2025-04-29 11:15:59,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 78 transitions, 288 flow [2025-04-29 11:15:59,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 78 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:59,579 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 252 flow [2025-04-29 11:15:59,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=252, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2025-04-29 11:15:59,580 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 21 predicate places. [2025-04-29 11:15:59,580 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 252 flow [2025-04-29 11:15:59,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 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-04-29 11:15:59,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:59,581 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-04-29 11:15:59,587 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-04-29 11:15:59,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 11:15:59,782 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:59,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:59,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1217182246, now seen corresponding path program 2 times [2025-04-29 11:15:59,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:59,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304837036] [2025-04-29 11:15:59,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:59,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:59,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-29 11:15:59,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-04-29 11:15:59,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:15:59,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:15:59,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:59,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304837036] [2025-04-29 11:15:59,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304837036] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:59,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:59,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:59,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257583468] [2025-04-29 11:15:59,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:59,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:59,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:59,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:59,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:59,910 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 73 [2025-04-29 11:15:59,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-04-29 11:15:59,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:59,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 73 [2025-04-29 11:15:59,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:59,977 INFO L116 PetriNetUnfolderBase]: 65/270 cut-off events. [2025-04-29 11:15:59,978 INFO L117 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-04-29 11:15:59,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 270 events. 65/270 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1341 event pairs, 63 based on Foata normal form. 2/216 useless extension candidates. Maximal degree in co-relation 422. Up to 163 conditions per place. [2025-04-29 11:15:59,980 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 34 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-04-29 11:15:59,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 74 transitions, 320 flow [2025-04-29 11:15:59,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:59,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-04-29 11:15:59,982 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7077625570776256 [2025-04-29 11:15:59,982 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 252 flow. Second operand 3 states and 155 transitions. [2025-04-29 11:15:59,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 74 transitions, 320 flow [2025-04-29 11:15:59,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 74 transitions, 272 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-04-29 11:15:59,987 INFO L231 Difference]: Finished difference. Result has 88 places, 74 transitions, 204 flow [2025-04-29 11:15:59,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=88, PETRI_TRANSITIONS=74} [2025-04-29 11:15:59,987 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 14 predicate places. [2025-04-29 11:15:59,987 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 74 transitions, 204 flow [2025-04-29 11:15:59,988 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-04-29 11:15:59,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:59,988 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:59,988 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:15:59,988 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:59,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:59,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1481022797, now seen corresponding path program 1 times [2025-04-29 11:15:59,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:59,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098043490] [2025-04-29 11:15:59,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:59,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:00,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:16:00,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:16:00,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:00,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:00,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:00,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098043490] [2025-04-29 11:16:00,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098043490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:00,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:00,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:00,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555878079] [2025-04-29 11:16:00,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:00,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:00,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:00,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:00,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:00,289 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 73 [2025-04-29 11:16:00,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 74 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 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-04-29 11:16:00,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:00,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 73 [2025-04-29 11:16:00,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:00,354 INFO L116 PetriNetUnfolderBase]: 74/288 cut-off events. [2025-04-29 11:16:00,354 INFO L117 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-04-29 11:16:00,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 288 events. 74/288 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1410 event pairs, 72 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 471. Up to 185 conditions per place. [2025-04-29 11:16:00,356 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 40 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2025-04-29 11:16:00,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 70 transitions, 278 flow [2025-04-29 11:16:00,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:00,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-04-29 11:16:00,356 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.680365296803653 [2025-04-29 11:16:00,356 INFO L175 Difference]: Start difference. First operand has 88 places, 74 transitions, 204 flow. Second operand 3 states and 149 transitions. [2025-04-29 11:16:00,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 70 transitions, 278 flow [2025-04-29 11:16:00,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:00,360 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 190 flow [2025-04-29 11:16:00,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2025-04-29 11:16:00,360 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 10 predicate places. [2025-04-29 11:16:00,360 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 190 flow [2025-04-29 11:16:00,361 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 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-04-29 11:16:00,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:00,361 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:00,361 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:16:00,361 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:00,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:00,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1481022796, now seen corresponding path program 1 times [2025-04-29 11:16:00,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:00,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696042351] [2025-04-29 11:16:00,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:00,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:00,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:16:00,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:16:00,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:00,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:00,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:00,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696042351] [2025-04-29 11:16:00,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696042351] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:00,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:00,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:00,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495550307] [2025-04-29 11:16:00,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:00,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:00,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:00,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:00,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:00,855 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 73 [2025-04-29 11:16:00,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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-04-29 11:16:00,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:00,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 73 [2025-04-29 11:16:00,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:00,981 INFO L116 PetriNetUnfolderBase]: 65/277 cut-off events. [2025-04-29 11:16:00,981 INFO L117 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-04-29 11:16:00,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 277 events. 65/277 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1260 event pairs, 63 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 472. Up to 166 conditions per place. [2025-04-29 11:16:00,983 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 40 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2025-04-29 11:16:00,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 298 flow [2025-04-29 11:16:00,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2025-04-29 11:16:00,984 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.589041095890411 [2025-04-29 11:16:00,984 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 190 flow. Second operand 5 states and 215 transitions. [2025-04-29 11:16:00,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 298 flow [2025-04-29 11:16:00,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 77 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:00,986 INFO L231 Difference]: Finished difference. Result has 89 places, 75 transitions, 239 flow [2025-04-29 11:16:00,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2025-04-29 11:16:00,989 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 15 predicate places. [2025-04-29 11:16:00,989 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 239 flow [2025-04-29 11:16:00,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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-04-29 11:16:00,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:00,989 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:00,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:16:00,989 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:00,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:00,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1830358348, now seen corresponding path program 1 times [2025-04-29 11:16:00,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:00,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904765158] [2025-04-29 11:16:00,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:01,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:16:01,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:16:01,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:01,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:01,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:01,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904765158] [2025-04-29 11:16:01,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904765158] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:01,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:01,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:16:01,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826449335] [2025-04-29 11:16:01,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:01,264 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:16:01,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:01,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:16:01,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:16:01,445 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 73 [2025-04-29 11:16:01,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 75 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 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-04-29 11:16:01,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:01,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 73 [2025-04-29 11:16:01,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:01,576 INFO L116 PetriNetUnfolderBase]: 65/273 cut-off events. [2025-04-29 11:16:01,577 INFO L117 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-04-29 11:16:01,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 273 events. 65/273 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1236 event pairs, 63 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 491. Up to 160 conditions per place. [2025-04-29 11:16:01,578 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 35 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2025-04-29 11:16:01,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 73 transitions, 327 flow [2025-04-29 11:16:01,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:16:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:16:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 285 transitions. [2025-04-29 11:16:01,579 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5577299412915852 [2025-04-29 11:16:01,580 INFO L175 Difference]: Start difference. First operand has 89 places, 75 transitions, 239 flow. Second operand 7 states and 285 transitions. [2025-04-29 11:16:01,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 73 transitions, 327 flow [2025-04-29 11:16:01,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 73 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:01,581 INFO L231 Difference]: Finished difference. Result has 91 places, 73 transitions, 253 flow [2025-04-29 11:16:01,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=91, PETRI_TRANSITIONS=73} [2025-04-29 11:16:01,582 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 17 predicate places. [2025-04-29 11:16:01,582 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 73 transitions, 253 flow [2025-04-29 11:16:01,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 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-04-29 11:16:01,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:01,582 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:01,583 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:16:01,583 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:01,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:01,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1830358347, now seen corresponding path program 1 times [2025-04-29 11:16:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:01,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601595300] [2025-04-29 11:16:01,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:01,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:01,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:16:01,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:16:01,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:01,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:01,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:01,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601595300] [2025-04-29 11:16:01,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601595300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:01,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:01,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:16:01,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754340828] [2025-04-29 11:16:01,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:01,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:16:01,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:01,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:16:01,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:16:02,200 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 73 [2025-04-29 11:16:02,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 73 transitions, 253 flow. Second operand has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 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-04-29 11:16:02,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:02,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 73 [2025-04-29 11:16:02,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:02,351 INFO L116 PetriNetUnfolderBase]: 65/269 cut-off events. [2025-04-29 11:16:02,352 INFO L117 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-04-29 11:16:02,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 269 events. 65/269 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1202 event pairs, 63 based on Foata normal form. 2/227 useless extension candidates. Maximal degree in co-relation 496. Up to 160 conditions per place. [2025-04-29 11:16:02,353 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 34 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2025-04-29 11:16:02,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 71 transitions, 339 flow [2025-04-29 11:16:02,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:16:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:16:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 263 transitions. [2025-04-29 11:16:02,354 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5146771037181996 [2025-04-29 11:16:02,355 INFO L175 Difference]: Start difference. First operand has 91 places, 73 transitions, 253 flow. Second operand 7 states and 263 transitions. [2025-04-29 11:16:02,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 71 transitions, 339 flow [2025-04-29 11:16:02,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 71 transitions, 317 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-29 11:16:02,356 INFO L231 Difference]: Finished difference. Result has 89 places, 71 transitions, 249 flow [2025-04-29 11:16:02,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=89, PETRI_TRANSITIONS=71} [2025-04-29 11:16:02,357 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 15 predicate places. [2025-04-29 11:16:02,357 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 71 transitions, 249 flow [2025-04-29 11:16:02,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 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-04-29 11:16:02,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:02,357 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:02,357 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:16:02,357 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:02,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:02,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1962233890, now seen corresponding path program 1 times [2025-04-29 11:16:02,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:02,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895504424] [2025-04-29 11:16:02,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:02,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:02,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:16:02,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:16:02,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:02,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:02,490 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:02,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:02,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895504424] [2025-04-29 11:16:02,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895504424] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:02,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:02,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:02,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371077457] [2025-04-29 11:16:02,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:02,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:02,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:02,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:02,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:02,575 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 73 [2025-04-29 11:16:02,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 71 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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-04-29 11:16:02,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:02,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 73 [2025-04-29 11:16:02,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:02,662 INFO L116 PetriNetUnfolderBase]: 65/267 cut-off events. [2025-04-29 11:16:02,662 INFO L117 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-04-29 11:16:02,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 267 events. 65/267 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1186 event pairs, 63 based on Foata normal form. 2/227 useless extension candidates. Maximal degree in co-relation 490. Up to 162 conditions per place. [2025-04-29 11:16:02,663 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 32 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2025-04-29 11:16:02,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 70 transitions, 333 flow [2025-04-29 11:16:02,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:02,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2025-04-29 11:16:02,665 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6273972602739726 [2025-04-29 11:16:02,665 INFO L175 Difference]: Start difference. First operand has 89 places, 71 transitions, 249 flow. Second operand 5 states and 229 transitions. [2025-04-29 11:16:02,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 70 transitions, 333 flow [2025-04-29 11:16:02,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 70 transitions, 311 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-29 11:16:02,666 INFO L231 Difference]: Finished difference. Result has 86 places, 70 transitions, 247 flow [2025-04-29 11:16:02,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=86, PETRI_TRANSITIONS=70} [2025-04-29 11:16:02,667 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 12 predicate places. [2025-04-29 11:16:02,667 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 70 transitions, 247 flow [2025-04-29 11:16:02,667 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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-04-29 11:16:02,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:02,667 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:02,667 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:16:02,667 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:02,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:02,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1962233889, now seen corresponding path program 1 times [2025-04-29 11:16:02,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:02,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407437735] [2025-04-29 11:16:02,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:02,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:02,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:16:02,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:16:02,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:02,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:02,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:02,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407437735] [2025-04-29 11:16:02,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407437735] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:02,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:02,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:02,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98956128] [2025-04-29 11:16:02,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:02,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:02,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:02,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:02,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:02,838 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 73 [2025-04-29 11:16:02,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 70 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 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-04-29 11:16:02,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:02,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 73 [2025-04-29 11:16:02,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:02,943 INFO L116 PetriNetUnfolderBase]: 65/265 cut-off events. [2025-04-29 11:16:02,943 INFO L117 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-04-29 11:16:02,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 265 events. 65/265 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1177 event pairs, 63 based on Foata normal form. 2/225 useless extension candidates. Maximal degree in co-relation 492. Up to 162 conditions per place. [2025-04-29 11:16:02,945 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 34 selfloop transitions, 11 changer transitions 0/69 dead transitions. [2025-04-29 11:16:02,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 69 transitions, 335 flow [2025-04-29 11:16:02,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:02,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2025-04-29 11:16:02,946 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6054794520547945 [2025-04-29 11:16:02,946 INFO L175 Difference]: Start difference. First operand has 86 places, 70 transitions, 247 flow. Second operand 5 states and 221 transitions. [2025-04-29 11:16:02,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 69 transitions, 335 flow [2025-04-29 11:16:02,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 69 transitions, 313 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:02,950 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 245 flow [2025-04-29 11:16:02,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2025-04-29 11:16:02,951 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 11 predicate places. [2025-04-29 11:16:02,951 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 245 flow [2025-04-29 11:16:02,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 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-04-29 11:16:02,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:02,951 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:02,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:16:02,951 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:02,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:02,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1552044010, now seen corresponding path program 1 times [2025-04-29 11:16:02,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:02,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913443610] [2025-04-29 11:16:02,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:02,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:02,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:16:02,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:16:02,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:02,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:03,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:03,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913443610] [2025-04-29 11:16:03,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913443610] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:03,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198180885] [2025-04-29 11:16:03,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:03,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:03,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:03,661 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-04-29 11:16:03,662 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-04-29 11:16:03,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:16:03,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:16:03,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:16:03,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:03,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:03,938 INFO L354 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-04-29 11:16:03,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:03,985 INFO L354 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-04-29 11:16:04,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:04,054 INFO L354 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-04-29 11:16:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:04,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:04,264 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:04,265 INFO L354 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-04-29 11:16:04,340 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:04,340 INFO L354 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-04-29 11:16:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:04,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198180885] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:04,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:04,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 20 [2025-04-29 11:16:04,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177268465] [2025-04-29 11:16:04,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:04,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-29 11:16:04,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:04,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-29 11:16:04,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:16:06,942 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-04-29 11:16:06,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 245 flow. Second operand has 22 states, 22 states have (on average 33.31818181818182) internal successors, (733), 22 states have internal predecessors, (733), 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-04-29 11:16:06,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:06,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-04-29 11:16:06,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:07,482 INFO L116 PetriNetUnfolderBase]: 74/321 cut-off events. [2025-04-29 11:16:07,482 INFO L117 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-04-29 11:16:07,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 321 events. 74/321 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1348 event pairs, 72 based on Foata normal form. 10/286 useless extension candidates. Maximal degree in co-relation 632. Up to 181 conditions per place. [2025-04-29 11:16:07,484 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 71 selfloop transitions, 12 changer transitions 0/103 dead transitions. [2025-04-29 11:16:07,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 103 transitions, 545 flow [2025-04-29 11:16:07,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:16:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:16:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 455 transitions. [2025-04-29 11:16:07,485 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.519406392694064 [2025-04-29 11:16:07,485 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 245 flow. Second operand 12 states and 455 transitions. [2025-04-29 11:16:07,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 103 transitions, 545 flow [2025-04-29 11:16:07,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 103 transitions, 485 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:07,487 INFO L231 Difference]: Finished difference. Result has 95 places, 72 transitions, 284 flow [2025-04-29 11:16:07,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=284, PETRI_PLACES=95, PETRI_TRANSITIONS=72} [2025-04-29 11:16:07,488 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 21 predicate places. [2025-04-29 11:16:07,488 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 72 transitions, 284 flow [2025-04-29 11:16:07,488 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 33.31818181818182) internal successors, (733), 22 states have internal predecessors, (733), 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-04-29 11:16:07,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:07,488 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2025-04-29 11:16:07,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:16:07,688 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:07,689 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:07,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:07,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1365290356, now seen corresponding path program 2 times [2025-04-29 11:16:07,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:07,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772249124] [2025-04-29 11:16:07,689 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:07,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:07,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-29 11:16:07,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:16:07,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:16:07,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:08,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:08,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772249124] [2025-04-29 11:16:08,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772249124] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:08,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951861562] [2025-04-29 11:16:08,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:08,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:08,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:08,922 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-04-29 11:16:08,923 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-04-29 11:16:09,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-29 11:16:09,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:16:09,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:16:09,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:09,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-04-29 11:16:09,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:09,257 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:16:09,257 INFO L354 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-04-29 11:16:09,274 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:16:09,275 INFO L354 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-04-29 11:16:09,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,364 INFO L354 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-04-29 11:16:09,369 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:16:09,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,482 INFO L354 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-04-29 11:16:09,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,524 INFO L354 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-04-29 11:16:09,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,604 INFO L354 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-04-29 11:16:09,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,641 INFO L354 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-04-29 11:16:09,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,704 INFO L354 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-04-29 11:16:09,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,738 INFO L354 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-04-29 11:16:09,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:09,804 INFO L354 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-04-29 11:16:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:09,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:09,979 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:09,979 INFO L354 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-04-29 11:16:10,024 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:10,024 INFO L354 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-04-29 11:16:10,158 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:10,159 INFO L354 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-04-29 11:16:10,231 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:10,232 INFO L354 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-04-29 11:16:10,427 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:10,428 INFO L354 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-04-29 11:16:10,502 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:10,503 INFO L354 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-04-29 11:16:10,685 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:10,686 INFO L354 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-04-29 11:16:10,762 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:10,762 INFO L354 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-04-29 11:16:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:10,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951861562] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:10,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:10,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 11] total 40 [2025-04-29 11:16:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416280122] [2025-04-29 11:16:10,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:10,975 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-29 11:16:10,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:10,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-29 11:16:10,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1390, Unknown=0, NotChecked=0, Total=1722 [2025-04-29 11:16:16,360 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 73 [2025-04-29 11:16:16,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 72 transitions, 284 flow. Second operand has 42 states, 42 states have (on average 36.42857142857143) internal successors, (1530), 42 states have internal predecessors, (1530), 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-04-29 11:16:16,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:16,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 73 [2025-04-29 11:16:16,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:17,196 INFO L116 PetriNetUnfolderBase]: 74/375 cut-off events. [2025-04-29 11:16:17,196 INFO L117 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-04-29 11:16:17,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 375 events. 74/375 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1289 event pairs, 72 based on Foata normal form. 12/342 useless extension candidates. Maximal degree in co-relation 749. Up to 179 conditions per place. [2025-04-29 11:16:17,198 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 85 selfloop transitions, 21 changer transitions 0/129 dead transitions. [2025-04-29 11:16:17,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 129 transitions, 725 flow [2025-04-29 11:16:17,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:16:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-29 11:16:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 720 transitions. [2025-04-29 11:16:17,200 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.547945205479452 [2025-04-29 11:16:17,200 INFO L175 Difference]: Start difference. First operand has 95 places, 72 transitions, 284 flow. Second operand 18 states and 720 transitions. [2025-04-29 11:16:17,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 129 transitions, 725 flow [2025-04-29 11:16:17,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 129 transitions, 702 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-29 11:16:17,202 INFO L231 Difference]: Finished difference. Result has 118 places, 82 transitions, 424 flow [2025-04-29 11:16:17,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=424, PETRI_PLACES=118, PETRI_TRANSITIONS=82} [2025-04-29 11:16:17,203 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 44 predicate places. [2025-04-29 11:16:17,203 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 82 transitions, 424 flow [2025-04-29 11:16:17,204 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 36.42857142857143) internal successors, (1530), 42 states have internal predecessors, (1530), 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-04-29 11:16:17,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:17,204 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1] [2025-04-29 11:16:17,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:16:17,404 WARN L466 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-04-29 11:16:17,404 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:17,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1490476720, now seen corresponding path program 3 times [2025-04-29 11:16:17,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:17,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764955420] [2025-04-29 11:16:17,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:16:17,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:17,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 11 equivalence classes. [2025-04-29 11:16:17,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 116 of 116 statements. [2025-04-29 11:16:17,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-29 11:16:17,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 399 proven. 91 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:18,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:18,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764955420] [2025-04-29 11:16:18,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764955420] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:18,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007978326] [2025-04-29 11:16:18,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:16:18,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:18,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:18,350 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-04-29 11:16:18,352 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-04-29 11:16:18,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 11 equivalence classes. Killed by 15