./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b018c23c1a90f89310fc4f08bf16b02660af5a398ccd47f63d319e7a234c112b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:55:40,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:55:40,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:55:40,615 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:55:40,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:55:40,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:55:40,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:55:40,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:55:40,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:55:40,637 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:55:40,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:55:40,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:55:40,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:55:40,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:55:40,638 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:55:40,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:55:40,639 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:55:40,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:55:40,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:55:40,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:55:40,639 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:55:40,639 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:55:40,640 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:55:40,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:55:40,640 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:55:40,640 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:55:40,640 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:55:40,640 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:55:40,640 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:55:40,641 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:55:40,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:40,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:40,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:40,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:40,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:55:40,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:40,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:40,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:40,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:40,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:55:40,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:55:40,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:55:40,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:55:40,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:55:40,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:55:40,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:55:40,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:55:40,643 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b018c23c1a90f89310fc4f08bf16b02660af5a398ccd47f63d319e7a234c112b [2025-01-10 00:55:40,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:55:40,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:55:40,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:55:40,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:55:40,949 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:55:40,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-01-10 00:55:42,307 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7db780092/b18a1ca7ecfe4eb2a4706d13d027ec6f/FLAGa6ae305dc [2025-01-10 00:55:42,616 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:55:42,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-01-10 00:55:42,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7db780092/b18a1ca7ecfe4eb2a4706d13d027ec6f/FLAGa6ae305dc [2025-01-10 00:55:42,654 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7db780092/b18a1ca7ecfe4eb2a4706d13d027ec6f [2025-01-10 00:55:42,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:55:42,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:55:42,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:42,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:55:42,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:55:42,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:42" (1/1) ... [2025-01-10 00:55:42,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5224d853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:42, skipping insertion in model container [2025-01-10 00:55:42,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:42" (1/1) ... [2025-01-10 00:55:42,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:55:43,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:43,251 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:55:43,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:43,385 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:55:43,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:43 WrapperNode [2025-01-10 00:55:43,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:43,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:43,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:55:43,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:55:43,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:43" (1/1) ... [2025-01-10 00:55:43,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:43" (1/1) ... [2025-01-10 00:55:43,450 INFO L138 Inliner]: procedures = 372, calls = 95, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 226 [2025-01-10 00:55:43,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:43,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:55:43,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:55:43,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:55:43,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:43" (1/1) ... [2025-01-10 00:55:43,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:43" (1/1) ... [2025-01-10 00:55:43,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:43" (1/1) ... [2025-01-10 00:55:43,501 INFO L175 MemorySlicer]: Split 90 memory accesses to 3 slices as follows [50, 24, 16]. 56 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 0, 10]. The 19 writes are split as follows [0, 18, 1]. [2025-01-10 00:55:43,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:43" (1/1) ... [2025-01-10 00:55:43,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:43" (1/1) ... [2025-01-10 00:55:43,522 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:43" (1/1) ... [2025-01-10 00:55:43,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:43" (1/1) ... [2025-01-10 00:55:43,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:43" (1/1) ... [2025-01-10 00:55:43,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:43" (1/1) ... [2025-01-10 00:55:43,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:43" (1/1) ... [2025-01-10 00:55:43,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:55:43,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:55:43,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:55:43,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:55:43,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:43" (1/1) ... [2025-01-10 00:55:43,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:43,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:43,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:55:43,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:55:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:55:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:55:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:55:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 00:55:43,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:55:43,614 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:55:43,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:55:43,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:55:43,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:55:43,616 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:55:43,790 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:55:43,792 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:55:44,383 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:55:44,383 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:55:44,755 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:55:44,755 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:55:44,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:44 BoogieIcfgContainer [2025-01-10 00:55:44,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:55:44,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:55:44,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:55:44,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:55:44,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:55:42" (1/3) ... [2025-01-10 00:55:44,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67dcf4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:44, skipping insertion in model container [2025-01-10 00:55:44,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:43" (2/3) ... [2025-01-10 00:55:44,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67dcf4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:44, skipping insertion in model container [2025-01-10 00:55:44,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:44" (3/3) ... [2025-01-10 00:55:44,767 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr.i [2025-01-10 00:55:44,783 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:55:44,785 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_13-arraycollapse_nr.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 61 error locations. [2025-01-10 00:55:44,785 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:55:44,856 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:55:44,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 107 transitions, 218 flow [2025-01-10 00:55:44,983 INFO L124 PetriNetUnfolderBase]: 1/106 cut-off events. [2025-01-10 00:55:44,984 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:44,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 106 events. 1/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 325 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2025-01-10 00:55:44,991 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 107 transitions, 218 flow [2025-01-10 00:55:44,995 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 106 transitions, 215 flow [2025-01-10 00:55:45,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:55:45,025 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23668d1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:55:45,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-01-10 00:55:45,030 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:55:45,031 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:55:45,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:45,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:45,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:55:45,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-10 00:55:45,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:45,039 INFO L85 PathProgramCache]: Analyzing trace with hash 653505, now seen corresponding path program 1 times [2025-01-10 00:55:45,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:45,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213441188] [2025-01-10 00:55:45,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:45,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:45,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:55:45,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:55:45,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:45,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:45,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:45,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:45,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213441188] [2025-01-10 00:55:45,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213441188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:45,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:45,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:45,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406910063] [2025-01-10 00:55:45,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:45,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:45,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:45,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:45,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 107 [2025-01-10 00:55:45,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 106 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:45,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:45,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 107 [2025-01-10 00:55:45,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:45,764 INFO L124 PetriNetUnfolderBase]: 64/293 cut-off events. [2025-01-10 00:55:45,764 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:45,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 293 events. 64/293 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1323 event pairs, 63 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 376. Up to 157 conditions per place. [2025-01-10 00:55:45,772 INFO L140 encePairwiseOnDemand]: 91/107 looper letters, 30 selfloop transitions, 8 changer transitions 0/98 dead transitions. [2025-01-10 00:55:45,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 98 transitions, 275 flow [2025-01-10 00:55:45,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2025-01-10 00:55:45,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7133956386292835 [2025-01-10 00:55:45,795 INFO L175 Difference]: Start difference. First operand has 109 places, 106 transitions, 215 flow. Second operand 3 states and 229 transitions. [2025-01-10 00:55:45,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 98 transitions, 275 flow [2025-01-10 00:55:45,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 98 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:45,805 INFO L231 Difference]: Finished difference. Result has 102 places, 98 transitions, 214 flow [2025-01-10 00:55:45,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=102, PETRI_TRANSITIONS=98} [2025-01-10 00:55:45,813 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -7 predicate places. [2025-01-10 00:55:45,814 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 98 transitions, 214 flow [2025-01-10 00:55:45,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:45,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:45,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:55:45,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:55:45,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-10 00:55:45,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:45,816 INFO L85 PathProgramCache]: Analyzing trace with hash 653506, now seen corresponding path program 1 times [2025-01-10 00:55:45,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:45,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169243222] [2025-01-10 00:55:45,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:45,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:45,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:55:45,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:55:45,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:45,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:45,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:45,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169243222] [2025-01-10 00:55:45,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169243222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:45,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:45,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:45,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254147000] [2025-01-10 00:55:45,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:45,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:45,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:45,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:45,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:46,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 107 [2025-01-10 00:55:46,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 98 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:46,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:46,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 107 [2025-01-10 00:55:46,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:46,240 INFO L124 PetriNetUnfolderBase]: 64/285 cut-off events. [2025-01-10 00:55:46,240 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 00:55:46,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 285 events. 64/285 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1284 event pairs, 63 based on Foata normal form. 8/226 useless extension candidates. Maximal degree in co-relation 395. Up to 157 conditions per place. [2025-01-10 00:55:46,242 INFO L140 encePairwiseOnDemand]: 91/107 looper letters, 26 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2025-01-10 00:55:46,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 266 flow [2025-01-10 00:55:46,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2025-01-10 00:55:46,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7383177570093458 [2025-01-10 00:55:46,245 INFO L175 Difference]: Start difference. First operand has 102 places, 98 transitions, 214 flow. Second operand 3 states and 237 transitions. [2025-01-10 00:55:46,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 266 flow [2025-01-10 00:55:46,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:46,247 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 198 flow [2025-01-10 00:55:46,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2025-01-10 00:55:46,250 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -15 predicate places. [2025-01-10 00:55:46,251 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 198 flow [2025-01-10 00:55:46,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:46,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:46,253 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:55:46,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:55:46,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-10 00:55:46,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:46,254 INFO L85 PathProgramCache]: Analyzing trace with hash 628038983, now seen corresponding path program 1 times [2025-01-10 00:55:46,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:46,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302921090] [2025-01-10 00:55:46,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:46,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:46,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:55:46,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:55:46,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:46,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:46,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:46,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302921090] [2025-01-10 00:55:46,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302921090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:46,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:46,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184352957] [2025-01-10 00:55:46,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:46,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:55:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:46,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:55:46,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:55:46,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 107 [2025-01-10 00:55:46,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:46,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:46,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 107 [2025-01-10 00:55:46,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:46,843 INFO L124 PetriNetUnfolderBase]: 73/305 cut-off events. [2025-01-10 00:55:46,843 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:55:46,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 305 events. 73/305 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1390 event pairs, 72 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 437. Up to 183 conditions per place. [2025-01-10 00:55:46,847 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 38 selfloop transitions, 1 changer transitions 0/84 dead transitions. [2025-01-10 00:55:46,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 84 transitions, 264 flow [2025-01-10 00:55:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:46,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 231 transitions. [2025-01-10 00:55:46,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.719626168224299 [2025-01-10 00:55:46,850 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 198 flow. Second operand 3 states and 231 transitions. [2025-01-10 00:55:46,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 84 transitions, 264 flow [2025-01-10 00:55:46,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 84 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:46,852 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 172 flow [2025-01-10 00:55:46,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2025-01-10 00:55:46,852 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -21 predicate places. [2025-01-10 00:55:46,852 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 172 flow [2025-01-10 00:55:46,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:46,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:46,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:55:46,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:55:46,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-10 00:55:46,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:46,857 INFO L85 PathProgramCache]: Analyzing trace with hash 628038984, now seen corresponding path program 1 times [2025-01-10 00:55:46,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:46,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431933713] [2025-01-10 00:55:46,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:46,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:46,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:55:46,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:55:46,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:46,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:47,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:47,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431933713] [2025-01-10 00:55:47,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431933713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:47,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:47,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:47,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665714334] [2025-01-10 00:55:47,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:47,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:47,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:47,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:47,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:47,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 107 [2025-01-10 00:55:47,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:47,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:47,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 107 [2025-01-10 00:55:47,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:47,507 INFO L124 PetriNetUnfolderBase]: 64/291 cut-off events. [2025-01-10 00:55:47,508 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:47,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 291 events. 64/291 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1224 event pairs, 63 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 460. Up to 163 conditions per place. [2025-01-10 00:55:47,511 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 37 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2025-01-10 00:55:47,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 91 transitions, 272 flow [2025-01-10 00:55:47,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:55:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:55:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 274 transitions. [2025-01-10 00:55:47,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6401869158878505 [2025-01-10 00:55:47,514 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 172 flow. Second operand 4 states and 274 transitions. [2025-01-10 00:55:47,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 91 transitions, 272 flow [2025-01-10 00:55:47,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 91 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:47,521 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 219 flow [2025-01-10 00:55:47,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2025-01-10 00:55:47,522 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -17 predicate places. [2025-01-10 00:55:47,522 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 219 flow [2025-01-10 00:55:47,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:47,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:47,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:47,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:55:47,523 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-10 00:55:47,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:47,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1942128999, now seen corresponding path program 1 times [2025-01-10 00:55:47,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:47,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688594537] [2025-01-10 00:55:47,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:47,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:47,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:55:47,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:55:47,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:47,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:47,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:47,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688594537] [2025-01-10 00:55:47,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688594537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:47,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:47,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:55:47,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183088126] [2025-01-10 00:55:47,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:47,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:47,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:47,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:47,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:48,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 107 [2025-01-10 00:55:48,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 219 flow. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:48,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:48,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 107 [2025-01-10 00:55:48,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:48,458 INFO L124 PetriNetUnfolderBase]: 64/285 cut-off events. [2025-01-10 00:55:48,458 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:55:48,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 285 events. 64/285 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1182 event pairs, 63 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 482. Up to 154 conditions per place. [2025-01-10 00:55:48,461 INFO L140 encePairwiseOnDemand]: 90/107 looper letters, 30 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2025-01-10 00:55:48,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 85 transitions, 307 flow [2025-01-10 00:55:48,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:55:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:55:48,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 463 transitions. [2025-01-10 00:55:48,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5408878504672897 [2025-01-10 00:55:48,464 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 219 flow. Second operand 8 states and 463 transitions. [2025-01-10 00:55:48,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 85 transitions, 307 flow [2025-01-10 00:55:48,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 85 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:48,469 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 245 flow [2025-01-10 00:55:48,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=245, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2025-01-10 00:55:48,470 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -15 predicate places. [2025-01-10 00:55:48,470 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 245 flow [2025-01-10 00:55:48,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:48,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:48,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:48,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:55:48,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-10 00:55:48,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:48,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1942129000, now seen corresponding path program 1 times [2025-01-10 00:55:48,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:48,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143560702] [2025-01-10 00:55:48,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:48,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:48,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:55:48,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:55:48,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:48,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:48,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:48,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143560702] [2025-01-10 00:55:48,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143560702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:48,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:55:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005167300] [2025-01-10 00:55:48,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:48,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:48,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:48,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:48,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:49,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 107 [2025-01-10 00:55:49,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:49,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:49,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 107 [2025-01-10 00:55:49,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:49,672 INFO L124 PetriNetUnfolderBase]: 64/281 cut-off events. [2025-01-10 00:55:49,672 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-10 00:55:49,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 281 events. 64/281 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1182 event pairs, 63 based on Foata normal form. 2/234 useless extension candidates. Maximal degree in co-relation 494. Up to 158 conditions per place. [2025-01-10 00:55:49,674 INFO L140 encePairwiseOnDemand]: 95/107 looper letters, 32 selfloop transitions, 15 changer transitions 0/83 dead transitions. [2025-01-10 00:55:49,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 83 transitions, 335 flow [2025-01-10 00:55:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:55:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:55:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 373 transitions. [2025-01-10 00:55:49,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4979973297730307 [2025-01-10 00:55:49,675 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 245 flow. Second operand 7 states and 373 transitions. [2025-01-10 00:55:49,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 83 transitions, 335 flow [2025-01-10 00:55:49,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 83 transitions, 299 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 00:55:49,678 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 235 flow [2025-01-10 00:55:49,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2025-01-10 00:55:49,678 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -18 predicate places. [2025-01-10 00:55:49,678 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 235 flow [2025-01-10 00:55:49,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:49,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:49,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:49,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:55:49,679 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-10 00:55:49,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:49,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1924783303, now seen corresponding path program 1 times [2025-01-10 00:55:49,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:49,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372487753] [2025-01-10 00:55:49,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:49,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:49,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:55:49,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:55:49,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:49,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:49,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:49,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372487753] [2025-01-10 00:55:49,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372487753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:49,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:49,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:49,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796041649] [2025-01-10 00:55:49,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:49,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:49,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:49,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:49,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:49,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 107 [2025-01-10 00:55:49,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:49,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:49,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 107 [2025-01-10 00:55:49,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:50,138 INFO L124 PetriNetUnfolderBase]: 64/279 cut-off events. [2025-01-10 00:55:50,138 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 00:55:50,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 279 events. 64/279 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1168 event pairs, 63 based on Foata normal form. 2/231 useless extension candidates. Maximal degree in co-relation 487. Up to 158 conditions per place. [2025-01-10 00:55:50,140 INFO L140 encePairwiseOnDemand]: 96/107 looper letters, 30 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2025-01-10 00:55:50,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 82 transitions, 323 flow [2025-01-10 00:55:50,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 331 transitions. [2025-01-10 00:55:50,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6186915887850467 [2025-01-10 00:55:50,141 INFO L175 Difference]: Start difference. First operand has 91 places, 83 transitions, 235 flow. Second operand 5 states and 331 transitions. [2025-01-10 00:55:50,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 82 transitions, 323 flow [2025-01-10 00:55:50,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 82 transitions, 293 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 00:55:50,143 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 233 flow [2025-01-10 00:55:50,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2025-01-10 00:55:50,144 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -21 predicate places. [2025-01-10 00:55:50,144 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 233 flow [2025-01-10 00:55:50,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:50,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:50,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:50,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:55:50,145 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-10 00:55:50,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:50,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1924783302, now seen corresponding path program 1 times [2025-01-10 00:55:50,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:50,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420610725] [2025-01-10 00:55:50,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:50,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:50,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:55:50,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:55:50,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:50,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:50,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:50,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420610725] [2025-01-10 00:55:50,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420610725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:50,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:50,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:50,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217680947] [2025-01-10 00:55:50,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:50,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:50,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:50,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:50,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:50,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 107 [2025-01-10 00:55:50,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:50,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:50,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 107 [2025-01-10 00:55:50,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:50,686 INFO L124 PetriNetUnfolderBase]: 64/277 cut-off events. [2025-01-10 00:55:50,686 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-10 00:55:50,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 277 events. 64/277 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1162 event pairs, 63 based on Foata normal form. 2/229 useless extension candidates. Maximal degree in co-relation 479. Up to 158 conditions per place. [2025-01-10 00:55:50,688 INFO L140 encePairwiseOnDemand]: 96/107 looper letters, 26 selfloop transitions, 15 changer transitions 0/81 dead transitions. [2025-01-10 00:55:50,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 81 transitions, 313 flow [2025-01-10 00:55:50,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 347 transitions. [2025-01-10 00:55:50,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6485981308411215 [2025-01-10 00:55:50,690 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 233 flow. Second operand 5 states and 347 transitions. [2025-01-10 00:55:50,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 81 transitions, 313 flow [2025-01-10 00:55:50,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 81 transitions, 283 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:50,694 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 231 flow [2025-01-10 00:55:50,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2025-01-10 00:55:50,694 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -22 predicate places. [2025-01-10 00:55:50,694 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 231 flow [2025-01-10 00:55:50,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:50,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:50,695 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:50,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:55:50,695 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-10 00:55:50,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1810147824, now seen corresponding path program 1 times [2025-01-10 00:55:50,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:50,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658022749] [2025-01-10 00:55:50,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:50,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:50,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:55:50,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:55:50,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:50,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:51,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658022749] [2025-01-10 00:55:51,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658022749] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:51,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753895348] [2025-01-10 00:55:51,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:51,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:51,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:51,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:51,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:55:51,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:55:51,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:55:51,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:51,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:51,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 00:55:51,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:51,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:51,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:51,439 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:55:51,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-10 00:55:51,473 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:55:51,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:55:51,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:51,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:51,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:51,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:51,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:51,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-01-10 00:55:52,013 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:55:52,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-10 00:55:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:52,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753895348] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:52,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:52,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 16 [2025-01-10 00:55:52,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039822681] [2025-01-10 00:55:52,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:52,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:55:52,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:52,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:55:52,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-01-10 00:55:54,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 107 [2025-01-10 00:55:54,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 231 flow. Second operand has 18 states, 18 states have (on average 57.833333333333336) internal successors, (1041), 18 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:54,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:54,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 107 [2025-01-10 00:55:54,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:54,955 INFO L124 PetriNetUnfolderBase]: 75/332 cut-off events. [2025-01-10 00:55:54,955 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-01-10 00:55:54,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 332 events. 75/332 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1445 event pairs, 72 based on Foata normal form. 6/281 useless extension candidates. Maximal degree in co-relation 602. Up to 178 conditions per place. [2025-01-10 00:55:54,957 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 46 selfloop transitions, 16 changer transitions 0/101 dead transitions. [2025-01-10 00:55:54,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 101 transitions, 459 flow [2025-01-10 00:55:54,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:55:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:55:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 573 transitions. [2025-01-10 00:55:54,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5950155763239875 [2025-01-10 00:55:54,961 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 231 flow. Second operand 9 states and 573 transitions. [2025-01-10 00:55:54,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 101 transitions, 459 flow [2025-01-10 00:55:54,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 101 transitions, 393 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:54,963 INFO L231 Difference]: Finished difference. Result has 95 places, 89 transitions, 305 flow [2025-01-10 00:55:54,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=305, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2025-01-10 00:55:54,964 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -14 predicate places. [2025-01-10 00:55:54,964 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 305 flow [2025-01-10 00:55:54,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 57.833333333333336) internal successors, (1041), 18 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:54,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:54,965 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 00:55:54,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:55:55,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:55,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-10 00:55:55,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:55,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1410314079, now seen corresponding path program 1 times [2025-01-10 00:55:55,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:55,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858643249] [2025-01-10 00:55:55,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:55,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:55,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 00:55:55,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 00:55:55,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:55,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:55,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:55,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858643249] [2025-01-10 00:55:55,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858643249] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:55,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713433767] [2025-01-10 00:55:55,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:55,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:55,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:55,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:55,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:55:55,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 00:55:55,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 00:55:55,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:55,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:55,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:55:55,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:55,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:55,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713433767] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:55,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:55,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-10 00:55:55,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019323636] [2025-01-10 00:55:55,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:55,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:55:55,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:55,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:55:55,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:55:55,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2025-01-10 00:55:55,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 305 flow. Second operand has 9 states, 9 states have (on average 77.55555555555556) internal successors, (698), 9 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:55,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:55,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2025-01-10 00:55:55,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:55,873 INFO L124 PetriNetUnfolderBase]: 64/318 cut-off events. [2025-01-10 00:55:55,874 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-01-10 00:55:55,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 318 events. 64/318 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1130 event pairs, 63 based on Foata normal form. 4/272 useless extension candidates. Maximal degree in co-relation 603. Up to 154 conditions per place. [2025-01-10 00:55:55,875 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 62 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2025-01-10 00:55:55,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 111 transitions, 541 flow [2025-01-10 00:55:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:55:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:55:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 658 transitions. [2025-01-10 00:55:55,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7686915887850467 [2025-01-10 00:55:55,878 INFO L175 Difference]: Start difference. First operand has 95 places, 89 transitions, 305 flow. Second operand 8 states and 658 transitions. [2025-01-10 00:55:55,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 111 transitions, 541 flow [2025-01-10 00:55:55,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 111 transitions, 521 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:55,882 INFO L231 Difference]: Finished difference. Result has 103 places, 90 transitions, 321 flow [2025-01-10 00:55:55,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=321, PETRI_PLACES=103, PETRI_TRANSITIONS=90} [2025-01-10 00:55:55,883 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -6 predicate places. [2025-01-10 00:55:55,883 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 90 transitions, 321 flow [2025-01-10 00:55:55,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 77.55555555555556) internal successors, (698), 9 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:55,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:55,885 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-01-10 00:55:55,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:55:56,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:56,086 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-10 00:55:56,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:56,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1652892648, now seen corresponding path program 2 times [2025-01-10 00:55:56,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:56,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711757519] [2025-01-10 00:55:56,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:55:56,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:56,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-10 00:55:56,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 00:55:56,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:55:56,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:58,011 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:58,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:58,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711757519] [2025-01-10 00:55:58,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711757519] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:58,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792553232] [2025-01-10 00:55:58,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:55:58,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:58,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:58,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:58,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:55:58,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-10 00:55:58,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 00:55:58,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:55:58,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:58,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-01-10 00:55:58,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:58,351 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:55:58,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:55:58,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:58,457 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:55:58,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-10 00:55:58,477 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:55:58,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:55:58,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 00:55:58,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2025-01-10 00:55:58,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:58,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:58,759 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:55:58,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-10 00:55:58,773 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:55:58,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:55:58,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:58,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:59,036 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:55:59,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:55:59,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:59,217 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:55:59,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-10 00:55:59,226 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:55:59,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:55:59,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 00:55:59,314 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:55:59,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:55:59,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:59,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2025-01-10 00:55:59,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:59,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:59,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:59,801 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:55:59,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-10 00:55:59,905 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:55:59,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-10 00:56:00,078 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:56:00,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-10 00:56:00,203 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:56:00,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-10 00:56:00,388 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:56:00,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-10 00:56:00,499 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:56:00,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-10 00:56:00,691 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:56:00,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-10 00:56:00,806 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:56:00,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-10 00:56:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:00,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792553232] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:56:00,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:56:00,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 15] total 53 [2025-01-10 00:56:00,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212601440] [2025-01-10 00:56:00,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:56:00,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-01-10 00:56:00,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:00,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-01-10 00:56:00,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=2504, Unknown=0, NotChecked=0, Total=2970 [2025-01-10 00:56:13,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 107 [2025-01-10 00:56:13,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 90 transitions, 321 flow. Second operand has 55 states, 55 states have (on average 57.74545454545454) internal successors, (3176), 55 states have internal predecessors, (3176), 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-01-10 00:56:13,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:13,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 107 [2025-01-10 00:56:13,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:15,726 INFO L124 PetriNetUnfolderBase]: 77/394 cut-off events. [2025-01-10 00:56:15,727 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2025-01-10 00:56:15,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 394 events. 77/394 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1532 event pairs, 72 based on Foata normal form. 6/346 useless extension candidates. Maximal degree in co-relation 821. Up to 180 conditions per place. [2025-01-10 00:56:15,729 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 70 selfloop transitions, 36 changer transitions 0/145 dead transitions. [2025-01-10 00:56:15,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 145 transitions, 867 flow [2025-01-10 00:56:15,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-10 00:56:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-01-10 00:56:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1736 transitions. [2025-01-10 00:56:15,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.559458588462778 [2025-01-10 00:56:15,752 INFO L175 Difference]: Start difference. First operand has 103 places, 90 transitions, 321 flow. Second operand 29 states and 1736 transitions. [2025-01-10 00:56:15,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 145 transitions, 867 flow [2025-01-10 00:56:15,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 145 transitions, 851 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-10 00:56:15,756 INFO L231 Difference]: Finished difference. Result has 140 places, 110 transitions, 629 flow [2025-01-10 00:56:15,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=629, PETRI_PLACES=140, PETRI_TRANSITIONS=110} [2025-01-10 00:56:15,757 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 31 predicate places. [2025-01-10 00:56:15,757 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 110 transitions, 629 flow [2025-01-10 00:56:15,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 57.74545454545454) internal successors, (3176), 55 states have internal predecessors, (3176), 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-01-10 00:56:15,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:15,760 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-01-10 00:56:15,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:56:15,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:15,961 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-10 00:56:15,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:15,961 INFO L85 PathProgramCache]: Analyzing trace with hash -144652479, now seen corresponding path program 2 times [2025-01-10 00:56:15,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:15,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805641795] [2025-01-10 00:56:15,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:56:15,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:16,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-01-10 00:56:16,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 00:56:16,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:56:16,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-01-10 00:56:16,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:16,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805641795] [2025-01-10 00:56:16,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805641795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:16,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:16,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:56:16,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609267338] [2025-01-10 00:56:16,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:16,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:56:16,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:16,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:56:16,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:56:16,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 107 [2025-01-10 00:56:16,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 110 transitions, 629 flow. Second operand has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 6 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:56:16,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:16,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 107 [2025-01-10 00:56:16,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:16,907 INFO L124 PetriNetUnfolderBase]: 116/562 cut-off events. [2025-01-10 00:56:16,907 INFO L125 PetriNetUnfolderBase]: For 585/585 co-relation queries the response was YES. [2025-01-10 00:56:16,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 562 events. 116/562 cut-off events. For 585/585 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2943 event pairs, 36 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 1170. Up to 161 conditions per place. [2025-01-10 00:56:16,910 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 59 selfloop transitions, 26 changer transitions 0/123 dead transitions. [2025-01-10 00:56:16,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 123 transitions, 825 flow [2025-01-10 00:56:16,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:56:16,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:56:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 438 transitions. [2025-01-10 00:56:16,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6822429906542056 [2025-01-10 00:56:16,912 INFO L175 Difference]: Start difference. First operand has 140 places, 110 transitions, 629 flow. Second operand 6 states and 438 transitions. [2025-01-10 00:56:16,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 123 transitions, 825 flow [2025-01-10 00:56:16,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 123 transitions, 701 flow, removed 39 selfloop flow, removed 11 redundant places. [2025-01-10 00:56:16,918 INFO L231 Difference]: Finished difference. Result has 134 places, 111 transitions, 572 flow [2025-01-10 00:56:16,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=572, PETRI_PLACES=134, PETRI_TRANSITIONS=111} [2025-01-10 00:56:16,918 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 25 predicate places. [2025-01-10 00:56:16,918 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 111 transitions, 572 flow [2025-01-10 00:56:16,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 6 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:56:16,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:16,919 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:16,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:56:16,919 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-10 00:56:16,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash -189258821, now seen corresponding path program 1 times [2025-01-10 00:56:16,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:16,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642474193] [2025-01-10 00:56:16,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:16,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:16,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 00:56:16,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 00:56:16,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:16,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:17,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:17,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642474193] [2025-01-10 00:56:17,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642474193] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:56:17,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152130239] [2025-01-10 00:56:17,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:17,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:17,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:17,252 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:56:17,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:56:17,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 00:56:17,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 00:56:17,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:17,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:17,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 00:56:17,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:56:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:17,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:56:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:17,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152130239] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:56:17,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:56:17,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-01-10 00:56:17,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898078278] [2025-01-10 00:56:17,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:56:17,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:56:17,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:17,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:56:17,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:56:17,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2025-01-10 00:56:17,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 111 transitions, 572 flow. Second operand has 13 states, 13 states have (on average 78.92307692307692) internal successors, (1026), 13 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:56:17,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:17,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2025-01-10 00:56:17,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:18,143 INFO L124 PetriNetUnfolderBase]: 95/481 cut-off events. [2025-01-10 00:56:18,144 INFO L125 PetriNetUnfolderBase]: For 491/492 co-relation queries the response was YES. [2025-01-10 00:56:18,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 481 events. 95/481 cut-off events. For 491/492 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2044 event pairs, 87 based on Foata normal form. 4/410 useless extension candidates. Maximal degree in co-relation 1031. Up to 220 conditions per place. [2025-01-10 00:56:18,147 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 89 selfloop transitions, 12 changer transitions 0/141 dead transitions. [2025-01-10 00:56:18,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 141 transitions, 926 flow [2025-01-10 00:56:18,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:56:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:56:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 978 transitions. [2025-01-10 00:56:18,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7616822429906542 [2025-01-10 00:56:18,151 INFO L175 Difference]: Start difference. First operand has 134 places, 111 transitions, 572 flow. Second operand 12 states and 978 transitions. [2025-01-10 00:56:18,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 141 transitions, 926 flow [2025-01-10 00:56:18,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 141 transitions, 890 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-10 00:56:18,159 INFO L231 Difference]: Finished difference. Result has 143 places, 108 transitions, 516 flow [2025-01-10 00:56:18,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=516, PETRI_PLACES=143, PETRI_TRANSITIONS=108} [2025-01-10 00:56:18,160 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 34 predicate places. [2025-01-10 00:56:18,160 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 108 transitions, 516 flow [2025-01-10 00:56:18,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 78.92307692307692) internal successors, (1026), 13 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:56:18,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:18,160 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2025-01-10 00:56:18,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 00:56:18,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 00:56:18,361 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-01-10 00:56:18,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:18,362 INFO L85 PathProgramCache]: Analyzing trace with hash -893496872, now seen corresponding path program 3 times [2025-01-10 00:56:18,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:18,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799951928] [2025-01-10 00:56:18,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:56:18,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:18,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes. [2025-01-10 00:56:19,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 00:56:19,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 00:56:19,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 409 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:56:19,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:19,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799951928] [2025-01-10 00:56:19,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799951928] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:56:19,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705277192] [2025-01-10 00:56:19,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:56:19,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:19,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:19,559 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:56:19,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:56:19,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes.