./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c --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/weaver/chl-node-trans.wvr.c -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 c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:02:59,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:02:59,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:02:59,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:02:59,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:02:59,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:02:59,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:02:59,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:02:59,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:02:59,802 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:02:59,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:02:59,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:02:59,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:02:59,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:02:59,804 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:02:59,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:02:59,804 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:02:59,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:02:59,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:02:59,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:02:59,805 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:02:59,805 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:02:59,805 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:02:59,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:02:59,805 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:02:59,805 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:02:59,805 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:02:59,805 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:02:59,805 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:02:59,806 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:02:59,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:02:59,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:02:59,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:02:59,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:02:59,807 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:02:59,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:02:59,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:02:59,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:02:59,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:02:59,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:02:59,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:02:59,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:02:59,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:02:59,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:02:59,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:02:59,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:02:59,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:02:59,808 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 -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2025-01-10 01:03:00,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:03:00,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:03:00,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:03:00,124 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:03:00,125 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:03:00,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-01-10 01:03:01,414 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2478a5189/b0636d1681004f4c993900f0323e20b3/FLAG41bf39147 [2025-01-10 01:03:01,687 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:03:01,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-01-10 01:03:01,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2478a5189/b0636d1681004f4c993900f0323e20b3/FLAG41bf39147 [2025-01-10 01:03:01,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2478a5189/b0636d1681004f4c993900f0323e20b3 [2025-01-10 01:03:01,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:03:01,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:03:01,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:03:01,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:03:01,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:03:01,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:03:01" (1/1) ... [2025-01-10 01:03:01,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7d619f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:01, skipping insertion in model container [2025-01-10 01:03:01,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:03:01" (1/1) ... [2025-01-10 01:03:01,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:03:01,947 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:03:01,957 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:03:01,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:03:01,976 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:03:02,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:03:02,036 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:03:02,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:02 WrapperNode [2025-01-10 01:03:02,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:03:02,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:03:02,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:03:02,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:03:02,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:02" (1/1) ... [2025-01-10 01:03:02,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:02" (1/1) ... [2025-01-10 01:03:02,107 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 408 [2025-01-10 01:03:02,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:03:02,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:03:02,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:03:02,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:03:02,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:02" (1/1) ... [2025-01-10 01:03:02,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:02" (1/1) ... [2025-01-10 01:03:02,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:02" (1/1) ... [2025-01-10 01:03:02,159 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 9, 15]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-01-10 01:03:02,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:02" (1/1) ... [2025-01-10 01:03:02,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:02" (1/1) ... [2025-01-10 01:03:02,180 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:02" (1/1) ... [2025-01-10 01:03:02,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:02" (1/1) ... [2025-01-10 01:03:02,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:02" (1/1) ... [2025-01-10 01:03:02,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:02" (1/1) ... [2025-01-10 01:03:02,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:02" (1/1) ... [2025-01-10 01:03:02,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:03:02,208 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:03:02,209 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:03:02,209 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:03:02,210 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:02" (1/1) ... [2025-01-10 01:03:02,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:03:02,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:02,252 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 01:03:02,256 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 01:03:02,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:03:02,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:03:02,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:03:02,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:03:02,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:03:02,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:03:02,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:03:02,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:03:02,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:03:02,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:03:02,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:03:02,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:03:02,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:03:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:03:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:03:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:03:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:03:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:03:02,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:03:02,286 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 01:03:02,426 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:03:02,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:03:03,158 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:03:03,158 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:03:03,661 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:03:03,661 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:03:03,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:03:03 BoogieIcfgContainer [2025-01-10 01:03:03,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:03:03,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:03:03,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:03:03,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:03:03,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:03:01" (1/3) ... [2025-01-10 01:03:03,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc8a9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:03:03, skipping insertion in model container [2025-01-10 01:03:03,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:02" (2/3) ... [2025-01-10 01:03:03,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc8a9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:03:03, skipping insertion in model container [2025-01-10 01:03:03,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:03:03" (3/3) ... [2025-01-10 01:03:03,675 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-01-10 01:03:03,690 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:03:03,692 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 109 locations, 1 initial locations, 6 loop locations, and 50 error locations. [2025-01-10 01:03:03,693 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:03:03,792 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:03:03,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 120 transitions, 261 flow [2025-01-10 01:03:03,890 INFO L124 PetriNetUnfolderBase]: 12/117 cut-off events. [2025-01-10 01:03:03,894 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:03:03,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 12/117 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 388 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2025-01-10 01:03:03,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 120 transitions, 261 flow [2025-01-10 01:03:03,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 116 transitions, 250 flow [2025-01-10 01:03:03,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:03:03,926 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;@2d89812e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:03:03,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 89 error locations. [2025-01-10 01:03:03,933 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:03:03,934 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:03:03,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:03:03,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:03,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:03:03,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:03,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:03,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1282677, now seen corresponding path program 1 times [2025-01-10 01:03:03,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:03,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190805429] [2025-01-10 01:03:03,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:03,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:04,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:03:04,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:03:04,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:04,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:04,300 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 01:03:04,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:04,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190805429] [2025-01-10 01:03:04,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190805429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:04,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:04,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:03:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326951653] [2025-01-10 01:03:04,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:04,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:04,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:04,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:04,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:04,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:04,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:04,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:04,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:04,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:05,335 INFO L124 PetriNetUnfolderBase]: 2263/4993 cut-off events. [2025-01-10 01:03:05,335 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2025-01-10 01:03:05,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8166 conditions, 4993 events. 2263/4993 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40695 event pairs, 1414 based on Foata normal form. 1/3839 useless extension candidates. Maximal degree in co-relation 7651. Up to 3012 conditions per place. [2025-01-10 01:03:05,403 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 48 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-01-10 01:03:05,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 340 flow [2025-01-10 01:03:05,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2025-01-10 01:03:05,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2025-01-10 01:03:05,423 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 250 flow. Second operand 3 states and 249 transitions. [2025-01-10 01:03:05,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 340 flow [2025-01-10 01:03:05,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 111 transitions, 328 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:03:05,438 INFO L231 Difference]: Finished difference. Result has 105 places, 111 transitions, 232 flow [2025-01-10 01:03:05,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=103, 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=232, PETRI_PLACES=105, PETRI_TRANSITIONS=111} [2025-01-10 01:03:05,447 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -9 predicate places. [2025-01-10 01:03:05,447 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 111 transitions, 232 flow [2025-01-10 01:03:05,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:05,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:05,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:03:05,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:03:05,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:05,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:05,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1282678, now seen corresponding path program 1 times [2025-01-10 01:03:05,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:05,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190306099] [2025-01-10 01:03:05,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:05,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:05,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:03:05,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:03:05,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:05,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:05,900 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 01:03:05,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:05,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190306099] [2025-01-10 01:03:05,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190306099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:05,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:05,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:03:05,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398941588] [2025-01-10 01:03:05,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:05,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:05,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:05,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:05,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:06,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:06,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 111 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:06,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:06,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:06,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:06,622 INFO L124 PetriNetUnfolderBase]: 2264/4996 cut-off events. [2025-01-10 01:03:06,622 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-10 01:03:06,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 4996 events. 2264/4996 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40750 event pairs, 1414 based on Foata normal form. 0/3838 useless extension candidates. Maximal degree in co-relation 8038. Up to 3025 conditions per place. [2025-01-10 01:03:06,673 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 53 selfloop transitions, 3 changer transitions 0/114 dead transitions. [2025-01-10 01:03:06,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 114 transitions, 350 flow [2025-01-10 01:03:06,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2025-01-10 01:03:06,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-01-10 01:03:06,678 INFO L175 Difference]: Start difference. First operand has 105 places, 111 transitions, 232 flow. Second operand 3 states and 252 transitions. [2025-01-10 01:03:06,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 114 transitions, 350 flow [2025-01-10 01:03:06,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 114 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:06,683 INFO L231 Difference]: Finished difference. Result has 106 places, 113 transitions, 247 flow [2025-01-10 01:03:06,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=106, PETRI_TRANSITIONS=113} [2025-01-10 01:03:06,685 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -8 predicate places. [2025-01-10 01:03:06,686 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 113 transitions, 247 flow [2025-01-10 01:03:06,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:06,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:06,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:03:06,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:03:06,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:06,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:06,687 INFO L85 PathProgramCache]: Analyzing trace with hash 39766320, now seen corresponding path program 1 times [2025-01-10 01:03:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:06,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124970163] [2025-01-10 01:03:06,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:06,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:06,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:03:06,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:03:06,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:06,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:06,817 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 01:03:06,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:06,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124970163] [2025-01-10 01:03:06,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124970163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:06,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:06,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:03:06,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772840354] [2025-01-10 01:03:06,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:06,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:06,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:06,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:06,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:06,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:06,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 113 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 01:03:06,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:06,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:06,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:07,412 INFO L124 PetriNetUnfolderBase]: 2263/4995 cut-off events. [2025-01-10 01:03:07,412 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-10 01:03:07,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 4995 events. 2263/4995 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40760 event pairs, 1414 based on Foata normal form. 1/3842 useless extension candidates. Maximal degree in co-relation 8062. Up to 3021 conditions per place. [2025-01-10 01:03:07,458 INFO L140 encePairwiseOnDemand]: 117/120 looper letters, 50 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-01-10 01:03:07,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 113 transitions, 348 flow [2025-01-10 01:03:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2025-01-10 01:03:07,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7138888888888889 [2025-01-10 01:03:07,462 INFO L175 Difference]: Start difference. First operand has 106 places, 113 transitions, 247 flow. Second operand 3 states and 257 transitions. [2025-01-10 01:03:07,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 113 transitions, 348 flow [2025-01-10 01:03:07,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 113 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:03:07,466 INFO L231 Difference]: Finished difference. Result has 107 places, 112 transitions, 244 flow [2025-01-10 01:03:07,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=107, PETRI_TRANSITIONS=112} [2025-01-10 01:03:07,467 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -7 predicate places. [2025-01-10 01:03:07,467 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 112 transitions, 244 flow [2025-01-10 01:03:07,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 01:03:07,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:07,468 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:03:07,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:03:07,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:07,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:07,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1232696546, now seen corresponding path program 1 times [2025-01-10 01:03:07,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:07,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634376769] [2025-01-10 01:03:07,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:07,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:07,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:03:07,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:03:07,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:07,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:07,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:07,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634376769] [2025-01-10 01:03:07,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634376769] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:07,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048072793] [2025-01-10 01:03:07,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:07,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:07,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:07,791 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 01:03:07,792 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 01:03:07,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:03:07,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:03:07,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:07,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:07,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:03:07,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:07,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:03:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:08,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:08,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048072793] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:08,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:08,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:03:08,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645508002] [2025-01-10 01:03:08,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:08,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:03:08,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:08,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:03:08,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:03:08,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:08,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 112 transitions, 244 flow. Second operand has 11 states, 11 states have (on average 66.36363636363636) internal successors, (730), 11 states have internal predecessors, (730), 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 01:03:08,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:08,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:08,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:09,832 INFO L124 PetriNetUnfolderBase]: 2264/4997 cut-off events. [2025-01-10 01:03:09,833 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-10 01:03:09,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8084 conditions, 4997 events. 2264/4997 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40736 event pairs, 1414 based on Foata normal form. 0/3841 useless extension candidates. Maximal degree in co-relation 8070. Up to 3021 conditions per place. [2025-01-10 01:03:09,878 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 49 selfloop transitions, 8 changer transitions 0/115 dead transitions. [2025-01-10 01:03:09,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 115 transitions, 366 flow [2025-01-10 01:03:09,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:03:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:03:09,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 514 transitions. [2025-01-10 01:03:09,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.611904761904762 [2025-01-10 01:03:09,881 INFO L175 Difference]: Start difference. First operand has 107 places, 112 transitions, 244 flow. Second operand 7 states and 514 transitions. [2025-01-10 01:03:09,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 115 transitions, 366 flow [2025-01-10 01:03:09,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 115 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:09,885 INFO L231 Difference]: Finished difference. Result has 110 places, 115 transitions, 266 flow [2025-01-10 01:03:09,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=266, PETRI_PLACES=110, PETRI_TRANSITIONS=115} [2025-01-10 01:03:09,888 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -4 predicate places. [2025-01-10 01:03:09,888 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 115 transitions, 266 flow [2025-01-10 01:03:09,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 66.36363636363636) internal successors, (730), 11 states have internal predecessors, (730), 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 01:03:09,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:09,889 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:03:09,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:03:10,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:10,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:10,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:10,091 INFO L85 PathProgramCache]: Analyzing trace with hash -441109436, now seen corresponding path program 1 times [2025-01-10 01:03:10,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:10,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759605832] [2025-01-10 01:03:10,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:10,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:10,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:03:10,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:03:10,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:10,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:10,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:10,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759605832] [2025-01-10 01:03:10,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759605832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:10,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:10,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:10,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934930206] [2025-01-10 01:03:10,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:10,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:10,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:10,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:10,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:10,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:10,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 115 transitions, 266 flow. Second operand has 5 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 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 01:03:10,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:10,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:10,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:10,963 INFO L124 PetriNetUnfolderBase]: 2265/5000 cut-off events. [2025-01-10 01:03:10,963 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-10 01:03:10,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8097 conditions, 5000 events. 2265/5000 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40795 event pairs, 1414 based on Foata normal form. 0/3843 useless extension candidates. Maximal degree in co-relation 8060. Up to 3025 conditions per place. [2025-01-10 01:03:11,009 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 54 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2025-01-10 01:03:11,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 118 transitions, 392 flow [2025-01-10 01:03:11,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2025-01-10 01:03:11,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-01-10 01:03:11,011 INFO L175 Difference]: Start difference. First operand has 110 places, 115 transitions, 266 flow. Second operand 4 states and 318 transitions. [2025-01-10 01:03:11,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 118 transitions, 392 flow [2025-01-10 01:03:11,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 118 transitions, 377 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:11,014 INFO L231 Difference]: Finished difference. Result has 111 places, 117 transitions, 279 flow [2025-01-10 01:03:11,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=111, PETRI_TRANSITIONS=117} [2025-01-10 01:03:11,015 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2025-01-10 01:03:11,015 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 117 transitions, 279 flow [2025-01-10 01:03:11,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 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 01:03:11,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:11,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:11,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:03:11,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:11,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:11,017 INFO L85 PathProgramCache]: Analyzing trace with hash -789488799, now seen corresponding path program 1 times [2025-01-10 01:03:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:11,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365832504] [2025-01-10 01:03:11,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:11,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:03:11,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:03:11,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:11,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:11,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:11,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365832504] [2025-01-10 01:03:11,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365832504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:11,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:11,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:11,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136831006] [2025-01-10 01:03:11,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:11,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:11,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:11,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:11,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:11,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:11,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 117 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 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 01:03:11,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:11,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:11,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:11,613 INFO L124 PetriNetUnfolderBase]: 2264/4999 cut-off events. [2025-01-10 01:03:11,613 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-10 01:03:11,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8095 conditions, 4999 events. 2264/4999 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40737 event pairs, 1414 based on Foata normal form. 1/3847 useless extension candidates. Maximal degree in co-relation 8055. Up to 3022 conditions per place. [2025-01-10 01:03:11,662 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 52 selfloop transitions, 5 changer transitions 0/117 dead transitions. [2025-01-10 01:03:11,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 117 transitions, 390 flow [2025-01-10 01:03:11,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 327 transitions. [2025-01-10 01:03:11,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68125 [2025-01-10 01:03:11,664 INFO L175 Difference]: Start difference. First operand has 111 places, 117 transitions, 279 flow. Second operand 4 states and 327 transitions. [2025-01-10 01:03:11,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 117 transitions, 390 flow [2025-01-10 01:03:11,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 117 transitions, 385 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:11,667 INFO L231 Difference]: Finished difference. Result has 112 places, 116 transitions, 279 flow [2025-01-10 01:03:11,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=112, PETRI_TRANSITIONS=116} [2025-01-10 01:03:11,668 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -2 predicate places. [2025-01-10 01:03:11,668 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 116 transitions, 279 flow [2025-01-10 01:03:11,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 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 01:03:11,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:11,668 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:11,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:03:11,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:11,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1295636732, now seen corresponding path program 1 times [2025-01-10 01:03:11,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:11,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122939266] [2025-01-10 01:03:11,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:11,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:03:11,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:03:11,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:11,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:11,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:11,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:11,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122939266] [2025-01-10 01:03:11,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122939266] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:11,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608751534] [2025-01-10 01:03:11,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:11,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:11,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:11,934 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 01:03:11,936 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 01:03:12,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:03:12,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:03:12,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:12,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:12,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:03:12,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:12,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:03:12,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:12,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:12,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608751534] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:12,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:12,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:03:12,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753749251] [2025-01-10 01:03:12,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:12,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:03:12,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:12,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:03:12,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:03:13,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:13,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 116 transitions, 279 flow. Second operand has 13 states, 13 states have (on average 66.61538461538461) internal successors, (866), 13 states have internal predecessors, (866), 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 01:03:13,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:13,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:13,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:13,968 INFO L124 PetriNetUnfolderBase]: 2264/4998 cut-off events. [2025-01-10 01:03:13,969 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-01-10 01:03:13,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8097 conditions, 4998 events. 2264/4998 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40776 event pairs, 1414 based on Foata normal form. 0/3844 useless extension candidates. Maximal degree in co-relation 8054. Up to 3015 conditions per place. [2025-01-10 01:03:14,003 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 45 selfloop transitions, 13 changer transitions 0/116 dead transitions. [2025-01-10 01:03:14,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 116 transitions, 393 flow [2025-01-10 01:03:14,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:03:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:03:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 511 transitions. [2025-01-10 01:03:14,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2025-01-10 01:03:14,006 INFO L175 Difference]: Start difference. First operand has 112 places, 116 transitions, 279 flow. Second operand 7 states and 511 transitions. [2025-01-10 01:03:14,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 116 transitions, 393 flow [2025-01-10 01:03:14,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 116 transitions, 383 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:14,011 INFO L231 Difference]: Finished difference. Result has 114 places, 116 transitions, 293 flow [2025-01-10 01:03:14,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=293, PETRI_PLACES=114, PETRI_TRANSITIONS=116} [2025-01-10 01:03:14,012 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2025-01-10 01:03:14,012 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 116 transitions, 293 flow [2025-01-10 01:03:14,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 66.61538461538461) internal successors, (866), 13 states have internal predecessors, (866), 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 01:03:14,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:14,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:14,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:14,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:14,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:14,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:14,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1510034857, now seen corresponding path program 1 times [2025-01-10 01:03:14,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:14,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026480112] [2025-01-10 01:03:14,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:14,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:14,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:03:14,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:03:14,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:14,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:14,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:14,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026480112] [2025-01-10 01:03:14,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026480112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:14,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:14,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:14,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489161553] [2025-01-10 01:03:14,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:14,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:14,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:14,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:14,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:14,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:14,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 293 flow. Second operand has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 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 01:03:14,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:14,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:14,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:15,073 INFO L124 PetriNetUnfolderBase]: 2265/5001 cut-off events. [2025-01-10 01:03:15,073 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-10 01:03:15,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8111 conditions, 5001 events. 2265/5001 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40737 event pairs, 1414 based on Foata normal form. 0/3846 useless extension candidates. Maximal degree in co-relation 8052. Up to 3027 conditions per place. [2025-01-10 01:03:15,111 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 56 selfloop transitions, 5 changer transitions 0/119 dead transitions. [2025-01-10 01:03:15,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 119 transitions, 421 flow [2025-01-10 01:03:15,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:15,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-01-10 01:03:15,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6604166666666667 [2025-01-10 01:03:15,114 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 293 flow. Second operand 4 states and 317 transitions. [2025-01-10 01:03:15,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 119 transitions, 421 flow [2025-01-10 01:03:15,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 119 transitions, 406 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:15,117 INFO L231 Difference]: Finished difference. Result has 115 places, 118 transitions, 303 flow [2025-01-10 01:03:15,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=303, PETRI_PLACES=115, PETRI_TRANSITIONS=118} [2025-01-10 01:03:15,119 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2025-01-10 01:03:15,119 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 118 transitions, 303 flow [2025-01-10 01:03:15,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 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 01:03:15,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:15,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:15,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:03:15,121 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:15,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:15,121 INFO L85 PathProgramCache]: Analyzing trace with hash -433556229, now seen corresponding path program 1 times [2025-01-10 01:03:15,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:15,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945161669] [2025-01-10 01:03:15,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:15,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:15,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:03:15,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:03:15,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:15,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:15,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:15,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945161669] [2025-01-10 01:03:15,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945161669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:15,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:15,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:15,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648858663] [2025-01-10 01:03:15,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:15,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:15,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:15,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:15,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:15,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:15,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 118 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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 01:03:15,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:15,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:15,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:15,728 INFO L124 PetriNetUnfolderBase]: 2264/5000 cut-off events. [2025-01-10 01:03:15,729 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-01-10 01:03:15,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8110 conditions, 5000 events. 2264/5000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40759 event pairs, 1414 based on Foata normal form. 1/3847 useless extension candidates. Maximal degree in co-relation 8054. Up to 3025 conditions per place. [2025-01-10 01:03:15,768 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 55 selfloop transitions, 4 changer transitions 0/118 dead transitions. [2025-01-10 01:03:15,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 118 transitions, 418 flow [2025-01-10 01:03:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 327 transitions. [2025-01-10 01:03:15,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68125 [2025-01-10 01:03:15,770 INFO L175 Difference]: Start difference. First operand has 115 places, 118 transitions, 303 flow. Second operand 4 states and 327 transitions. [2025-01-10 01:03:15,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 118 transitions, 418 flow [2025-01-10 01:03:15,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 118 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:15,773 INFO L231 Difference]: Finished difference. Result has 116 places, 117 transitions, 302 flow [2025-01-10 01:03:15,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=116, PETRI_TRANSITIONS=117} [2025-01-10 01:03:15,774 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 2 predicate places. [2025-01-10 01:03:15,775 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 117 transitions, 302 flow [2025-01-10 01:03:15,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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 01:03:15,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:15,776 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:15,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:03:15,776 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:15,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash -555405784, now seen corresponding path program 1 times [2025-01-10 01:03:15,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:15,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520256670] [2025-01-10 01:03:15,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:15,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:15,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:03:15,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:03:15,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:15,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:16,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:16,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520256670] [2025-01-10 01:03:16,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520256670] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:16,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717982211] [2025-01-10 01:03:16,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:16,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:16,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:16,125 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:03:16,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:03:16,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:03:16,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:03:16,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:16,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:16,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:03:16,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:16,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:03:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:16,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:16,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717982211] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:16,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:16,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:03:16,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821684497] [2025-01-10 01:03:16,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:16,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:03:16,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:16,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:03:16,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:03:17,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:17,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 117 transitions, 302 flow. Second operand has 13 states, 13 states have (on average 67.07692307692308) internal successors, (872), 13 states have internal predecessors, (872), 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 01:03:17,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:17,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:17,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:17,912 INFO L124 PetriNetUnfolderBase]: 2264/4999 cut-off events. [2025-01-10 01:03:17,912 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-10 01:03:17,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8110 conditions, 4999 events. 2264/4999 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40756 event pairs, 1414 based on Foata normal form. 0/3845 useless extension candidates. Maximal degree in co-relation 8052. Up to 3017 conditions per place. [2025-01-10 01:03:17,951 INFO L140 encePairwiseOnDemand]: 111/120 looper letters, 45 selfloop transitions, 14 changer transitions 0/117 dead transitions. [2025-01-10 01:03:17,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 418 flow [2025-01-10 01:03:17,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:03:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:03:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 510 transitions. [2025-01-10 01:03:17,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-01-10 01:03:17,954 INFO L175 Difference]: Start difference. First operand has 116 places, 117 transitions, 302 flow. Second operand 7 states and 510 transitions. [2025-01-10 01:03:17,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 418 flow [2025-01-10 01:03:17,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 117 transitions, 410 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:17,956 INFO L231 Difference]: Finished difference. Result has 118 places, 117 transitions, 320 flow [2025-01-10 01:03:17,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=320, PETRI_PLACES=118, PETRI_TRANSITIONS=117} [2025-01-10 01:03:17,957 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 4 predicate places. [2025-01-10 01:03:17,957 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 117 transitions, 320 flow [2025-01-10 01:03:17,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 67.07692307692308) internal successors, (872), 13 states have internal predecessors, (872), 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 01:03:17,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:17,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:17,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:18,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:18,159 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:18,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash -37706660, now seen corresponding path program 1 times [2025-01-10 01:03:18,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:18,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102918581] [2025-01-10 01:03:18,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:18,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:18,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:03:18,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:03:18,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:18,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:18,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:18,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102918581] [2025-01-10 01:03:18,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102918581] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:18,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560553147] [2025-01-10 01:03:18,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:18,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:18,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:18,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:03:18,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:03:18,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:03:18,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:03:18,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:18,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:18,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:03:18,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:18,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:03:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:18,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:03:18,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560553147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:18,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:03:18,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-10 01:03:18,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886909987] [2025-01-10 01:03:18,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:18,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:18,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:18,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:18,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:03:18,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:18,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 117 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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 01:03:18,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:18,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:18,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:19,008 INFO L124 PetriNetUnfolderBase]: 2265/5003 cut-off events. [2025-01-10 01:03:19,008 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-01-10 01:03:19,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8130 conditions, 5003 events. 2265/5003 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40767 event pairs, 1414 based on Foata normal form. 0/3848 useless extension candidates. Maximal degree in co-relation 8066. Up to 3033 conditions per place. [2025-01-10 01:03:19,032 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 61 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2025-01-10 01:03:19,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 120 transitions, 456 flow [2025-01-10 01:03:19,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-01-10 01:03:19,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6604166666666667 [2025-01-10 01:03:19,033 INFO L175 Difference]: Start difference. First operand has 118 places, 117 transitions, 320 flow. Second operand 4 states and 317 transitions. [2025-01-10 01:03:19,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 120 transitions, 456 flow [2025-01-10 01:03:19,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 120 transitions, 439 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 01:03:19,036 INFO L231 Difference]: Finished difference. Result has 118 places, 119 transitions, 324 flow [2025-01-10 01:03:19,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=118, PETRI_TRANSITIONS=119} [2025-01-10 01:03:19,037 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 4 predicate places. [2025-01-10 01:03:19,037 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 119 transitions, 324 flow [2025-01-10 01:03:19,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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 01:03:19,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:19,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:19,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:19,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 01:03:19,238 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:19,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:19,239 INFO L85 PathProgramCache]: Analyzing trace with hash -37706661, now seen corresponding path program 1 times [2025-01-10 01:03:19,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:19,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165785397] [2025-01-10 01:03:19,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:19,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:19,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:03:19,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:03:19,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:19,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:19,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:19,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165785397] [2025-01-10 01:03:19,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165785397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:19,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:19,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:03:19,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22305294] [2025-01-10 01:03:19,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:19,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:19,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:19,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:19,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:19,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:19,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 119 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 01:03:19,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:19,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:19,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:19,763 INFO L124 PetriNetUnfolderBase]: 2265/4999 cut-off events. [2025-01-10 01:03:19,764 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-01-10 01:03:19,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8123 conditions, 4999 events. 2265/4999 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40746 event pairs, 1414 based on Foata normal form. 2/3850 useless extension candidates. Maximal degree in co-relation 8063. Up to 3021 conditions per place. [2025-01-10 01:03:19,791 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 59 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2025-01-10 01:03:19,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 116 transitions, 440 flow [2025-01-10 01:03:19,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2025-01-10 01:03:19,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2025-01-10 01:03:19,793 INFO L175 Difference]: Start difference. First operand has 118 places, 119 transitions, 324 flow. Second operand 3 states and 248 transitions. [2025-01-10 01:03:19,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 116 transitions, 440 flow [2025-01-10 01:03:19,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 116 transitions, 435 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:19,796 INFO L231 Difference]: Finished difference. Result has 115 places, 116 transitions, 317 flow [2025-01-10 01:03:19,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=115, PETRI_TRANSITIONS=116} [2025-01-10 01:03:19,798 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2025-01-10 01:03:19,799 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 116 transitions, 317 flow [2025-01-10 01:03:19,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 01:03:19,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:19,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:19,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:03:19,799 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:19,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:19,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1168905307, now seen corresponding path program 1 times [2025-01-10 01:03:19,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:19,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773901329] [2025-01-10 01:03:19,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:19,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:19,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:03:19,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:03:19,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:19,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:19,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:19,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773901329] [2025-01-10 01:03:19,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773901329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:19,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:19,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:19,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092143610] [2025-01-10 01:03:19,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:19,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:19,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:19,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:19,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:19,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:19,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 116 transitions, 317 flow. Second operand has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 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 01:03:19,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:19,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:19,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:20,236 INFO L124 PetriNetUnfolderBase]: 2264/4998 cut-off events. [2025-01-10 01:03:20,236 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-01-10 01:03:20,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8119 conditions, 4998 events. 2264/4998 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40740 event pairs, 1414 based on Foata normal form. 1/3849 useless extension candidates. Maximal degree in co-relation 8060. Up to 3029 conditions per place. [2025-01-10 01:03:20,261 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 58 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2025-01-10 01:03:20,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 437 flow [2025-01-10 01:03:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-01-10 01:03:20,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-01-10 01:03:20,263 INFO L175 Difference]: Start difference. First operand has 115 places, 116 transitions, 317 flow. Second operand 4 states and 325 transitions. [2025-01-10 01:03:20,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 437 flow [2025-01-10 01:03:20,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 116 transitions, 433 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:20,265 INFO L231 Difference]: Finished difference. Result has 116 places, 115 transitions, 315 flow [2025-01-10 01:03:20,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=315, PETRI_PLACES=116, PETRI_TRANSITIONS=115} [2025-01-10 01:03:20,265 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 2 predicate places. [2025-01-10 01:03:20,265 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 115 transitions, 315 flow [2025-01-10 01:03:20,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 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 01:03:20,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:20,266 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:20,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:03:20,266 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:20,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:20,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1876318070, now seen corresponding path program 1 times [2025-01-10 01:03:20,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:20,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986774512] [2025-01-10 01:03:20,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:20,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:20,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:03:20,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:03:20,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:20,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:20,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:20,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986774512] [2025-01-10 01:03:20,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986774512] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:20,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587885377] [2025-01-10 01:03:20,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:20,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:20,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:20,402 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:03:20,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:03:20,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:03:20,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:03:20,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:20,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:20,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:03:20,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:20,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:20,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587885377] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:20,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:20,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:03:20,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376720565] [2025-01-10 01:03:20,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:20,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:03:20,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:20,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:03:20,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:03:20,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:20,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 115 transitions, 315 flow. Second operand has 14 states, 14 states have (on average 70.0) internal successors, (980), 14 states have internal predecessors, (980), 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 01:03:20,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:20,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:20,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:21,654 INFO L124 PetriNetUnfolderBase]: 4456/9776 cut-off events. [2025-01-10 01:03:21,654 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-10 01:03:21,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15899 conditions, 9776 events. 4456/9776 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 89452 event pairs, 2808 based on Foata normal form. 1/7617 useless extension candidates. Maximal degree in co-relation 8053. Up to 3012 conditions per place. [2025-01-10 01:03:21,698 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 86 selfloop transitions, 24 changer transitions 0/165 dead transitions. [2025-01-10 01:03:21,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 165 transitions, 671 flow [2025-01-10 01:03:21,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:03:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:03:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 716 transitions. [2025-01-10 01:03:21,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.662962962962963 [2025-01-10 01:03:21,701 INFO L175 Difference]: Start difference. First operand has 116 places, 115 transitions, 315 flow. Second operand 9 states and 716 transitions. [2025-01-10 01:03:21,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 165 transitions, 671 flow [2025-01-10 01:03:21,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 165 transitions, 661 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:21,704 INFO L231 Difference]: Finished difference. Result has 125 places, 127 transitions, 446 flow [2025-01-10 01:03:21,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=446, PETRI_PLACES=125, PETRI_TRANSITIONS=127} [2025-01-10 01:03:21,705 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 11 predicate places. [2025-01-10 01:03:21,705 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 127 transitions, 446 flow [2025-01-10 01:03:21,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 70.0) internal successors, (980), 14 states have internal predecessors, (980), 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 01:03:21,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:21,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:21,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:21,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 01:03:21,910 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:21,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1963683127, now seen corresponding path program 1 times [2025-01-10 01:03:21,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:21,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840791108] [2025-01-10 01:03:21,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:21,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:21,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:03:21,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:03:21,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:21,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:22,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:22,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840791108] [2025-01-10 01:03:22,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840791108] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:22,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22327988] [2025-01-10 01:03:22,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:22,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:22,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:22,219 INFO L229 MonitoredProcess]: Starting monitored process 7 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 01:03:22,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:03:22,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:03:22,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:03:22,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:22,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:22,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:03:22,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:22,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:03:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:03:22,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:03:22,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22327988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:22,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:03:22,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-01-10 01:03:22,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049930952] [2025-01-10 01:03:22,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:22,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:22,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:22,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:22,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:03:22,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:22,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 127 transitions, 446 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 01:03:22,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:22,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:22,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:23,188 INFO L124 PetriNetUnfolderBase]: 4526/9990 cut-off events. [2025-01-10 01:03:23,188 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-01-10 01:03:23,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16249 conditions, 9990 events. 4526/9990 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 91826 event pairs, 2828 based on Foata normal form. 0/7686 useless extension candidates. Maximal degree in co-relation 8078. Up to 6058 conditions per place. [2025-01-10 01:03:23,250 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 73 selfloop transitions, 5 changer transitions 0/130 dead transitions. [2025-01-10 01:03:23,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 130 transitions, 608 flow [2025-01-10 01:03:23,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-01-10 01:03:23,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6604166666666667 [2025-01-10 01:03:23,251 INFO L175 Difference]: Start difference. First operand has 125 places, 127 transitions, 446 flow. Second operand 4 states and 317 transitions. [2025-01-10 01:03:23,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 130 transitions, 608 flow [2025-01-10 01:03:23,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 130 transitions, 601 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:23,254 INFO L231 Difference]: Finished difference. Result has 127 places, 129 transitions, 463 flow [2025-01-10 01:03:23,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=463, PETRI_PLACES=127, PETRI_TRANSITIONS=129} [2025-01-10 01:03:23,255 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 13 predicate places. [2025-01-10 01:03:23,255 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 129 transitions, 463 flow [2025-01-10 01:03:23,255 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 01:03:23,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:23,255 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:23,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:23,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:03:23,456 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:23,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash -124499298, now seen corresponding path program 2 times [2025-01-10 01:03:23,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:23,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765906176] [2025-01-10 01:03:23,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:23,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:23,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 01:03:23,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:03:23,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:23,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:23,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:23,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765906176] [2025-01-10 01:03:23,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765906176] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:23,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21884420] [2025-01-10 01:03:23,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:23,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:23,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:23,672 INFO L229 MonitoredProcess]: Starting monitored process 8 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 01:03:23,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:03:23,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 01:03:23,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:03:23,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:23,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:23,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 01:03:23,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:23,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:03:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:23,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:24,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21884420] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:24,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:24,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 12 [2025-01-10 01:03:24,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230403148] [2025-01-10 01:03:24,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:24,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:03:24,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:24,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:03:24,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:03:24,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:24,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 129 transitions, 463 flow. Second operand has 14 states, 14 states have (on average 67.57142857142857) internal successors, (946), 14 states have internal predecessors, (946), 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 01:03:24,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:24,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:24,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:25,342 INFO L124 PetriNetUnfolderBase]: 4526/9989 cut-off events. [2025-01-10 01:03:25,342 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-01-10 01:03:25,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16262 conditions, 9989 events. 4526/9989 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 91820 event pairs, 2828 based on Foata normal form. 0/7689 useless extension candidates. Maximal degree in co-relation 8083. Up to 6043 conditions per place. [2025-01-10 01:03:25,400 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 58 selfloop transitions, 19 changer transitions 0/129 dead transitions. [2025-01-10 01:03:25,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 129 transitions, 617 flow [2025-01-10 01:03:25,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:03:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:03:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 581 transitions. [2025-01-10 01:03:25,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6052083333333333 [2025-01-10 01:03:25,402 INFO L175 Difference]: Start difference. First operand has 127 places, 129 transitions, 463 flow. Second operand 8 states and 581 transitions. [2025-01-10 01:03:25,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 129 transitions, 617 flow [2025-01-10 01:03:25,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 611 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:25,405 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 495 flow [2025-01-10 01:03:25,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=495, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2025-01-10 01:03:25,405 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 17 predicate places. [2025-01-10 01:03:25,405 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 495 flow [2025-01-10 01:03:25,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 67.57142857142857) internal successors, (946), 14 states have internal predecessors, (946), 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 01:03:25,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:25,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:25,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:25,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:25,607 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:25,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:25,607 INFO L85 PathProgramCache]: Analyzing trace with hash 744636382, now seen corresponding path program 1 times [2025-01-10 01:03:25,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:25,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402337482] [2025-01-10 01:03:25,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:25,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:25,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:03:25,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:03:25,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:25,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:25,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:25,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402337482] [2025-01-10 01:03:25,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402337482] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:25,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264643811] [2025-01-10 01:03:25,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:25,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:25,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:25,760 INFO L229 MonitoredProcess]: Starting monitored process 9 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 01:03:25,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:03:25,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:03:25,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:03:25,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:25,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:25,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:03:25,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:03:25,903 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:03:25,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264643811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:25,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:03:25,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-10 01:03:25,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306119450] [2025-01-10 01:03:25,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:25,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:25,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:25,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:25,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:03:25,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:25,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 495 flow. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 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 01:03:25,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:25,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:25,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:26,653 INFO L124 PetriNetUnfolderBase]: 4524/9987 cut-off events. [2025-01-10 01:03:26,653 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-01-10 01:03:26,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16267 conditions, 9987 events. 4524/9987 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 91552 event pairs, 2828 based on Foata normal form. 2/7695 useless extension candidates. Maximal degree in co-relation 8083. Up to 6051 conditions per place. [2025-01-10 01:03:26,713 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 71 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2025-01-10 01:03:26,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 129 transitions, 643 flow [2025-01-10 01:03:26,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-01-10 01:03:26,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-01-10 01:03:26,714 INFO L175 Difference]: Start difference. First operand has 131 places, 129 transitions, 495 flow. Second operand 4 states and 325 transitions. [2025-01-10 01:03:26,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 129 transitions, 643 flow [2025-01-10 01:03:26,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 129 transitions, 591 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-01-10 01:03:26,717 INFO L231 Difference]: Finished difference. Result has 127 places, 128 transitions, 447 flow [2025-01-10 01:03:26,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=447, PETRI_PLACES=127, PETRI_TRANSITIONS=128} [2025-01-10 01:03:26,717 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 13 predicate places. [2025-01-10 01:03:26,717 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 128 transitions, 447 flow [2025-01-10 01:03:26,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 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 01:03:26,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:26,717 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:26,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:26,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:03:26,918 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:26,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:26,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1608884207, now seen corresponding path program 1 times [2025-01-10 01:03:26,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:26,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445630939] [2025-01-10 01:03:26,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:26,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:26,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:03:26,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:03:26,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:26,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:27,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:27,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445630939] [2025-01-10 01:03:27,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445630939] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:27,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265508030] [2025-01-10 01:03:27,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:27,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:27,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:27,038 INFO L229 MonitoredProcess]: Starting monitored process 10 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 01:03:27,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:03:27,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:03:27,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:03:27,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:27,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:27,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:03:27,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:27,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:27,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265508030] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:27,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:27,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-10 01:03:27,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700157820] [2025-01-10 01:03:27,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:27,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:03:27,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:27,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:03:27,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:03:27,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:27,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 128 transitions, 447 flow. Second operand has 14 states, 14 states have (on average 70.21428571428571) internal successors, (983), 14 states have internal predecessors, (983), 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 01:03:27,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:27,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:27,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:28,738 INFO L124 PetriNetUnfolderBase]: 8907/19539 cut-off events. [2025-01-10 01:03:28,738 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-01-10 01:03:28,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31821 conditions, 19539 events. 8907/19539 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 198527 event pairs, 5616 based on Foata normal form. 2/15230 useless extension candidates. Maximal degree in co-relation 8066. Up to 6022 conditions per place. [2025-01-10 01:03:28,864 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 98 selfloop transitions, 36 changer transitions 0/188 dead transitions. [2025-01-10 01:03:28,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 188 transitions, 947 flow [2025-01-10 01:03:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:03:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:03:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 713 transitions. [2025-01-10 01:03:28,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6601851851851852 [2025-01-10 01:03:28,866 INFO L175 Difference]: Start difference. First operand has 127 places, 128 transitions, 447 flow. Second operand 9 states and 713 transitions. [2025-01-10 01:03:28,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 188 transitions, 947 flow [2025-01-10 01:03:28,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 188 transitions, 933 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:28,871 INFO L231 Difference]: Finished difference. Result has 137 places, 146 transitions, 695 flow [2025-01-10 01:03:28,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=695, PETRI_PLACES=137, PETRI_TRANSITIONS=146} [2025-01-10 01:03:28,871 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 23 predicate places. [2025-01-10 01:03:28,871 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 146 transitions, 695 flow [2025-01-10 01:03:28,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 70.21428571428571) internal successors, (983), 14 states have internal predecessors, (983), 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 01:03:28,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:28,872 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:28,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:03:29,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:03:29,073 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:29,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:29,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1664195546, now seen corresponding path program 1 times [2025-01-10 01:03:29,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:29,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950272988] [2025-01-10 01:03:29,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:29,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:29,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:03:29,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:03:29,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:29,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:29,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:03:29,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:29,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950272988] [2025-01-10 01:03:29,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950272988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:29,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:29,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:29,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839855265] [2025-01-10 01:03:29,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:29,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:29,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:29,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:29,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:29,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:29,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 146 transitions, 695 flow. Second operand has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 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 01:03:29,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:29,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:29,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:30,426 INFO L124 PetriNetUnfolderBase]: 9043/19963 cut-off events. [2025-01-10 01:03:30,426 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-01-10 01:03:30,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32497 conditions, 19963 events. 9043/19963 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 203993 event pairs, 5656 based on Foata normal form. 0/15368 useless extension candidates. Maximal degree in co-relation 8088. Up to 12099 conditions per place. [2025-01-10 01:03:30,531 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 92 selfloop transitions, 4 changer transitions 0/148 dead transitions. [2025-01-10 01:03:30,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 148 transitions, 891 flow [2025-01-10 01:03:30,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:30,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 316 transitions. [2025-01-10 01:03:30,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-01-10 01:03:30,533 INFO L175 Difference]: Start difference. First operand has 137 places, 146 transitions, 695 flow. Second operand 4 states and 316 transitions. [2025-01-10 01:03:30,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 148 transitions, 891 flow [2025-01-10 01:03:30,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 148 transitions, 889 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 01:03:30,538 INFO L231 Difference]: Finished difference. Result has 141 places, 147 transitions, 712 flow [2025-01-10 01:03:30,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=712, PETRI_PLACES=141, PETRI_TRANSITIONS=147} [2025-01-10 01:03:30,539 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 27 predicate places. [2025-01-10 01:03:30,539 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 147 transitions, 712 flow [2025-01-10 01:03:30,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 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 01:03:30,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:30,540 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:30,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:03:30,540 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:30,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:30,541 INFO L85 PathProgramCache]: Analyzing trace with hash 864114743, now seen corresponding path program 2 times [2025-01-10 01:03:30,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:30,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682166804] [2025-01-10 01:03:30,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:30,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:30,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 01:03:30,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:03:30,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:30,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:30,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:30,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682166804] [2025-01-10 01:03:30,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682166804] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:30,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083305795] [2025-01-10 01:03:30,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:30,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:30,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:30,842 INFO L229 MonitoredProcess]: Starting monitored process 11 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 01:03:30,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:03:30,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 01:03:30,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:03:30,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:30,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:30,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 01:03:30,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:31,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-01-10 01:03:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:31,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:31,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083305795] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:31,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:31,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-01-10 01:03:31,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016895659] [2025-01-10 01:03:31,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:31,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:03:31,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:31,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:03:31,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:03:32,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:32,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 147 transitions, 712 flow. Second operand has 21 states, 21 states have (on average 67.0952380952381) internal successors, (1409), 21 states have internal predecessors, (1409), 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 01:03:32,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:32,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:32,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:34,464 INFO L124 PetriNetUnfolderBase]: 13432/29535 cut-off events. [2025-01-10 01:03:34,464 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2025-01-10 01:03:34,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48202 conditions, 29535 events. 13432/29535 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 1464. Compared 318336 event pairs, 8444 based on Foata normal form. 0/22930 useless extension candidates. Maximal degree in co-relation 8102. Up to 12070 conditions per place. [2025-01-10 01:03:34,618 INFO L140 encePairwiseOnDemand]: 111/120 looper letters, 133 selfloop transitions, 33 changer transitions 0/218 dead transitions. [2025-01-10 01:03:34,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 218 transitions, 1382 flow [2025-01-10 01:03:34,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:03:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:03:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1157 transitions. [2025-01-10 01:03:34,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6026041666666667 [2025-01-10 01:03:34,622 INFO L175 Difference]: Start difference. First operand has 141 places, 147 transitions, 712 flow. Second operand 16 states and 1157 transitions. [2025-01-10 01:03:34,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 218 transitions, 1382 flow [2025-01-10 01:03:34,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 218 transitions, 1373 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:34,628 INFO L231 Difference]: Finished difference. Result has 158 places, 165 transitions, 926 flow [2025-01-10 01:03:34,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=926, PETRI_PLACES=158, PETRI_TRANSITIONS=165} [2025-01-10 01:03:34,628 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 44 predicate places. [2025-01-10 01:03:34,628 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 165 transitions, 926 flow [2025-01-10 01:03:34,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 67.0952380952381) internal successors, (1409), 21 states have internal predecessors, (1409), 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 01:03:34,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:34,629 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:34,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:34,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:34,830 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:34,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:34,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1564044418, now seen corresponding path program 1 times [2025-01-10 01:03:34,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:34,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031932003] [2025-01-10 01:03:34,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:34,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:34,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:03:34,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:03:34,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:34,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:34,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:34,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031932003] [2025-01-10 01:03:34,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031932003] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:34,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312212391] [2025-01-10 01:03:34,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:34,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:34,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:34,956 INFO L229 MonitoredProcess]: Starting monitored process 12 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 01:03:34,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:03:35,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:03:35,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:03:35,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:35,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:35,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:03:35,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:35,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:35,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312212391] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:35,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:35,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-10 01:03:35,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311957702] [2025-01-10 01:03:35,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:35,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:03:35,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:35,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:03:35,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:03:35,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-01-10 01:03:35,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 165 transitions, 926 flow. Second operand has 14 states, 14 states have (on average 70.42857142857143) internal successors, (986), 14 states have internal predecessors, (986), 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 01:03:35,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:35,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-01-10 01:03:35,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:39,578 INFO L124 PetriNetUnfolderBase]: 26713/58593 cut-off events. [2025-01-10 01:03:39,578 INFO L125 PetriNetUnfolderBase]: For 605/605 co-relation queries the response was YES. [2025-01-10 01:03:39,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95618 conditions, 58593 events. 26713/58593 cut-off events. For 605/605 co-relation queries the response was YES. Maximal size of possible extension queue 2869. Compared 693168 event pairs, 16848 based on Foata normal form. 6/45687 useless extension candidates. Maximal degree in co-relation 95544. Up to 18070 conditions per place. [2025-01-10 01:03:39,993 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 133 selfloop transitions, 51 changer transitions 0/238 dead transitions. [2025-01-10 01:03:39,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 238 transitions, 1694 flow [2025-01-10 01:03:39,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:03:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:03:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 641 transitions. [2025-01-10 01:03:39,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6677083333333333 [2025-01-10 01:03:39,995 INFO L175 Difference]: Start difference. First operand has 158 places, 165 transitions, 926 flow. Second operand 8 states and 641 transitions. [2025-01-10 01:03:39,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 238 transitions, 1694 flow [2025-01-10 01:03:40,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 238 transitions, 1593 flow, removed 36 selfloop flow, removed 4 redundant places. [2025-01-10 01:03:40,005 INFO L231 Difference]: Finished difference. Result has 166 places, 182 transitions, 1200 flow [2025-01-10 01:03:40,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1200, PETRI_PLACES=166, PETRI_TRANSITIONS=182} [2025-01-10 01:03:40,006 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 52 predicate places. [2025-01-10 01:03:40,006 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 182 transitions, 1200 flow [2025-01-10 01:03:40,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 70.42857142857143) internal successors, (986), 14 states have internal predecessors, (986), 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 01:03:40,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:40,007 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 01:03:40,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:03:40,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-10 01:03:40,208 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:40,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:40,208 INFO L85 PathProgramCache]: Analyzing trace with hash 192120921, now seen corresponding path program 1 times [2025-01-10 01:03:40,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:40,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633287323] [2025-01-10 01:03:40,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:40,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:40,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:03:40,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:03:40,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:40,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:03:40,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:40,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633287323] [2025-01-10 01:03:40,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633287323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:40,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:40,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:40,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361590996] [2025-01-10 01:03:40,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:40,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:40,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:40,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:40,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:40,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 120 [2025-01-10 01:03:40,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 182 transitions, 1200 flow. Second operand has 5 states, 5 states have (on average 63.2) internal successors, (316), 5 states have internal predecessors, (316), 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 01:03:40,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:40,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 120 [2025-01-10 01:03:40,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:46,374 INFO L124 PetriNetUnfolderBase]: 34717/69681 cut-off events. [2025-01-10 01:03:46,374 INFO L125 PetriNetUnfolderBase]: For 762/762 co-relation queries the response was YES. [2025-01-10 01:03:46,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117601 conditions, 69681 events. 34717/69681 cut-off events. For 762/762 co-relation queries the response was YES. Maximal size of possible extension queue 3359. Compared 784964 event pairs, 22584 based on Foata normal form. 0/57909 useless extension candidates. Maximal degree in co-relation 117531. Up to 46408 conditions per place. [2025-01-10 01:03:46,869 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 123 selfloop transitions, 7 changer transitions 0/178 dead transitions. [2025-01-10 01:03:46,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 178 transitions, 1452 flow [2025-01-10 01:03:46,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:03:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:03:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 351 transitions. [2025-01-10 01:03:46,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.585 [2025-01-10 01:03:46,871 INFO L175 Difference]: Start difference. First operand has 166 places, 182 transitions, 1200 flow. Second operand 5 states and 351 transitions. [2025-01-10 01:03:46,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 178 transitions, 1452 flow [2025-01-10 01:03:46,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 178 transitions, 1450 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 01:03:46,878 INFO L231 Difference]: Finished difference. Result has 166 places, 178 transitions, 1204 flow [2025-01-10 01:03:46,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1204, PETRI_PLACES=166, PETRI_TRANSITIONS=178} [2025-01-10 01:03:46,879 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 52 predicate places. [2025-01-10 01:03:46,879 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 178 transitions, 1204 flow [2025-01-10 01:03:46,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.2) internal successors, (316), 5 states have internal predecessors, (316), 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 01:03:46,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:46,880 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:46,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:03:46,880 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:46,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:46,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2083013217, now seen corresponding path program 2 times [2025-01-10 01:03:46,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:46,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807803778] [2025-01-10 01:03:46,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:46,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:46,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:03:46,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:03:46,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:46,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:47,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:47,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807803778] [2025-01-10 01:03:47,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807803778] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:47,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032505674] [2025-01-10 01:03:47,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:47,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:47,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:47,143 INFO L229 MonitoredProcess]: Starting monitored process 13 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 01:03:47,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:03:47,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:03:47,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:03:47,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:47,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:47,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:03:47,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:47,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:03:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:47,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:47,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032505674] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:47,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:47,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-01-10 01:03:47,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204559794] [2025-01-10 01:03:47,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:47,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:03:47,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:47,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:03:47,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:03:48,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-01-10 01:03:48,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 178 transitions, 1204 flow. Second operand has 22 states, 22 states have (on average 67.22727272727273) internal successors, (1479), 22 states have internal predecessors, (1479), 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 01:03:48,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:48,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-01-10 01:03:48,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:56,106 INFO L124 PetriNetUnfolderBase]: 40272/86071 cut-off events. [2025-01-10 01:03:56,106 INFO L125 PetriNetUnfolderBase]: For 999/999 co-relation queries the response was YES. [2025-01-10 01:03:56,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141875 conditions, 86071 events. 40272/86071 cut-off events. For 999/999 co-relation queries the response was YES. Maximal size of possible extension queue 4020. Compared 1041197 event pairs, 25332 based on Foata normal form. 0/68701 useless extension candidates. Maximal degree in co-relation 141774. Up to 36144 conditions per place. [2025-01-10 01:03:56,805 INFO L140 encePairwiseOnDemand]: 111/120 looper letters, 156 selfloop transitions, 50 changer transitions 0/254 dead transitions. [2025-01-10 01:03:56,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 254 transitions, 2039 flow [2025-01-10 01:03:56,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:03:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 01:03:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1081 transitions. [2025-01-10 01:03:56,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6005555555555555 [2025-01-10 01:03:56,807 INFO L175 Difference]: Start difference. First operand has 166 places, 178 transitions, 1204 flow. Second operand 15 states and 1081 transitions. [2025-01-10 01:03:56,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 254 transitions, 2039 flow [2025-01-10 01:03:56,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 254 transitions, 2027 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:56,818 INFO L231 Difference]: Finished difference. Result has 177 places, 194 transitions, 1458 flow [2025-01-10 01:03:56,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1458, PETRI_PLACES=177, PETRI_TRANSITIONS=194} [2025-01-10 01:03:56,819 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 63 predicate places. [2025-01-10 01:03:56,819 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 194 transitions, 1458 flow [2025-01-10 01:03:56,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 67.22727272727273) internal successors, (1479), 22 states have internal predecessors, (1479), 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 01:03:56,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:56,820 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 01:03:56,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:03:57,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:57,020 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-01-10 01:03:57,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:57,021 INFO L85 PathProgramCache]: Analyzing trace with hash 192120922, now seen corresponding path program 1 times [2025-01-10 01:03:57,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:57,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3152087] [2025-01-10 01:03:57,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:57,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:57,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:03:57,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:03:57,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:57,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:57,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:57,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3152087] [2025-01-10 01:03:57,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3152087] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:57,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386656090] [2025-01-10 01:03:57,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:57,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:57,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:57,669 INFO L229 MonitoredProcess]: Starting monitored process 14 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 01:03:57,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:03:57,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:03:57,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:03:57,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:57,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:57,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-10 01:03:57,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:57,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:03:57,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:03:57,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-01-10 01:03:57,924 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 01:03:57,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 01:03:58,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:03:58,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-01-10 01:03:58,040 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-01-10 01:03:58,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-01-10 01:03:58,181 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-01-10 01:03:58,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-01-10 01:03:58,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-01-10 01:03:58,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:03:58,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-01-10 01:03:58,365 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-10 01:03:58,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-10 01:04:02,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:04:02,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-01-10 01:04:02,563 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2025-01-10 01:04:02,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2025-01-10 01:04:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:04:02,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:04:02,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386656090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:02,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:04:02,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 12 [2025-01-10 01:04:02,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715165411] [2025-01-10 01:04:02,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:02,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:04:02,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:02,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:04:02,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:04:03,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 120 [2025-01-10 01:04:03,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 194 transitions, 1458 flow. Second operand has 9 states, 9 states have (on average 56.333333333333336) internal successors, (507), 9 states have internal predecessors, (507), 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 01:04:03,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:03,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 120 [2025-01-10 01:04:03,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand