./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue_ok.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/pthread/queue_ok.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 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:36:44,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:36:44,310 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:36:44,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:36:44,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:36:44,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:36:44,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:36:44,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:36:44,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:36:44,333 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:36:44,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:36:44,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:36:44,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:36:44,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:36:44,334 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:36:44,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:36:44,334 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:36:44,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:36:44,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:36:44,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:36:44,334 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:36:44,334 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:36:44,334 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:36:44,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:36:44,334 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:36:44,335 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:36:44,335 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:36:44,335 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:36:44,335 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:36:44,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:36:44,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:36:44,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:36:44,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:36:44,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:36:44,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:36:44,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:36:44,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:36:44,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:36:44,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:36:44,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:36:44,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:36:44,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:36:44,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:36:44,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:36:44,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:36:44,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:36:44,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:36:44,336 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2025-01-10 00:36:44,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:36:44,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:36:44,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:36:44,567 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:36:44,567 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:36:44,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok.i [2025-01-10 00:36:45,731 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff6d9d6c1/63321cf973784406a427d8cf985b9fb9/FLAG9cae6885d [2025-01-10 00:36:46,084 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:36:46,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok.i [2025-01-10 00:36:46,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff6d9d6c1/63321cf973784406a427d8cf985b9fb9/FLAG9cae6885d [2025-01-10 00:36:46,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff6d9d6c1/63321cf973784406a427d8cf985b9fb9 [2025-01-10 00:36:46,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:36:46,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:36:46,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:36:46,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:36:46,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:36:46,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:36:46" (1/1) ... [2025-01-10 00:36:46,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5d3808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:46, skipping insertion in model container [2025-01-10 00:36:46,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:36:46" (1/1) ... [2025-01-10 00:36:46,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:36:46,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:36:46,629 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:36:46,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:36:46,740 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:36:46,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:46 WrapperNode [2025-01-10 00:36:46,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:36:46,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:36:46,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:36:46,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:36:46,748 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:36:46" (1/1) ... [2025-01-10 00:36:46,765 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:36:46" (1/1) ... [2025-01-10 00:36:46,786 INFO L138 Inliner]: procedures = 274, calls = 94, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 235 [2025-01-10 00:36:46,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:36:46,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:36:46,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:36:46,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:36:46,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:46" (1/1) ... [2025-01-10 00:36:46,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:46" (1/1) ... [2025-01-10 00:36:46,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:46" (1/1) ... [2025-01-10 00:36:46,816 INFO L175 MemorySlicer]: Split 75 memory accesses to 4 slices as follows [2, 5, 22, 46]. 61 percent of accesses are in the largest equivalence class. The 50 initializations are split as follows [2, 5, 20, 23]. The 11 writes are split as follows [0, 0, 1, 10]. [2025-01-10 00:36:46,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:46" (1/1) ... [2025-01-10 00:36:46,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:46" (1/1) ... [2025-01-10 00:36:46,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:46" (1/1) ... [2025-01-10 00:36:46,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:46" (1/1) ... [2025-01-10 00:36:46,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:46" (1/1) ... [2025-01-10 00:36:46,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:46" (1/1) ... [2025-01-10 00:36:46,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:46" (1/1) ... [2025-01-10 00:36:46,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:36:46,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:36:46,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:36:46,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:36:46,841 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:46" (1/1) ... [2025-01-10 00:36:46,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:36:46,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:36:46,869 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:36:46,872 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:36:46,887 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-10 00:36:46,887 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-10 00:36:46,888 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:36:46,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:36:46,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:36:46,889 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:36:46,997 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:36:46,999 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:36:47,382 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:36:47,382 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:36:47,621 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:36:47,622 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:36:47,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:36:47 BoogieIcfgContainer [2025-01-10 00:36:47,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:36:47,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:36:47,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:36:47,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:36:47,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:36:46" (1/3) ... [2025-01-10 00:36:47,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8345c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:36:47, skipping insertion in model container [2025-01-10 00:36:47,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:36:46" (2/3) ... [2025-01-10 00:36:47,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8345c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:36:47, skipping insertion in model container [2025-01-10 00:36:47,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:36:47" (3/3) ... [2025-01-10 00:36:47,631 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2025-01-10 00:36:47,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:36:47,645 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok.i that has 3 procedures, 119 locations, 1 initial locations, 2 loop locations, and 53 error locations. [2025-01-10 00:36:47,645 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:36:47,719 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:36:47,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 129 transitions, 272 flow [2025-01-10 00:36:47,805 INFO L124 PetriNetUnfolderBase]: 11/127 cut-off events. [2025-01-10 00:36:47,807 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:36:47,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 127 events. 11/127 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 409 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 99. Up to 3 conditions per place. [2025-01-10 00:36:47,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 129 transitions, 272 flow [2025-01-10 00:36:47,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 126 transitions, 264 flow [2025-01-10 00:36:47,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:36:47,835 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;@7078c585, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:36:47,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2025-01-10 00:36:47,840 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:36:47,840 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-01-10 00:36:47,840 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:36:47,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:47,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:36:47,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:36:47,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:47,846 INFO L85 PathProgramCache]: Analyzing trace with hash 20455, now seen corresponding path program 1 times [2025-01-10 00:36:47,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:47,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150134411] [2025-01-10 00:36:47,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:47,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:47,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:36:47,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:36:47,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:47,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:48,102 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:36:48,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:48,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150134411] [2025-01-10 00:36:48,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150134411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:48,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:48,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:36:48,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018022046] [2025-01-10 00:36:48,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:48,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:48,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:48,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:48,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:48,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2025-01-10 00:36:48,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 126 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:36:48,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:48,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2025-01-10 00:36:48,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:48,614 INFO L124 PetriNetUnfolderBase]: 1087/2983 cut-off events. [2025-01-10 00:36:48,615 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-01-10 00:36:48,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 2983 events. 1087/2983 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23594 event pairs, 837 based on Foata normal form. 68/2108 useless extension candidates. Maximal degree in co-relation 4566. Up to 1686 conditions per place. [2025-01-10 00:36:48,640 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2025-01-10 00:36:48,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 334 flow [2025-01-10 00:36:48,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-01-10 00:36:48,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6873385012919897 [2025-01-10 00:36:48,651 INFO L175 Difference]: Start difference. First operand has 122 places, 126 transitions, 264 flow. Second operand 3 states and 266 transitions. [2025-01-10 00:36:48,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 334 flow [2025-01-10 00:36:48,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 326 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:36:48,658 INFO L231 Difference]: Finished difference. Result has 112 places, 114 transitions, 236 flow [2025-01-10 00:36:48,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=112, PETRI_TRANSITIONS=114} [2025-01-10 00:36:48,666 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -10 predicate places. [2025-01-10 00:36:48,666 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 114 transitions, 236 flow [2025-01-10 00:36:48,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:36:48,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:48,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:36:48,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:36:48,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:36:48,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash 20456, now seen corresponding path program 1 times [2025-01-10 00:36:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:48,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491833090] [2025-01-10 00:36:48,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:48,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:48,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:36:48,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:36:48,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:48,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:48,830 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:36:48,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:48,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491833090] [2025-01-10 00:36:48,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491833090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:48,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:48,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:36:48,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92542402] [2025-01-10 00:36:48,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:48,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:48,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:48,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:48,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:48,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2025-01-10 00:36:48,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 114 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:36:48,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:48,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2025-01-10 00:36:48,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:49,270 INFO L124 PetriNetUnfolderBase]: 1087/2980 cut-off events. [2025-01-10 00:36:49,271 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 00:36:49,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4686 conditions, 2980 events. 1087/2980 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23568 event pairs, 837 based on Foata normal form. 3/2042 useless extension candidates. Maximal degree in co-relation 4675. Up to 1686 conditions per place. [2025-01-10 00:36:49,289 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-01-10 00:36:49,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 324 flow [2025-01-10 00:36:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-01-10 00:36:49,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6795865633074936 [2025-01-10 00:36:49,291 INFO L175 Difference]: Start difference. First operand has 112 places, 114 transitions, 236 flow. Second operand 3 states and 263 transitions. [2025-01-10 00:36:49,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 324 flow [2025-01-10 00:36:49,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:36:49,296 INFO L231 Difference]: Finished difference. Result has 109 places, 111 transitions, 230 flow [2025-01-10 00:36:49,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=109, PETRI_TRANSITIONS=111} [2025-01-10 00:36:49,297 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -13 predicate places. [2025-01-10 00:36:49,297 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 111 transitions, 230 flow [2025-01-10 00:36:49,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:36:49,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:49,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:36:49,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:36:49,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:36:49,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:49,298 INFO L85 PathProgramCache]: Analyzing trace with hash 609993945, now seen corresponding path program 1 times [2025-01-10 00:36:49,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:49,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571374548] [2025-01-10 00:36:49,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:49,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:49,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:36:49,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:36:49,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:49,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:49,413 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:36:49,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:49,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571374548] [2025-01-10 00:36:49,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571374548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:49,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:49,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:49,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449612327] [2025-01-10 00:36:49,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:49,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:49,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:49,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:49,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:49,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2025-01-10 00:36:49,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 111 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 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:36:49,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:49,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2025-01-10 00:36:49,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:49,730 INFO L124 PetriNetUnfolderBase]: 1087/2978 cut-off events. [2025-01-10 00:36:49,730 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 00:36:49,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4684 conditions, 2978 events. 1087/2978 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23566 event pairs, 837 based on Foata normal form. 1/2040 useless extension candidates. Maximal degree in co-relation 4673. Up to 1685 conditions per place. [2025-01-10 00:36:49,744 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-01-10 00:36:49,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 320 flow [2025-01-10 00:36:49,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2025-01-10 00:36:49,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6531007751937985 [2025-01-10 00:36:49,747 INFO L175 Difference]: Start difference. First operand has 109 places, 111 transitions, 230 flow. Second operand 4 states and 337 transitions. [2025-01-10 00:36:49,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 320 flow [2025-01-10 00:36:49,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:36:49,750 INFO L231 Difference]: Finished difference. Result has 108 places, 109 transitions, 228 flow [2025-01-10 00:36:49,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=108, PETRI_TRANSITIONS=109} [2025-01-10 00:36:49,751 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -14 predicate places. [2025-01-10 00:36:49,751 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 109 transitions, 228 flow [2025-01-10 00:36:49,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 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:36:49,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:49,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:36:49,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:36:49,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:36:49,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:49,753 INFO L85 PathProgramCache]: Analyzing trace with hash 609993946, now seen corresponding path program 1 times [2025-01-10 00:36:49,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:49,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249493255] [2025-01-10 00:36:49,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:49,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:49,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:36:49,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:36:49,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:49,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:49,954 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:36:49,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:49,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249493255] [2025-01-10 00:36:49,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249493255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:49,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:49,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:36:49,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890529530] [2025-01-10 00:36:49,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:49,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:36:49,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:49,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:36:49,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:36:50,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2025-01-10 00:36:50,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 109 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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:36:50,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:50,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2025-01-10 00:36:50,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:50,412 INFO L124 PetriNetUnfolderBase]: 1087/2976 cut-off events. [2025-01-10 00:36:50,412 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 00:36:50,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4684 conditions, 2976 events. 1087/2976 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23552 event pairs, 837 based on Foata normal form. 2/2040 useless extension candidates. Maximal degree in co-relation 4668. Up to 1685 conditions per place. [2025-01-10 00:36:50,425 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 45 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2025-01-10 00:36:50,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 320 flow [2025-01-10 00:36:50,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:50,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2025-01-10 00:36:50,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6472868217054264 [2025-01-10 00:36:50,427 INFO L175 Difference]: Start difference. First operand has 108 places, 109 transitions, 228 flow. Second operand 4 states and 334 transitions. [2025-01-10 00:36:50,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 320 flow [2025-01-10 00:36:50,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 107 transitions, 314 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:50,430 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 224 flow [2025-01-10 00:36:50,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=106, PETRI_TRANSITIONS=107} [2025-01-10 00:36:50,431 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2025-01-10 00:36:50,431 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 224 flow [2025-01-10 00:36:50,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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:36:50,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:50,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:50,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:36:50,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:36:50,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash 814395360, now seen corresponding path program 1 times [2025-01-10 00:36:50,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322827705] [2025-01-10 00:36:50,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:50,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:36:50,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:36:50,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:50,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:50,543 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:36:50,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:50,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322827705] [2025-01-10 00:36:50,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322827705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:50,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:50,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:50,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509320553] [2025-01-10 00:36:50,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:50,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:50,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:50,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:50,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:50,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 129 [2025-01-10 00:36:50,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 107 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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:36:50,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:50,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 129 [2025-01-10 00:36:50,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:50,914 INFO L124 PetriNetUnfolderBase]: 1044/2621 cut-off events. [2025-01-10 00:36:50,914 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 00:36:50,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4283 conditions, 2621 events. 1044/2621 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 19448 event pairs, 424 based on Foata normal form. 120/2115 useless extension candidates. Maximal degree in co-relation 4268. Up to 879 conditions per place. [2025-01-10 00:36:50,926 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 67 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2025-01-10 00:36:50,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 122 transitions, 395 flow [2025-01-10 00:36:50,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2025-01-10 00:36:50,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6627906976744186 [2025-01-10 00:36:50,928 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 224 flow. Second operand 4 states and 342 transitions. [2025-01-10 00:36:50,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 122 transitions, 395 flow [2025-01-10 00:36:50,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 122 transitions, 389 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:50,930 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 208 flow [2025-01-10 00:36:50,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2025-01-10 00:36:50,931 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2025-01-10 00:36:50,931 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 208 flow [2025-01-10 00:36:50,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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:36:50,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:50,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:50,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:36:50,931 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:36:50,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:50,932 INFO L85 PathProgramCache]: Analyzing trace with hash 814395361, now seen corresponding path program 1 times [2025-01-10 00:36:50,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:50,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327128979] [2025-01-10 00:36:50,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:50,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:50,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:36:50,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:36:50,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:50,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:51,211 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:36:51,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:51,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327128979] [2025-01-10 00:36:51,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327128979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:51,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:51,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:36:51,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575937163] [2025-01-10 00:36:51,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:51,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:36:51,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:51,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:36:51,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:36:51,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 129 [2025-01-10 00:36:51,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 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:36:51,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:51,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 129 [2025-01-10 00:36:51,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:51,701 INFO L124 PetriNetUnfolderBase]: 1044/2353 cut-off events. [2025-01-10 00:36:51,701 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-01-10 00:36:51,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4093 conditions, 2353 events. 1044/2353 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 15841 event pairs, 424 based on Foata normal form. 120/1999 useless extension candidates. Maximal degree in co-relation 1949. Up to 878 conditions per place. [2025-01-10 00:36:51,708 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 66 selfloop transitions, 4 changer transitions 0/115 dead transitions. [2025-01-10 00:36:51,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 115 transitions, 381 flow [2025-01-10 00:36:51,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:36:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:36:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2025-01-10 00:36:51,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6387596899224807 [2025-01-10 00:36:51,710 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 208 flow. Second operand 5 states and 412 transitions. [2025-01-10 00:36:51,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 115 transitions, 381 flow [2025-01-10 00:36:51,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 115 transitions, 375 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:51,711 INFO L231 Difference]: Finished difference. Result has 92 places, 92 transitions, 196 flow [2025-01-10 00:36:51,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=92, PETRI_TRANSITIONS=92} [2025-01-10 00:36:51,712 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -30 predicate places. [2025-01-10 00:36:51,712 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 92 transitions, 196 flow [2025-01-10 00:36:51,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 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:36:51,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:51,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:51,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:36:51,712 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:36:51,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:51,712 INFO L85 PathProgramCache]: Analyzing trace with hash -523546921, now seen corresponding path program 1 times [2025-01-10 00:36:51,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:51,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715860293] [2025-01-10 00:36:51,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:51,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:51,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:36:51,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:36:51,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:51,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:52,048 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:36:52,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:52,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715860293] [2025-01-10 00:36:52,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715860293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:52,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:52,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:36:52,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297734363] [2025-01-10 00:36:52,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:52,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:36:52,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:52,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:36:52,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:36:52,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 129 [2025-01-10 00:36:52,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 92 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 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:36:52,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:52,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 129 [2025-01-10 00:36:52,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:52,902 INFO L124 PetriNetUnfolderBase]: 2063/4250 cut-off events. [2025-01-10 00:36:52,902 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-01-10 00:36:52,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7672 conditions, 4250 events. 2063/4250 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 29501 event pairs, 287 based on Foata normal form. 0/3446 useless extension candidates. Maximal degree in co-relation 2867. Up to 2157 conditions per place. [2025-01-10 00:36:52,916 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 132 selfloop transitions, 11 changer transitions 0/182 dead transitions. [2025-01-10 00:36:52,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 182 transitions, 669 flow [2025-01-10 00:36:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:36:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:36:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 551 transitions. [2025-01-10 00:36:52,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6101882613510521 [2025-01-10 00:36:52,921 INFO L175 Difference]: Start difference. First operand has 92 places, 92 transitions, 196 flow. Second operand 7 states and 551 transitions. [2025-01-10 00:36:52,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 182 transitions, 669 flow [2025-01-10 00:36:52,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 182 transitions, 659 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:36:52,928 INFO L231 Difference]: Finished difference. Result has 98 places, 102 transitions, 262 flow [2025-01-10 00:36:52,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=98, PETRI_TRANSITIONS=102} [2025-01-10 00:36:52,929 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2025-01-10 00:36:52,930 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 102 transitions, 262 flow [2025-01-10 00:36:52,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 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:36:52,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:52,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:52,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:36:52,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:36:52,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:52,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2034895501, now seen corresponding path program 1 times [2025-01-10 00:36:52,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:52,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927193133] [2025-01-10 00:36:52,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:52,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:52,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:36:52,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:36:52,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:52,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:53,016 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:36:53,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927193133] [2025-01-10 00:36:53,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927193133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:53,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:53,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:53,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368859041] [2025-01-10 00:36:53,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:53,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:53,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:53,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:53,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:53,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2025-01-10 00:36:53,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 102 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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:36:53,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:53,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2025-01-10 00:36:53,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:53,404 INFO L124 PetriNetUnfolderBase]: 1788/4083 cut-off events. [2025-01-10 00:36:53,404 INFO L125 PetriNetUnfolderBase]: For 288/288 co-relation queries the response was YES. [2025-01-10 00:36:53,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7510 conditions, 4083 events. 1788/4083 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 30795 event pairs, 1242 based on Foata normal form. 64/3283 useless extension candidates. Maximal degree in co-relation 7125. Up to 2610 conditions per place. [2025-01-10 00:36:53,419 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 74 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2025-01-10 00:36:53,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 122 transitions, 477 flow [2025-01-10 00:36:53,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 355 transitions. [2025-01-10 00:36:53,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.687984496124031 [2025-01-10 00:36:53,422 INFO L175 Difference]: Start difference. First operand has 98 places, 102 transitions, 262 flow. Second operand 4 states and 355 transitions. [2025-01-10 00:36:53,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 122 transitions, 477 flow [2025-01-10 00:36:53,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 122 transitions, 475 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:36:53,428 INFO L231 Difference]: Finished difference. Result has 98 places, 100 transitions, 262 flow [2025-01-10 00:36:53,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=98, PETRI_TRANSITIONS=100} [2025-01-10 00:36:53,428 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2025-01-10 00:36:53,428 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 100 transitions, 262 flow [2025-01-10 00:36:53,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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:36:53,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:53,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:53,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:36:53,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:36:53,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:53,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2034895502, now seen corresponding path program 1 times [2025-01-10 00:36:53,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:53,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936875174] [2025-01-10 00:36:53,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:53,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:53,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:36:53,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:36:53,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:53,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:53,526 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:36:53,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:53,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936875174] [2025-01-10 00:36:53,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936875174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:53,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:53,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:53,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367922518] [2025-01-10 00:36:53,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:53,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:53,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:53,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:53,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:53,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2025-01-10 00:36:53,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 100 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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:36:53,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:53,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2025-01-10 00:36:53,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:53,714 INFO L124 PetriNetUnfolderBase]: 692/1626 cut-off events. [2025-01-10 00:36:53,715 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-01-10 00:36:53,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3117 conditions, 1626 events. 692/1626 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 9863 event pairs, 446 based on Foata normal form. 45/1450 useless extension candidates. Maximal degree in co-relation 3073. Up to 693 conditions per place. [2025-01-10 00:36:53,720 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 59 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2025-01-10 00:36:53,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 107 transitions, 391 flow [2025-01-10 00:36:53,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2025-01-10 00:36:53,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7260981912144703 [2025-01-10 00:36:53,721 INFO L175 Difference]: Start difference. First operand has 98 places, 100 transitions, 262 flow. Second operand 3 states and 281 transitions. [2025-01-10 00:36:53,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 107 transitions, 391 flow [2025-01-10 00:36:53,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 107 transitions, 383 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 00:36:53,723 INFO L231 Difference]: Finished difference. Result has 96 places, 96 transitions, 245 flow [2025-01-10 00:36:53,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=96, PETRI_TRANSITIONS=96} [2025-01-10 00:36:53,724 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -26 predicate places. [2025-01-10 00:36:53,724 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 96 transitions, 245 flow [2025-01-10 00:36:53,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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:36:53,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:53,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:53,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:36:53,725 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:36:53,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:53,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1614173518, now seen corresponding path program 1 times [2025-01-10 00:36:53,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:53,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457345444] [2025-01-10 00:36:53,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:53,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:53,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:36:53,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:36:53,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:53,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:53,773 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:36:53,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:53,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457345444] [2025-01-10 00:36:53,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457345444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:53,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:53,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:36:53,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614921524] [2025-01-10 00:36:53,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:53,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:53,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:53,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:53,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:53,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2025-01-10 00:36:53,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 96 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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:36:53,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:53,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2025-01-10 00:36:53,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:53,907 INFO L124 PetriNetUnfolderBase]: 572/1370 cut-off events. [2025-01-10 00:36:53,908 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-01-10 00:36:53,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 1370 events. 572/1370 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7431 event pairs, 380 based on Foata normal form. 12/1196 useless extension candidates. Maximal degree in co-relation 1700. Up to 753 conditions per place. [2025-01-10 00:36:53,912 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 62 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2025-01-10 00:36:53,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 109 transitions, 397 flow [2025-01-10 00:36:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2025-01-10 00:36:53,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7416020671834626 [2025-01-10 00:36:53,914 INFO L175 Difference]: Start difference. First operand has 96 places, 96 transitions, 245 flow. Second operand 3 states and 287 transitions. [2025-01-10 00:36:53,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 109 transitions, 397 flow [2025-01-10 00:36:53,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 109 transitions, 389 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:36:53,915 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 244 flow [2025-01-10 00:36:53,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2025-01-10 00:36:53,916 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -25 predicate places. [2025-01-10 00:36:53,916 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 244 flow [2025-01-10 00:36:53,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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:36:53,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:53,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:53,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:36:53,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:36:53,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash -610950806, now seen corresponding path program 1 times [2025-01-10 00:36:53,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:53,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775574331] [2025-01-10 00:36:53,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:53,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:53,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:36:53,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:36:53,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:53,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:54,043 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:36:54,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:54,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775574331] [2025-01-10 00:36:54,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775574331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:54,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:54,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:36:54,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127242116] [2025-01-10 00:36:54,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:54,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:36:54,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:54,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:36:54,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:36:54,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2025-01-10 00:36:54,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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:36:54,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:54,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2025-01-10 00:36:54,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:54,289 INFO L124 PetriNetUnfolderBase]: 587/1373 cut-off events. [2025-01-10 00:36:54,290 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-01-10 00:36:54,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2716 conditions, 1373 events. 587/1373 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7348 event pairs, 395 based on Foata normal form. 12/1223 useless extension candidates. Maximal degree in co-relation 1532. Up to 779 conditions per place. [2025-01-10 00:36:54,293 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 62 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-01-10 00:36:54,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 109 transitions, 401 flow [2025-01-10 00:36:54,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:36:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:36:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2025-01-10 00:36:54,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6937984496124031 [2025-01-10 00:36:54,295 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 244 flow. Second operand 4 states and 358 transitions. [2025-01-10 00:36:54,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 109 transitions, 401 flow [2025-01-10 00:36:54,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 109 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:36:54,297 INFO L231 Difference]: Finished difference. Result has 100 places, 96 transitions, 252 flow [2025-01-10 00:36:54,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=100, PETRI_TRANSITIONS=96} [2025-01-10 00:36:54,297 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -22 predicate places. [2025-01-10 00:36:54,297 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 96 transitions, 252 flow [2025-01-10 00:36:54,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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:36:54,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:54,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:54,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:36:54,298 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:36:54,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:54,298 INFO L85 PathProgramCache]: Analyzing trace with hash -610950807, now seen corresponding path program 1 times [2025-01-10 00:36:54,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:54,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099800473] [2025-01-10 00:36:54,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:54,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:54,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:36:54,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:36:54,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:54,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:54,357 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:36:54,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:54,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099800473] [2025-01-10 00:36:54,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099800473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:54,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:36:54,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:36:54,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823962945] [2025-01-10 00:36:54,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:54,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:36:54,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:54,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:36:54,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:36:54,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2025-01-10 00:36:54,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 96 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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:36:54,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:54,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2025-01-10 00:36:54,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:54,512 INFO L124 PetriNetUnfolderBase]: 572/1325 cut-off events. [2025-01-10 00:36:54,512 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2025-01-10 00:36:54,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2674 conditions, 1325 events. 572/1325 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6919 event pairs, 515 based on Foata normal form. 31/1203 useless extension candidates. Maximal degree in co-relation 898. Up to 1007 conditions per place. [2025-01-10 00:36:54,516 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 50 selfloop transitions, 1 changer transitions 0/94 dead transitions. [2025-01-10 00:36:54,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 94 transitions, 350 flow [2025-01-10 00:36:54,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:36:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:36:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2025-01-10 00:36:54,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6847545219638242 [2025-01-10 00:36:54,517 INFO L175 Difference]: Start difference. First operand has 100 places, 96 transitions, 252 flow. Second operand 3 states and 265 transitions. [2025-01-10 00:36:54,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 94 transitions, 350 flow [2025-01-10 00:36:54,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 344 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:36:54,519 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 244 flow [2025-01-10 00:36:54,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2025-01-10 00:36:54,519 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -25 predicate places. [2025-01-10 00:36:54,519 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 244 flow [2025-01-10 00:36:54,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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:36:54,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:54,520 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:54,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:36:54,520 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:36:54,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:54,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1236683721, now seen corresponding path program 1 times [2025-01-10 00:36:54,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:54,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766917282] [2025-01-10 00:36:54,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:54,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:54,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:36:54,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:36:54,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:54,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:54,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:54,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766917282] [2025-01-10 00:36:54,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766917282] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:36:54,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628727813] [2025-01-10 00:36:54,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:54,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:36:54,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:36:54,885 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:36:54,890 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:36:54,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:36:54,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:36:54,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:54,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:54,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 00:36:54,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:36:55,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 00:36:55,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-10 00:36:55,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:36:55,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-10 00:36:55,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-10 00:36:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:55,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:36:55,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628727813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:36:55,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 00:36:55,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 12 [2025-01-10 00:36:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749626772] [2025-01-10 00:36:55,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:36:55,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:36:55,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:36:55,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:36:55,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:36:55,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 129 [2025-01-10 00:36:55,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 244 flow. Second operand has 8 states, 8 states have (on average 70.75) internal successors, (566), 8 states have internal predecessors, (566), 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:36:55,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:36:55,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 129 [2025-01-10 00:36:55,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:36:55,803 INFO L124 PetriNetUnfolderBase]: 643/1386 cut-off events. [2025-01-10 00:36:55,803 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-01-10 00:36:55,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2842 conditions, 1386 events. 643/1386 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6943 event pairs, 168 based on Foata normal form. 0/1261 useless extension candidates. Maximal degree in co-relation 2829. Up to 771 conditions per place. [2025-01-10 00:36:55,808 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 87 selfloop transitions, 8 changer transitions 0/130 dead transitions. [2025-01-10 00:36:55,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 130 transitions, 509 flow [2025-01-10 00:36:55,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:36:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:36:55,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 571 transitions. [2025-01-10 00:36:55,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6323366555924695 [2025-01-10 00:36:55,809 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 244 flow. Second operand 7 states and 571 transitions. [2025-01-10 00:36:55,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 130 transitions, 509 flow [2025-01-10 00:36:55,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 130 transitions, 506 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 00:36:55,811 INFO L231 Difference]: Finished difference. Result has 104 places, 95 transitions, 270 flow [2025-01-10 00:36:55,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=270, PETRI_PLACES=104, PETRI_TRANSITIONS=95} [2025-01-10 00:36:55,812 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -18 predicate places. [2025-01-10 00:36:55,812 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 270 flow [2025-01-10 00:36:55,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 70.75) internal successors, (566), 8 states have internal predecessors, (566), 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:36:55,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:36:55,812 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:36:55,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:36:56,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 00:36:56,014 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:36:56,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:36:56,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1649119659, now seen corresponding path program 1 times [2025-01-10 00:36:56,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:36:56,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751726217] [2025-01-10 00:36:56,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:56,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:36:56,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:36:56,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:36:56,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:56,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:56,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:36:56,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751726217] [2025-01-10 00:36:56,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751726217] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:36:56,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26807020] [2025-01-10 00:36:56,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:36:56,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:36:56,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:36:56,978 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:36:56,980 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:36:57,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:36:57,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:36:57,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:36:57,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:36:57,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-10 00:36:57,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:36:57,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 00:36:57,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-10 00:36:57,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:36:57,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-10 00:36:57,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-10 00:36:57,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 00:36:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:36:57,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:37:54,109 INFO L349 Elim1Store]: treesize reduction 47, result has 52.5 percent of original size [2025-01-10 00:37:54,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 146 [2025-01-10 00:37:54,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:37:54,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 111 [2025-01-10 00:37:54,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-10 00:37:54,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:37:54,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 73 [2025-01-10 00:37:54,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:37:54,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:37:54,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:37:54,332 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 47 [2025-01-10 00:37:54,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2025-01-10 00:37:54,343 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:37:54,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:37:54,347 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-01-10 00:37:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:54,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26807020] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:37:54,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:37:54,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11] total 32 [2025-01-10 00:37:54,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753624138] [2025-01-10 00:37:54,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:37:54,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-10 00:37:54,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:54,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-10 00:37:54,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=945, Unknown=9, NotChecked=0, Total=1122 [2025-01-10 00:37:58,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:38:02,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:38:05,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:38:09,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:38:13,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:38:18,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:38:22,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:38:26,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]