./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_12-arraycollapse_rc-deref.i --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_12-arraycollapse_rc-deref.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 573c853979782f78b60122afde2824ab47c3f9d6394b4ee74285d458320f7321 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:35:32,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:35:32,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:35:32,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:35:32,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:35:32,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:35:32,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:35:32,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:35:32,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:35:32,115 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:35:32,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:35:32,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:35:32,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:35:32,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:35:32,115 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:35:32,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:35:32,116 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:32,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:32,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:35:32,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:32,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:32,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:32,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:32,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:35:32,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:35:32,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:35:32,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:35:32,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:35:32,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:35:32,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:35:32,117 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 -> 573c853979782f78b60122afde2824ab47c3f9d6394b4ee74285d458320f7321 [2025-04-30 10:35:32,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:35:32,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:35:32,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:35:32,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:35:32,380 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:35:32,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_12-arraycollapse_rc-deref.i [2025-04-30 10:35:33,738 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb35372d3/1c16b08981364289ab12d766cae65461/FLAG001a15582 [2025-04-30 10:35:34,046 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:35:34,047 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_12-arraycollapse_rc-deref.i [2025-04-30 10:35:34,067 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb35372d3/1c16b08981364289ab12d766cae65461/FLAG001a15582 [2025-04-30 10:35:34,788 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb35372d3/1c16b08981364289ab12d766cae65461 [2025-04-30 10:35:34,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:35:34,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:35:34,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:34,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:35:34,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:35:34,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:34" (1/1) ... [2025-04-30 10:35:34,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1773107c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:34, skipping insertion in model container [2025-04-30 10:35:34,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:34" (1/1) ... [2025-04-30 10:35:34,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:35:35,167 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:35,194 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:35:35,275 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:35,338 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:35:35,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:35 WrapperNode [2025-04-30 10:35:35,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:35,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:35,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:35:35,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:35:35,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:35" (1/1) ... [2025-04-30 10:35:35,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:35" (1/1) ... [2025-04-30 10:35:35,395 INFO L138 Inliner]: procedures = 372, calls = 99, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 246 [2025-04-30 10:35:35,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:35,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:35:35,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:35:35,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:35:35,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:35" (1/1) ... [2025-04-30 10:35:35,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:35" (1/1) ... [2025-04-30 10:35:35,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:35" (1/1) ... [2025-04-30 10:35:35,428 INFO L175 MemorySlicer]: Split 97 memory accesses to 3 slices as follows [29, 50, 18]. 52 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [0, 50, 10]. The 24 writes are split as follows [22, 0, 2]. [2025-04-30 10:35:35,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:35" (1/1) ... [2025-04-30 10:35:35,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:35" (1/1) ... [2025-04-30 10:35:35,439 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:35" (1/1) ... [2025-04-30 10:35:35,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:35" (1/1) ... [2025-04-30 10:35:35,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:35" (1/1) ... [2025-04-30 10:35:35,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:35" (1/1) ... [2025-04-30 10:35:35,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:35" (1/1) ... [2025-04-30 10:35:35,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:35:35,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:35:35,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:35:35,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:35:35,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:35" (1/1) ... [2025-04-30 10:35:35,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:35,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:35,482 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-30 10:35:35,487 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-30 10:35:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:35:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:35:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:35:35,507 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:35:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:35:35,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:35:35,510 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:35:35,649 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:35:35,650 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:35:36,064 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:35:36,064 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:35:36,308 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:35:36,308 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:35:36,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:36 BoogieIcfgContainer [2025-04-30 10:35:36,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:35:36,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:35:36,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:35:36,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:35:36,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:35:34" (1/3) ... [2025-04-30 10:35:36,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35359dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:36, skipping insertion in model container [2025-04-30 10:35:36,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:35" (2/3) ... [2025-04-30 10:35:36,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35359dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:36, skipping insertion in model container [2025-04-30 10:35:36,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:36" (3/3) ... [2025-04-30 10:35:36,316 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc-deref.i [2025-04-30 10:35:36,328 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:35:36,330 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_12-arraycollapse_rc-deref.i that has 2 procedures, 128 locations, 127 edges, 1 initial locations, 1 loop locations, and 75 error locations. [2025-04-30 10:35:36,330 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:35:36,403 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:35:36,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 128 transitions, 260 flow [2025-04-30 10:35:36,484 INFO L116 PetriNetUnfolderBase]: 1/127 cut-off events. [2025-04-30 10:35:36,485 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:36,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 1/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 248 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2025-04-30 10:35:36,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 128 transitions, 260 flow [2025-04-30 10:35:36,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 127 transitions, 257 flow [2025-04-30 10:35:36,502 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:35:36,510 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;@67f80653, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:35:36,510 INFO L341 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2025-04-30 10:35:36,514 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:35:36,514 INFO L116 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-04-30 10:35:36,514 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:36,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:36,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-30 10:35:36,515 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:36,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:36,519 INFO L85 PathProgramCache]: Analyzing trace with hash 719278, now seen corresponding path program 1 times [2025-04-30 10:35:36,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:36,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957651892] [2025-04-30 10:35:36,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:36,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:36,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-30 10:35:36,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-30 10:35:36,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:36,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:36,752 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-30 10:35:36,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:36,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957651892] [2025-04-30 10:35:36,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957651892] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:36,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:36,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:36,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547516094] [2025-04-30 10:35:36,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:36,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:36,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:36,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:36,788 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2025-04-30 10:35:36,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 127 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-30 10:35:36,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:36,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2025-04-30 10:35:36,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:36,967 INFO L116 PetriNetUnfolderBase]: 64/324 cut-off events. [2025-04-30 10:35:36,969 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:36,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 324 events. 64/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1330 event pairs, 63 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 377. Up to 166 conditions per place. [2025-04-30 10:35:36,973 INFO L140 encePairwiseOnDemand]: 125/128 looper letters, 38 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2025-04-30 10:35:36,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 128 transitions, 339 flow [2025-04-30 10:35:36,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:36,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2025-04-30 10:35:36,988 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2025-04-30 10:35:36,990 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 257 flow. Second operand 3 states and 308 transitions. [2025-04-30 10:35:36,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 128 transitions, 339 flow [2025-04-30 10:35:36,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:36,999 INFO L231 Difference]: Finished difference. Result has 132 places, 128 transitions, 268 flow [2025-04-30 10:35:37,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=132, PETRI_TRANSITIONS=128} [2025-04-30 10:35:37,004 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-04-30 10:35:37,005 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 128 transitions, 268 flow [2025-04-30 10:35:37,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-30 10:35:37,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:37,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-30 10:35:37,006 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:35:37,006 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:37,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:37,007 INFO L85 PathProgramCache]: Analyzing trace with hash 22294689, now seen corresponding path program 1 times [2025-04-30 10:35:37,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:37,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316149573] [2025-04-30 10:35:37,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:37,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:37,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:35:37,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:35:37,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:37,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:37,157 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-30 10:35:37,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:37,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316149573] [2025-04-30 10:35:37,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316149573] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:37,162 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765469845] [2025-04-30 10:35:37,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:37,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:37,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:37,164 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-30 10:35:37,166 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-30 10:35:37,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:35:37,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:35:37,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:37,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:37,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:35:37,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:37,286 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-30 10:35:37,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:37,299 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-30 10:35:37,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765469845] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:37,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:37,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-30 10:35:37,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142263045] [2025-04-30 10:35:37,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:37,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:37,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:37,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:37,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:37,303 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2025-04-30 10:35:37,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 128 transitions, 268 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 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-30 10:35:37,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:37,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2025-04-30 10:35:37,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:37,499 INFO L116 PetriNetUnfolderBase]: 64/327 cut-off events. [2025-04-30 10:35:37,499 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:37,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 327 events. 64/327 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1317 event pairs, 63 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 499. Up to 166 conditions per place. [2025-04-30 10:35:37,501 INFO L140 encePairwiseOnDemand]: 125/128 looper letters, 38 selfloop transitions, 5 changer transitions 0/131 dead transitions. [2025-04-30 10:35:37,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 131 transitions, 366 flow [2025-04-30 10:35:37,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:35:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:35:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 580 transitions. [2025-04-30 10:35:37,504 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2025-04-30 10:35:37,504 INFO L175 Difference]: Start difference. First operand has 132 places, 128 transitions, 268 flow. Second operand 6 states and 580 transitions. [2025-04-30 10:35:37,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 131 transitions, 366 flow [2025-04-30 10:35:37,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 131 transitions, 362 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:37,508 INFO L231 Difference]: Finished difference. Result has 139 places, 131 transitions, 300 flow [2025-04-30 10:35:37,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=139, PETRI_TRANSITIONS=131} [2025-04-30 10:35:37,509 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 9 predicate places. [2025-04-30 10:35:37,509 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 131 transitions, 300 flow [2025-04-30 10:35:37,510 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 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-30 10:35:37,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:37,510 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-04-30 10:35:37,517 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-30 10:35:37,710 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-30 10:35:37,710 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:37,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:37,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1541759378, now seen corresponding path program 2 times [2025-04-30 10:35:37,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:37,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007228119] [2025-04-30 10:35:37,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:35:37,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:37,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-04-30 10:35:37,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 7 statements. [2025-04-30 10:35:37,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:35:37,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:37,824 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-30 10:35:37,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:37,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007228119] [2025-04-30 10:35:37,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007228119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:37,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:37,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:37,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307202871] [2025-04-30 10:35:37,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:37,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:37,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:37,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:37,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:37,920 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 128 [2025-04-30 10:35:37,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 131 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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-30 10:35:37,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:37,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 128 [2025-04-30 10:35:37,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:38,027 INFO L116 PetriNetUnfolderBase]: 64/317 cut-off events. [2025-04-30 10:35:38,027 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:35:38,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 317 events. 64/317 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1276 event pairs, 63 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 485. Up to 165 conditions per place. [2025-04-30 10:35:38,031 INFO L140 encePairwiseOnDemand]: 108/128 looper letters, 38 selfloop transitions, 10 changer transitions 0/121 dead transitions. [2025-04-30 10:35:38,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 121 transitions, 376 flow [2025-04-30 10:35:38,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:38,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2025-04-30 10:35:38,034 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-04-30 10:35:38,035 INFO L175 Difference]: Start difference. First operand has 139 places, 131 transitions, 300 flow. Second operand 3 states and 276 transitions. [2025-04-30 10:35:38,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 121 transitions, 376 flow [2025-04-30 10:35:38,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 121 transitions, 362 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:38,039 INFO L231 Difference]: Finished difference. Result has 130 places, 121 transitions, 286 flow [2025-04-30 10:35:38,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=130, PETRI_TRANSITIONS=121} [2025-04-30 10:35:38,040 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 0 predicate places. [2025-04-30 10:35:38,040 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 121 transitions, 286 flow [2025-04-30 10:35:38,040 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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-30 10:35:38,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:38,041 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-04-30 10:35:38,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:35:38,041 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:38,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1541759377, now seen corresponding path program 1 times [2025-04-30 10:35:38,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:38,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624167427] [2025-04-30 10:35:38,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:38,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:38,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:35:38,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:35:38,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:38,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:38,178 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-30 10:35:38,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:38,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624167427] [2025-04-30 10:35:38,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624167427] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:38,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752185254] [2025-04-30 10:35:38,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:38,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:38,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:38,180 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-30 10:35:38,182 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-30 10:35:38,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:35:38,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:35:38,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:38,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:38,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:35:38,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:38,298 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-30 10:35:38,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:38,347 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-30 10:35:38,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752185254] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:38,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:38,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-30 10:35:38,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001588051] [2025-04-30 10:35:38,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:38,348 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:35:38,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:38,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:35:38,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:35:38,350 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2025-04-30 10:35:38,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 121 transitions, 286 flow. Second operand has 13 states, 13 states have (on average 90.07692307692308) internal successors, (1171), 13 states have internal predecessors, (1171), 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-30 10:35:38,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:38,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2025-04-30 10:35:38,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:38,482 INFO L116 PetriNetUnfolderBase]: 64/323 cut-off events. [2025-04-30 10:35:38,482 INFO L117 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-04-30 10:35:38,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 323 events. 64/323 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1265 event pairs, 63 based on Foata normal form. 6/253 useless extension candidates. Maximal degree in co-relation 490. Up to 166 conditions per place. [2025-04-30 10:35:38,486 INFO L140 encePairwiseOnDemand]: 125/128 looper letters, 38 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2025-04-30 10:35:38,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 127 transitions, 420 flow [2025-04-30 10:35:38,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:35:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:35:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1123 transitions. [2025-04-30 10:35:38,489 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7311197916666666 [2025-04-30 10:35:38,489 INFO L175 Difference]: Start difference. First operand has 130 places, 121 transitions, 286 flow. Second operand 12 states and 1123 transitions. [2025-04-30 10:35:38,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 127 transitions, 420 flow [2025-04-30 10:35:38,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 127 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:38,499 INFO L231 Difference]: Finished difference. Result has 145 places, 127 transitions, 350 flow [2025-04-30 10:35:38,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=350, PETRI_PLACES=145, PETRI_TRANSITIONS=127} [2025-04-30 10:35:38,502 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 15 predicate places. [2025-04-30 10:35:38,505 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 127 transitions, 350 flow [2025-04-30 10:35:38,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 90.07692307692308) internal successors, (1171), 13 states have internal predecessors, (1171), 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-30 10:35:38,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:38,505 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2025-04-30 10:35:38,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:35:38,706 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-30 10:35:38,706 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:38,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:38,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1331454351, now seen corresponding path program 2 times [2025-04-30 10:35:38,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:38,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473257901] [2025-04-30 10:35:38,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:35:38,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:38,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-30 10:35:38,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 13 statements. [2025-04-30 10:35:38,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:35:38,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:38,775 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-30 10:35:38,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:38,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473257901] [2025-04-30 10:35:38,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473257901] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:38,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:38,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:38,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540144326] [2025-04-30 10:35:38,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:38,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:38,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:38,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:38,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:38,883 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 128 [2025-04-30 10:35:38,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 127 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:38,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:38,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 128 [2025-04-30 10:35:38,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:38,991 INFO L116 PetriNetUnfolderBase]: 64/313 cut-off events. [2025-04-30 10:35:38,992 INFO L117 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-04-30 10:35:38,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 313 events. 64/313 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1252 event pairs, 63 based on Foata normal form. 5/247 useless extension candidates. Maximal degree in co-relation 476. Up to 171 conditions per place. [2025-04-30 10:35:38,993 INFO L140 encePairwiseOnDemand]: 108/128 looper letters, 39 selfloop transitions, 10 changer transitions 0/117 dead transitions. [2025-04-30 10:35:38,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 117 transitions, 428 flow [2025-04-30 10:35:38,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-04-30 10:35:38,994 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7447916666666666 [2025-04-30 10:35:38,995 INFO L175 Difference]: Start difference. First operand has 145 places, 127 transitions, 350 flow. Second operand 3 states and 286 transitions. [2025-04-30 10:35:38,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 117 transitions, 428 flow [2025-04-30 10:35:38,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 117 transitions, 380 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-04-30 10:35:39,000 INFO L231 Difference]: Finished difference. Result has 132 places, 117 transitions, 302 flow [2025-04-30 10:35:39,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=132, PETRI_TRANSITIONS=117} [2025-04-30 10:35:39,001 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-04-30 10:35:39,001 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 117 transitions, 302 flow [2025-04-30 10:35:39,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:39,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:39,002 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-04-30 10:35:39,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:35:39,002 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:39,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:39,003 INFO L85 PathProgramCache]: Analyzing trace with hash -372600563, now seen corresponding path program 1 times [2025-04-30 10:35:39,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:39,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558011757] [2025-04-30 10:35:39,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:39,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:39,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:35:39,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:35:39,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:39,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:39,262 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-30 10:35:39,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:39,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558011757] [2025-04-30 10:35:39,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558011757] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:39,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:39,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:35:39,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878575737] [2025-04-30 10:35:39,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:39,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:39,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:39,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:39,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:39,583 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 128 [2025-04-30 10:35:39,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 117 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 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-30 10:35:39,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:39,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 128 [2025-04-30 10:35:39,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:39,744 INFO L116 PetriNetUnfolderBase]: 73/321 cut-off events. [2025-04-30 10:35:39,745 INFO L117 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-04-30 10:35:39,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 321 events. 73/321 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1305 event pairs, 63 based on Foata normal form. 2/262 useless extension candidates. Maximal degree in co-relation 513. Up to 158 conditions per place. [2025-04-30 10:35:39,746 INFO L140 encePairwiseOnDemand]: 104/128 looper letters, 44 selfloop transitions, 12 changer transitions 3/114 dead transitions. [2025-04-30 10:35:39,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 114 transitions, 414 flow [2025-04-30 10:35:39,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2025-04-30 10:35:39,748 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.690625 [2025-04-30 10:35:39,748 INFO L175 Difference]: Start difference. First operand has 132 places, 117 transitions, 302 flow. Second operand 5 states and 442 transitions. [2025-04-30 10:35:39,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 114 transitions, 414 flow [2025-04-30 10:35:39,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 114 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:39,750 INFO L231 Difference]: Finished difference. Result has 122 places, 105 transitions, 282 flow [2025-04-30 10:35:39,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=122, PETRI_TRANSITIONS=105} [2025-04-30 10:35:39,751 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -8 predicate places. [2025-04-30 10:35:39,751 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 105 transitions, 282 flow [2025-04-30 10:35:39,751 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 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-30 10:35:39,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:39,751 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:39,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:35:39,752 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:39,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:39,752 INFO L85 PathProgramCache]: Analyzing trace with hash -232533180, now seen corresponding path program 1 times [2025-04-30 10:35:39,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:39,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482186815] [2025-04-30 10:35:39,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:39,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:39,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:35:39,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:35:39,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:39,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:40,023 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-30 10:35:40,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:40,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482186815] [2025-04-30 10:35:40,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482186815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:40,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:40,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:35:40,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962281881] [2025-04-30 10:35:40,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:40,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:40,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:40,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:40,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:40,439 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 128 [2025-04-30 10:35:40,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 105 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 63.42857142857143) internal successors, (444), 7 states have internal predecessors, (444), 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-30 10:35:40,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:40,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 128 [2025-04-30 10:35:40,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:40,620 INFO L116 PetriNetUnfolderBase]: 64/289 cut-off events. [2025-04-30 10:35:40,620 INFO L117 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-04-30 10:35:40,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 289 events. 64/289 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1119 event pairs, 63 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 484. Up to 166 conditions per place. [2025-04-30 10:35:40,622 INFO L140 encePairwiseOnDemand]: 107/128 looper letters, 45 selfloop transitions, 16 changer transitions 0/100 dead transitions. [2025-04-30 10:35:40,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 100 transitions, 394 flow [2025-04-30 10:35:40,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:35:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:35:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 552 transitions. [2025-04-30 10:35:40,625 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5390625 [2025-04-30 10:35:40,625 INFO L175 Difference]: Start difference. First operand has 122 places, 105 transitions, 282 flow. Second operand 8 states and 552 transitions. [2025-04-30 10:35:40,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 100 transitions, 394 flow [2025-04-30 10:35:40,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 100 transitions, 370 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:40,627 INFO L231 Difference]: Finished difference. Result has 120 places, 100 transitions, 280 flow [2025-04-30 10:35:40,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=280, PETRI_PLACES=120, PETRI_TRANSITIONS=100} [2025-04-30 10:35:40,628 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -10 predicate places. [2025-04-30 10:35:40,628 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 100 transitions, 280 flow [2025-04-30 10:35:40,629 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 63.42857142857143) internal successors, (444), 7 states have internal predecessors, (444), 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-30 10:35:40,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:40,630 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:40,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:35:40,630 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:40,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:40,631 INFO L85 PathProgramCache]: Analyzing trace with hash -232533179, now seen corresponding path program 1 times [2025-04-30 10:35:40,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:40,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721934513] [2025-04-30 10:35:40,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:40,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:40,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:35:40,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:35:40,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:40,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:41,023 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-30 10:35:41,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:41,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721934513] [2025-04-30 10:35:41,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721934513] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:41,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:41,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:35:41,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550300225] [2025-04-30 10:35:41,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:41,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:41,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:41,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:41,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:41,596 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 128 [2025-04-30 10:35:41,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 100 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 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-30 10:35:41,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:41,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 128 [2025-04-30 10:35:41,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:41,796 INFO L116 PetriNetUnfolderBase]: 64/287 cut-off events. [2025-04-30 10:35:41,796 INFO L117 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-04-30 10:35:41,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 287 events. 64/287 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1134 event pairs, 63 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 477. Up to 172 conditions per place. [2025-04-30 10:35:41,798 INFO L140 encePairwiseOnDemand]: 115/128 looper letters, 49 selfloop transitions, 11 changer transitions 0/98 dead transitions. [2025-04-30 10:35:41,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 98 transitions, 396 flow [2025-04-30 10:35:41,798 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:35:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:35:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 444 transitions. [2025-04-30 10:35:41,799 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4955357142857143 [2025-04-30 10:35:41,799 INFO L175 Difference]: Start difference. First operand has 120 places, 100 transitions, 280 flow. Second operand 7 states and 444 transitions. [2025-04-30 10:35:41,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 98 transitions, 396 flow [2025-04-30 10:35:41,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 98 transitions, 364 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-30 10:35:41,801 INFO L231 Difference]: Finished difference. Result has 117 places, 98 transitions, 266 flow [2025-04-30 10:35:41,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=266, PETRI_PLACES=117, PETRI_TRANSITIONS=98} [2025-04-30 10:35:41,802 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -13 predicate places. [2025-04-30 10:35:41,802 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 98 transitions, 266 flow [2025-04-30 10:35:41,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 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-30 10:35:41,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:41,807 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:41,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:35:41,807 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:41,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:41,807 INFO L85 PathProgramCache]: Analyzing trace with hash -126061778, now seen corresponding path program 1 times [2025-04-30 10:35:41,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:41,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879616326] [2025-04-30 10:35:41,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:41,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:41,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:35:41,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:35:41,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:41,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:41,988 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-30 10:35:41,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:41,988 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879616326] [2025-04-30 10:35:41,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879616326] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:41,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:41,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:41,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801945505] [2025-04-30 10:35:41,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:41,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:41,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:41,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:41,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:42,148 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2025-04-30 10:35:42,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 98 transitions, 266 flow. Second operand has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 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-30 10:35:42,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:42,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2025-04-30 10:35:42,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:42,280 INFO L116 PetriNetUnfolderBase]: 64/286 cut-off events. [2025-04-30 10:35:42,280 INFO L117 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-04-30 10:35:42,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 286 events. 64/286 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1127 event pairs, 63 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 463. Up to 171 conditions per place. [2025-04-30 10:35:42,281 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 41 selfloop transitions, 11 changer transitions 0/97 dead transitions. [2025-04-30 10:35:42,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 97 transitions, 368 flow [2025-04-30 10:35:42,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:42,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 418 transitions. [2025-04-30 10:35:42,283 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.653125 [2025-04-30 10:35:42,283 INFO L175 Difference]: Start difference. First operand has 117 places, 98 transitions, 266 flow. Second operand 5 states and 418 transitions. [2025-04-30 10:35:42,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 97 transitions, 368 flow [2025-04-30 10:35:42,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 97 transitions, 346 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-30 10:35:42,285 INFO L231 Difference]: Finished difference. Result has 114 places, 97 transitions, 264 flow [2025-04-30 10:35:42,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=114, PETRI_TRANSITIONS=97} [2025-04-30 10:35:42,285 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -16 predicate places. [2025-04-30 10:35:42,285 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 97 transitions, 264 flow [2025-04-30 10:35:42,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 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-30 10:35:42,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:42,286 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:42,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:35:42,286 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:42,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:42,286 INFO L85 PathProgramCache]: Analyzing trace with hash -126061779, now seen corresponding path program 1 times [2025-04-30 10:35:42,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:42,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412685419] [2025-04-30 10:35:42,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:42,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:42,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:35:42,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:35:42,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:42,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-04-30 10:35:42,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:42,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412685419] [2025-04-30 10:35:42,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412685419] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:42,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:42,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:42,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370144522] [2025-04-30 10:35:42,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:42,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:42,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:42,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:42,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:42,565 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 128 [2025-04-30 10:35:42,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 97 transitions, 264 flow. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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-30 10:35:42,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:42,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 128 [2025-04-30 10:35:42,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:42,676 INFO L116 PetriNetUnfolderBase]: 64/285 cut-off events. [2025-04-30 10:35:42,677 INFO L117 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-04-30 10:35:42,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 285 events. 64/285 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1126 event pairs, 63 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 467. Up to 171 conditions per place. [2025-04-30 10:35:42,678 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 46 selfloop transitions, 11 changer transitions 0/96 dead transitions. [2025-04-30 10:35:42,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 96 transitions, 376 flow [2025-04-30 10:35:42,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 398 transitions. [2025-04-30 10:35:42,679 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.621875 [2025-04-30 10:35:42,679 INFO L175 Difference]: Start difference. First operand has 114 places, 97 transitions, 264 flow. Second operand 5 states and 398 transitions. [2025-04-30 10:35:42,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 96 transitions, 376 flow [2025-04-30 10:35:42,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 96 transitions, 354 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:42,681 INFO L231 Difference]: Finished difference. Result has 113 places, 96 transitions, 262 flow [2025-04-30 10:35:42,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=113, PETRI_TRANSITIONS=96} [2025-04-30 10:35:42,682 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -17 predicate places. [2025-04-30 10:35:42,682 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 96 transitions, 262 flow [2025-04-30 10:35:42,682 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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-30 10:35:42,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:42,683 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:42,683 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:35:42,683 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:42,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:42,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1704250194, now seen corresponding path program 1 times [2025-04-30 10:35:42,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:42,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560386780] [2025-04-30 10:35:42,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:42,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:42,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:35:42,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:35:42,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:42,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:42,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:42,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560386780] [2025-04-30 10:35:42,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560386780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:42,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:42,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:42,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481907380] [2025-04-30 10:35:42,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:42,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:35:42,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:42,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:35:42,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:35:43,288 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 128 [2025-04-30 10:35:43,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 96 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 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-30 10:35:43,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:43,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 128 [2025-04-30 10:35:43,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:43,421 INFO L116 PetriNetUnfolderBase]: 73/309 cut-off events. [2025-04-30 10:35:43,422 INFO L117 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-04-30 10:35:43,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 309 events. 73/309 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1284 event pairs, 63 based on Foata normal form. 1/256 useless extension candidates. Maximal degree in co-relation 502. Up to 163 conditions per place. [2025-04-30 10:35:43,423 INFO L140 encePairwiseOnDemand]: 122/128 looper letters, 53 selfloop transitions, 3 changer transitions 3/102 dead transitions. [2025-04-30 10:35:43,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 102 transitions, 392 flow [2025-04-30 10:35:43,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:35:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:35:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 360 transitions. [2025-04-30 10:35:43,425 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.703125 [2025-04-30 10:35:43,425 INFO L175 Difference]: Start difference. First operand has 113 places, 96 transitions, 262 flow. Second operand 4 states and 360 transitions. [2025-04-30 10:35:43,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 102 transitions, 392 flow [2025-04-30 10:35:43,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 102 transitions, 370 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:43,427 INFO L231 Difference]: Finished difference. Result has 109 places, 93 transitions, 240 flow [2025-04-30 10:35:43,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=109, PETRI_TRANSITIONS=93} [2025-04-30 10:35:43,428 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -21 predicate places. [2025-04-30 10:35:43,428 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 93 transitions, 240 flow [2025-04-30 10:35:43,428 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 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-30 10:35:43,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:43,429 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:43,429 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:35:43,429 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:43,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:43,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1420189666, now seen corresponding path program 1 times [2025-04-30 10:35:43,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:43,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087235844] [2025-04-30 10:35:43,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:43,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:43,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:35:43,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:35:43,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:43,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-04-30 10:35:43,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:43,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087235844] [2025-04-30 10:35:43,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087235844] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:43,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:43,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:35:43,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800643434] [2025-04-30 10:35:43,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:43,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:43,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:43,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:43,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:44,257 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 128 [2025-04-30 10:35:44,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 93 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 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-30 10:35:44,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:44,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 128 [2025-04-30 10:35:44,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:44,414 INFO L116 PetriNetUnfolderBase]: 64/278 cut-off events. [2025-04-30 10:35:44,414 INFO L117 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-04-30 10:35:44,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 278 events. 64/278 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1114 event pairs, 54 based on Foata normal form. 2/237 useless extension candidates. Maximal degree in co-relation 459. Up to 132 conditions per place. [2025-04-30 10:35:44,415 INFO L140 encePairwiseOnDemand]: 110/128 looper letters, 48 selfloop transitions, 14 changer transitions 3/98 dead transitions. [2025-04-30 10:35:44,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 98 transitions, 380 flow [2025-04-30 10:35:44,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:35:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:35:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 451 transitions. [2025-04-30 10:35:44,417 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5033482142857143 [2025-04-30 10:35:44,417 INFO L175 Difference]: Start difference. First operand has 109 places, 93 transitions, 240 flow. Second operand 7 states and 451 transitions. [2025-04-30 10:35:44,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 98 transitions, 380 flow [2025-04-30 10:35:44,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 98 transitions, 374 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:35:44,438 INFO L231 Difference]: Finished difference. Result has 108 places, 89 transitions, 254 flow [2025-04-30 10:35:44,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=108, PETRI_TRANSITIONS=89} [2025-04-30 10:35:44,439 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -22 predicate places. [2025-04-30 10:35:44,439 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 89 transitions, 254 flow [2025-04-30 10:35:44,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 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-30 10:35:44,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:44,439 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:44,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:35:44,439 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:44,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1420189665, now seen corresponding path program 1 times [2025-04-30 10:35:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:44,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106487994] [2025-04-30 10:35:44,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:44,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:44,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:35:44,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:35:44,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:44,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-04-30 10:35:44,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:44,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106487994] [2025-04-30 10:35:44,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106487994] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:44,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:44,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:35:44,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720225660] [2025-04-30 10:35:44,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:44,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:44,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:44,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:44,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:45,016 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 128 [2025-04-30 10:35:45,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 89 transitions, 254 flow. Second operand has 7 states, 7 states have (on average 64.71428571428571) internal successors, (453), 7 states have internal predecessors, (453), 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-30 10:35:45,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:45,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 128 [2025-04-30 10:35:45,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:45,197 INFO L116 PetriNetUnfolderBase]: 64/276 cut-off events. [2025-04-30 10:35:45,198 INFO L117 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-04-30 10:35:45,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 276 events. 64/276 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1113 event pairs, 54 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 472. Up to 130 conditions per place. [2025-04-30 10:35:45,199 INFO L140 encePairwiseOnDemand]: 109/128 looper letters, 48 selfloop transitions, 17 changer transitions 3/96 dead transitions. [2025-04-30 10:35:45,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 96 transitions, 404 flow [2025-04-30 10:35:45,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:35:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:35:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 556 transitions. [2025-04-30 10:35:45,202 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.54296875 [2025-04-30 10:35:45,202 INFO L175 Difference]: Start difference. First operand has 108 places, 89 transitions, 254 flow. Second operand 8 states and 556 transitions. [2025-04-30 10:35:45,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 96 transitions, 404 flow [2025-04-30 10:35:45,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 96 transitions, 376 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-30 10:35:45,205 INFO L231 Difference]: Finished difference. Result has 107 places, 87 transitions, 256 flow [2025-04-30 10:35:45,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=256, PETRI_PLACES=107, PETRI_TRANSITIONS=87} [2025-04-30 10:35:45,205 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -23 predicate places. [2025-04-30 10:35:45,206 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 87 transitions, 256 flow [2025-04-30 10:35:45,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 64.71428571428571) internal successors, (453), 7 states have internal predecessors, (453), 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-30 10:35:45,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:45,206 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:45,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:35:45,206 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:45,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash -997306666, now seen corresponding path program 1 times [2025-04-30 10:35:45,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:45,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580805021] [2025-04-30 10:35:45,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:45,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:35:45,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:35:45,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:45,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-04-30 10:35:45,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:45,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580805021] [2025-04-30 10:35:45,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580805021] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:45,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:45,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:45,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143476685] [2025-04-30 10:35:45,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:45,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:45,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:45,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:45,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:45,520 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 128 [2025-04-30 10:35:45,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 87 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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-30 10:35:45,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:45,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 128 [2025-04-30 10:35:45,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:45,643 INFO L116 PetriNetUnfolderBase]: 64/275 cut-off events. [2025-04-30 10:35:45,644 INFO L117 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-04-30 10:35:45,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 275 events. 64/275 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1110 event pairs, 63 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 471. Up to 170 conditions per place. [2025-04-30 10:35:45,645 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 45 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2025-04-30 10:35:45,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 86 transitions, 366 flow [2025-04-30 10:35:45,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 397 transitions. [2025-04-30 10:35:45,647 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6203125 [2025-04-30 10:35:45,647 INFO L175 Difference]: Start difference. First operand has 107 places, 87 transitions, 256 flow. Second operand 5 states and 397 transitions. [2025-04-30 10:35:45,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 86 transitions, 366 flow [2025-04-30 10:35:45,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 86 transitions, 332 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-30 10:35:45,648 INFO L231 Difference]: Finished difference. Result has 103 places, 86 transitions, 242 flow [2025-04-30 10:35:45,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=103, PETRI_TRANSITIONS=86} [2025-04-30 10:35:45,649 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -27 predicate places. [2025-04-30 10:35:45,649 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 86 transitions, 242 flow [2025-04-30 10:35:45,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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-30 10:35:45,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:45,649 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:45,649 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:35:45,649 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:45,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:45,650 INFO L85 PathProgramCache]: Analyzing trace with hash -997306665, now seen corresponding path program 1 times [2025-04-30 10:35:45,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:45,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26876577] [2025-04-30 10:35:45,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:45,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:45,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:35:45,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:35:45,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:45,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-04-30 10:35:45,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:45,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26876577] [2025-04-30 10:35:45,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26876577] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:45,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:45,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:45,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446081831] [2025-04-30 10:35:45,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:45,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:45,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:45,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:45,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:46,083 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2025-04-30 10:35:46,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 86 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 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-30 10:35:46,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:46,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2025-04-30 10:35:46,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:46,193 INFO L116 PetriNetUnfolderBase]: 64/274 cut-off events. [2025-04-30 10:35:46,193 INFO L117 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-04-30 10:35:46,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 274 events. 64/274 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1104 event pairs, 63 based on Foata normal form. 1/232 useless extension candidates. Maximal degree in co-relation 450. Up to 170 conditions per place. [2025-04-30 10:35:46,194 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 40 selfloop transitions, 11 changer transitions 0/85 dead transitions. [2025-04-30 10:35:46,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 85 transitions, 342 flow [2025-04-30 10:35:46,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 417 transitions. [2025-04-30 10:35:46,195 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6515625 [2025-04-30 10:35:46,195 INFO L175 Difference]: Start difference. First operand has 103 places, 86 transitions, 242 flow. Second operand 5 states and 417 transitions. [2025-04-30 10:35:46,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 85 transitions, 342 flow [2025-04-30 10:35:46,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 85 transitions, 320 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:46,197 INFO L231 Difference]: Finished difference. Result has 102 places, 85 transitions, 240 flow [2025-04-30 10:35:46,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=102, PETRI_TRANSITIONS=85} [2025-04-30 10:35:46,197 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -28 predicate places. [2025-04-30 10:35:46,197 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 85 transitions, 240 flow [2025-04-30 10:35:46,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 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-30 10:35:46,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:46,198 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:46,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:35:46,198 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:35:46,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:46,198 INFO L85 PathProgramCache]: Analyzing trace with hash 635680504, now seen corresponding path program 1 times [2025-04-30 10:35:46,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:46,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972544607] [2025-04-30 10:35:46,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:46,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:46,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:35:46,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:35:46,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:46,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:47,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:47,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972544607] [2025-04-30 10:35:47,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972544607] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:47,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264427108] [2025-04-30 10:35:47,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:47,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:47,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:47,375 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-30 10:35:47,378 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-30 10:35:47,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:35:47,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:35:47,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:47,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:47,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-04-30 10:35:47,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:47,594 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:35:47,643 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-30 10:35:47,645 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-30 10:35:47,665 INFO L325 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2025-04-30 10:35:47,665 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 20 treesize of output 22 [2025-04-30 10:35:47,829 INFO L325 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2025-04-30 10:35:47,829 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 30 [2025-04-30 10:35:47,841 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:35:47,956 INFO L325 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-04-30 10:35:47,956 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2025-04-30 10:35:47,976 INFO L325 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-04-30 10:35:47,976 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2025-04-30 10:35:48,013 INFO L325 Elim1Store]: treesize reduction 106, result has 18.5 percent of original size [2025-04-30 10:35:48,013 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 38 [2025-04-30 10:35:48,034 INFO L325 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-04-30 10:35:48,034 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 19 treesize of output 19 [2025-04-30 10:35:48,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:35:48,351 INFO L325 Elim1Store]: treesize reduction 146, result has 14.1 percent of original size [2025-04-30 10:35:48,351 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 54 [2025-04-30 10:35:48,363 INFO L325 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-04-30 10:35:48,363 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2025-04-30 10:35:49,819 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:35:49,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 30 [2025-04-30 10:35:49,840 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-30 10:35:49,840 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2025-04-30 10:35:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:49,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:50,012 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:35:50,012 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 61 treesize of output 79 [2025-04-30 10:35:50,359 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-30 10:35:50,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 96 [2025-04-30 10:35:50,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 120 [2025-04-30 10:35:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:50,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264427108] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:50,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:50,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 39 [2025-04-30 10:35:50,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112474649] [2025-04-30 10:35:50,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:50,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-30 10:35:50,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:50,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-30 10:35:50,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1308, Unknown=1, NotChecked=0, Total=1560 [2025-04-30 10:36:07,461 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 128 [2025-04-30 10:36:07,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 85 transitions, 240 flow. Second operand has 40 states, 40 states have (on average 44.775) internal successors, (1791), 40 states have internal predecessors, (1791), 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-30 10:36:07,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:36:07,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 128 [2025-04-30 10:36:07,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:36:09,893 INFO L116 PetriNetUnfolderBase]: 64/272 cut-off events. [2025-04-30 10:36:09,893 INFO L117 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-04-30 10:36:09,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 272 events. 64/272 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1103 event pairs, 54 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 456. Up to 128 conditions per place. [2025-04-30 10:36:09,895 INFO L140 encePairwiseOnDemand]: 107/128 looper letters, 46 selfloop transitions, 19 changer transitions 3/92 dead transitions. [2025-04-30 10:36:09,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 92 transitions, 390 flow [2025-04-30 10:36:09,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:36:09,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-30 10:36:09,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 791 transitions. [2025-04-30 10:36:09,898 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3635110294117647 [2025-04-30 10:36:09,898 INFO L175 Difference]: Start difference. First operand has 102 places, 85 transitions, 240 flow. Second operand 17 states and 791 transitions. [2025-04-30 10:36:09,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 92 transitions, 390 flow [2025-04-30 10:36:09,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 92 transitions, 368 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:36:09,900 INFO L231 Difference]: Finished difference. Result has 112 places, 83 transitions, 252 flow [2025-04-30 10:36:09,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=252, PETRI_PLACES=112, PETRI_TRANSITIONS=83} [2025-04-30 10:36:09,901 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -18 predicate places. [2025-04-30 10:36:09,901 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 83 transitions, 252 flow [2025-04-30 10:36:09,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 44.775) internal successors, (1791), 40 states have internal predecessors, (1791), 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-30 10:36:09,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:36:09,903 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:36:09,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:36:10,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:36:10,103 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:36:10,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:36:10,104 INFO L85 PathProgramCache]: Analyzing trace with hash 635680503, now seen corresponding path program 1 times [2025-04-30 10:36:10,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:36:10,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852897773] [2025-04-30 10:36:10,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:36:10,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:36:10,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:36:10,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:36:10,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:36:10,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:36:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-04-30 10:36:10,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:36:10,549 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852897773] [2025-04-30 10:36:10,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852897773] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:36:10,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:36:10,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:36:10,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558171636] [2025-04-30 10:36:10,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:36:10,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:36:10,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:36:10,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:36:10,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:36:11,105 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 128 [2025-04-30 10:36:11,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 83 transitions, 252 flow. Second operand has 9 states, 9 states have (on average 74.77777777777777) internal successors, (673), 9 states have internal predecessors, (673), 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-30 10:36:11,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:36:11,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 128 [2025-04-30 10:36:11,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:36:11,308 INFO L116 PetriNetUnfolderBase]: 64/271 cut-off events. [2025-04-30 10:36:11,309 INFO L117 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-04-30 10:36:11,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 271 events. 64/271 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1096 event pairs, 54 based on Foata normal form. 1/231 useless extension candidates. Maximal degree in co-relation 471. Up to 133 conditions per place. [2025-04-30 10:36:11,310 INFO L140 encePairwiseOnDemand]: 115/128 looper letters, 52 selfloop transitions, 12 changer transitions 3/91 dead transitions. [2025-04-30 10:36:11,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 91 transitions, 402 flow [2025-04-30 10:36:11,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:36:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:36:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 634 transitions. [2025-04-30 10:36:11,312 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.619140625 [2025-04-30 10:36:11,312 INFO L175 Difference]: Start difference. First operand has 112 places, 83 transitions, 252 flow. Second operand 8 states and 634 transitions. [2025-04-30 10:36:11,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 91 transitions, 402 flow [2025-04-30 10:36:11,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 91 transitions, 364 flow, removed 0 selfloop flow, removed 16 redundant places. [2025-04-30 10:36:11,314 INFO L231 Difference]: Finished difference. Result has 102 places, 82 transitions, 236 flow [2025-04-30 10:36:11,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=236, PETRI_PLACES=102, PETRI_TRANSITIONS=82} [2025-04-30 10:36:11,315 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -28 predicate places. [2025-04-30 10:36:11,315 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 82 transitions, 236 flow [2025-04-30 10:36:11,315 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 74.77777777777777) internal successors, (673), 9 states have internal predecessors, (673), 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-30 10:36:11,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:36:11,316 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:36:11,316 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:36:11,316 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:36:11,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:36:11,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1003633822, now seen corresponding path program 1 times [2025-04-30 10:36:11,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:36:11,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083118408] [2025-04-30 10:36:11,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:36:11,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:36:11,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:36:11,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:36:11,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:36:11,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:36:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-04-30 10:36:11,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:36:11,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083118408] [2025-04-30 10:36:11,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083118408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:36:11,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:36:11,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:36:11,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191766589] [2025-04-30 10:36:11,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:36:11,418 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:36:11,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:36:11,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:36:11,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:36:11,605 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 128 [2025-04-30 10:36:11,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 82 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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-30 10:36:11,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:36:11,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 128 [2025-04-30 10:36:11,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:36:11,729 INFO L116 PetriNetUnfolderBase]: 73/287 cut-off events. [2025-04-30 10:36:11,729 INFO L117 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-04-30 10:36:11,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 287 events. 73/287 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1169 event pairs, 45 based on Foata normal form. 2/246 useless extension candidates. Maximal degree in co-relation 495. Up to 108 conditions per place. [2025-04-30 10:36:11,730 INFO L140 encePairwiseOnDemand]: 109/128 looper letters, 47 selfloop transitions, 17 changer transitions 0/89 dead transitions. [2025-04-30 10:36:11,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 89 transitions, 378 flow [2025-04-30 10:36:11,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:36:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:36:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 401 transitions. [2025-04-30 10:36:11,731 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6265625 [2025-04-30 10:36:11,731 INFO L175 Difference]: Start difference. First operand has 102 places, 82 transitions, 236 flow. Second operand 5 states and 401 transitions. [2025-04-30 10:36:11,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 89 transitions, 378 flow [2025-04-30 10:36:11,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 89 transitions, 354 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-30 10:36:11,733 INFO L231 Difference]: Finished difference. Result has 97 places, 80 transitions, 242 flow [2025-04-30 10:36:11,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=97, PETRI_TRANSITIONS=80} [2025-04-30 10:36:11,733 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -33 predicate places. [2025-04-30 10:36:11,733 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 80 transitions, 242 flow [2025-04-30 10:36:11,733 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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-30 10:36:11,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:36:11,733 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:36:11,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:36:11,734 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:36:11,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:36:11,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1003633823, now seen corresponding path program 1 times [2025-04-30 10:36:11,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:36:11,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353850381] [2025-04-30 10:36:11,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:36:11,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:36:11,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:36:11,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:36:11,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:36:11,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:36:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-04-30 10:36:11,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:36:11,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353850381] [2025-04-30 10:36:11,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353850381] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:36:11,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:36:11,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:36:11,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124078421] [2025-04-30 10:36:11,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:36:11,911 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:36:11,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:36:11,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:36:11,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:36:12,089 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 128 [2025-04-30 10:36:12,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 80 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 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-30 10:36:12,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:36:12,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 128 [2025-04-30 10:36:12,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:36:12,184 INFO L116 PetriNetUnfolderBase]: 73/274 cut-off events. [2025-04-30 10:36:12,184 INFO L117 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-04-30 10:36:12,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 274 events. 73/274 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1077 event pairs, 18 based on Foata normal form. 2/251 useless extension candidates. Maximal degree in co-relation 500. Up to 135 conditions per place. [2025-04-30 10:36:12,185 INFO L140 encePairwiseOnDemand]: 111/128 looper letters, 44 selfloop transitions, 15 changer transitions 0/87 dead transitions. [2025-04-30 10:36:12,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 87 transitions, 374 flow [2025-04-30 10:36:12,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:36:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:36:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2025-04-30 10:36:12,186 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6578125 [2025-04-30 10:36:12,186 INFO L175 Difference]: Start difference. First operand has 97 places, 80 transitions, 242 flow. Second operand 5 states and 421 transitions. [2025-04-30 10:36:12,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 87 transitions, 374 flow [2025-04-30 10:36:12,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 87 transitions, 340 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:36:12,187 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 234 flow [2025-04-30 10:36:12,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2025-04-30 10:36:12,188 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -35 predicate places. [2025-04-30 10:36:12,188 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 234 flow [2025-04-30 10:36:12,188 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 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-30 10:36:12,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:36:12,188 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:36:12,188 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:36:12,188 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:36:12,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:36:12,189 INFO L85 PathProgramCache]: Analyzing trace with hash -319050074, now seen corresponding path program 1 times [2025-04-30 10:36:12,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:36:12,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836639629] [2025-04-30 10:36:12,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:36:12,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:36:12,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:36:12,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:36:12,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:36:12,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:36:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-04-30 10:36:12,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:36:12,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836639629] [2025-04-30 10:36:12,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836639629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:36:12,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:36:12,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:36:12,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858777819] [2025-04-30 10:36:12,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:36:12,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:36:12,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:36:12,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:36:12,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:36:12,324 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 128 [2025-04-30 10:36:12,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-30 10:36:12,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:36:12,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 128 [2025-04-30 10:36:12,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:36:12,400 INFO L116 PetriNetUnfolderBase]: 71/277 cut-off events. [2025-04-30 10:36:12,400 INFO L117 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-04-30 10:36:12,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 277 events. 71/277 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1127 event pairs, 56 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 480. Up to 161 conditions per place. [2025-04-30 10:36:12,401 INFO L140 encePairwiseOnDemand]: 124/128 looper letters, 55 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2025-04-30 10:36:12,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 83 transitions, 360 flow [2025-04-30 10:36:12,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:36:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:36:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2025-04-30 10:36:12,401 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7994791666666666 [2025-04-30 10:36:12,401 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 234 flow. Second operand 3 states and 307 transitions. [2025-04-30 10:36:12,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 83 transitions, 360 flow [2025-04-30 10:36:12,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 83 transitions, 328 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:36:12,403 INFO L231 Difference]: Finished difference. Result has 91 places, 76 transitions, 204 flow [2025-04-30 10:36:12,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=91, PETRI_TRANSITIONS=76} [2025-04-30 10:36:12,404 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -39 predicate places. [2025-04-30 10:36:12,404 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 76 transitions, 204 flow [2025-04-30 10:36:12,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-30 10:36:12,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:36:12,404 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:36:12,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:36:12,404 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:36:12,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:36:12,405 INFO L85 PathProgramCache]: Analyzing trace with hash -319050073, now seen corresponding path program 1 times [2025-04-30 10:36:12,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:36:12,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673312708] [2025-04-30 10:36:12,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:36:12,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:36:12,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:36:12,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:36:12,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:36:12,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:36:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-04-30 10:36:12,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:36:12,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673312708] [2025-04-30 10:36:12,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673312708] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:36:12,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:36:12,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:36:12,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251246173] [2025-04-30 10:36:12,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:36:12,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:36:12,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:36:12,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:36:12,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:36:12,579 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 128 [2025-04-30 10:36:12,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 76 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-30 10:36:12,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:36:12,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 128 [2025-04-30 10:36:12,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:36:12,650 INFO L116 PetriNetUnfolderBase]: 64/254 cut-off events. [2025-04-30 10:36:12,650 INFO L117 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-04-30 10:36:12,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 254 events. 64/254 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 961 event pairs, 56 based on Foata normal form. 16/244 useless extension candidates. Maximal degree in co-relation 433. Up to 161 conditions per place. [2025-04-30 10:36:12,651 INFO L140 encePairwiseOnDemand]: 124/128 looper letters, 54 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2025-04-30 10:36:12,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 81 transitions, 326 flow [2025-04-30 10:36:12,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:36:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:36:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2025-04-30 10:36:12,652 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8046875 [2025-04-30 10:36:12,652 INFO L175 Difference]: Start difference. First operand has 91 places, 76 transitions, 204 flow. Second operand 3 states and 309 transitions. [2025-04-30 10:36:12,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 81 transitions, 326 flow [2025-04-30 10:36:12,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 81 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:36:12,653 INFO L231 Difference]: Finished difference. Result has 89 places, 74 transitions, 200 flow [2025-04-30 10:36:12,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=89, PETRI_TRANSITIONS=74} [2025-04-30 10:36:12,653 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -41 predicate places. [2025-04-30 10:36:12,653 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 74 transitions, 200 flow [2025-04-30 10:36:12,653 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-30 10:36:12,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:36:12,653 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:36:12,653 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:36:12,653 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:36:12,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:36:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1416662646, now seen corresponding path program 1 times [2025-04-30 10:36:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:36:12,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503126242] [2025-04-30 10:36:12,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:36:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:36:12,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:36:12,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:36:12,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:36:12,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:36:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-04-30 10:36:12,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:36:12,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503126242] [2025-04-30 10:36:12,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503126242] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:36:12,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:36:12,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:36:12,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404965581] [2025-04-30 10:36:12,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:36:12,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:36:12,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:36:12,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:36:12,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:36:13,121 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2025-04-30 10:36:13,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 74 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 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-30 10:36:13,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:36:13,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2025-04-30 10:36:13,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:36:13,224 INFO L116 PetriNetUnfolderBase]: 79/303 cut-off events. [2025-04-30 10:36:13,224 INFO L117 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-04-30 10:36:13,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 303 events. 79/303 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1280 event pairs, 30 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 521. Up to 163 conditions per place. [2025-04-30 10:36:13,226 INFO L140 encePairwiseOnDemand]: 117/128 looper letters, 58 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2025-04-30 10:36:13,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 370 flow [2025-04-30 10:36:13,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:36:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:36:13,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 510 transitions. [2025-04-30 10:36:13,228 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2025-04-30 10:36:13,228 INFO L175 Difference]: Start difference. First operand has 89 places, 74 transitions, 200 flow. Second operand 6 states and 510 transitions. [2025-04-30 10:36:13,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 370 flow [2025-04-30 10:36:13,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 88 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:36:13,230 INFO L231 Difference]: Finished difference. Result has 94 places, 79 transitions, 246 flow [2025-04-30 10:36:13,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=94, PETRI_TRANSITIONS=79} [2025-04-30 10:36:13,230 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -36 predicate places. [2025-04-30 10:36:13,230 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 79 transitions, 246 flow [2025-04-30 10:36:13,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 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-30 10:36:13,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:36:13,231 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:36:13,231 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:36:13,231 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:36:13,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:36:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1416662647, now seen corresponding path program 1 times [2025-04-30 10:36:13,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:36:13,231 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141496670] [2025-04-30 10:36:13,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:36:13,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:36:13,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:36:13,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:36:13,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:36:13,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:36:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-04-30 10:36:13,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:36:13,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141496670] [2025-04-30 10:36:13,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141496670] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:36:13,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:36:13,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:36:13,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892228476] [2025-04-30 10:36:13,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:36:13,341 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:36:13,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:36:13,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:36:13,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:36:13,595 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2025-04-30 10:36:13,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 79 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 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-30 10:36:13,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:36:13,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2025-04-30 10:36:13,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:36:13,708 INFO L116 PetriNetUnfolderBase]: 73/268 cut-off events. [2025-04-30 10:36:13,708 INFO L117 PetriNetUnfolderBase]: For 70/72 co-relation queries the response was YES. [2025-04-30 10:36:13,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 268 events. 73/268 cut-off events. For 70/72 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1004 event pairs, 47 based on Foata normal form. 10/255 useless extension candidates. Maximal degree in co-relation 523. Up to 131 conditions per place. [2025-04-30 10:36:13,709 INFO L140 encePairwiseOnDemand]: 117/128 looper letters, 59 selfloop transitions, 13 changer transitions 3/94 dead transitions. [2025-04-30 10:36:13,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 426 flow [2025-04-30 10:36:13,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:36:13,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:36:13,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions. [2025-04-30 10:36:13,710 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.66796875 [2025-04-30 10:36:13,710 INFO L175 Difference]: Start difference. First operand has 94 places, 79 transitions, 246 flow. Second operand 6 states and 513 transitions. [2025-04-30 10:36:13,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 426 flow [2025-04-30 10:36:13,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 94 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:36:13,712 INFO L231 Difference]: Finished difference. Result has 96 places, 78 transitions, 262 flow [2025-04-30 10:36:13,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=96, PETRI_TRANSITIONS=78} [2025-04-30 10:36:13,712 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -34 predicate places. [2025-04-30 10:36:13,712 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 78 transitions, 262 flow [2025-04-30 10:36:13,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 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-30 10:36:13,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:36:13,713 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:36:13,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:36:13,713 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-04-30 10:36:13,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:36:13,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1664418425, now seen corresponding path program 1 times [2025-04-30 10:36:13,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:36:13,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172650372] [2025-04-30 10:36:13,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:36:13,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:36:13,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-30 10:36:13,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:36:13,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:36:13,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:36:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-04-30 10:36:14,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:36:14,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172650372] [2025-04-30 10:36:14,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172650372] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:36:14,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026693233] [2025-04-30 10:36:14,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:36:14,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:36:14,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:36:14,167 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-30 10:36:14,168 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-30 10:36:14,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-30 10:36:14,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:36:14,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:36:14,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:36:14,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-04-30 10:36:14,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:36:14,469 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:36:14,469 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-30 10:36:14,474 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-30 10:36:14,522 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:36:14,523 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-30 10:36:14,527 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 19 treesize of output 1 [2025-04-30 10:36:14,537 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:36:14,537 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-30 10:36:14,620 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:36:14,621 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-30 10:36:14,624 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-30 10:36:14,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:36:14,691 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-30 10:36:14,704 INFO L325 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-04-30 10:36:14,704 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 30 treesize of output 18 [2025-04-30 10:36:14,763 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:36:14,763 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-30 10:36:14,773 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:36:14,773 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-30 10:36:14,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:36:14,870 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-30 10:36:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:36:14,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:36:15,035 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:36:15,035 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 37 treesize of output 55 [2025-04-30 10:36:15,121 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:36:15,121 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 37 treesize of output 55 [2025-04-30 10:36:15,150 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:36:15,150 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-30 10:36:15,210 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:36:15,210 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 37 treesize of output 55 [2025-04-30 10:36:15,241 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:36:15,241 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-30 10:36:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-04-30 10:36:15,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026693233] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:36:15,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:36:15,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 4] total 22 [2025-04-30 10:36:15,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642498657] [2025-04-30 10:36:15,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:36:15,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:36:15,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:36:15,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:36:15,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:36:19,411 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:36:23,889 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:36:27,987 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:36:32,327 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:36:36,955 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15