./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-node-symm.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-symm.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 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:02:57,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:02:58,003 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:58,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:02:58,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:02:58,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:02:58,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:02:58,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:02:58,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:02:58,028 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:02:58,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:02:58,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:02:58,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:02:58,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:02:58,028 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:02:58,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:02:58,028 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:02:58,029 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:02:58,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:02:58,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:02:58,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:02:58,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:02:58,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:02:58,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:02:58,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:02:58,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:02:58,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:02:58,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:02:58,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:02:58,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:02:58,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:02:58,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:02:58,030 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 -> 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 [2025-01-10 01:02:58,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:02:58,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:02:58,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:02:58,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:02:58,250 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:02:58,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-01-10 01:02:59,406 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24255145d/2beefb113f024e3da615cdce8316f117/FLAG4c7fc0f28 [2025-01-10 01:02:59,682 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:02:59,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-01-10 01:02:59,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24255145d/2beefb113f024e3da615cdce8316f117/FLAG4c7fc0f28 [2025-01-10 01:02:59,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24255145d/2beefb113f024e3da615cdce8316f117 [2025-01-10 01:02:59,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:02:59,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:02:59,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:02:59,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:02:59,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:02:59,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:02:59,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d607fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:59, skipping insertion in model container [2025-01-10 01:02:59,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:02:59" (1/1) ... [2025-01-10 01:03:00,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:03:00,137 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:00,148 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:00,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:03:00,166 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:03:00,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:03:00,204 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:03:00,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:00 WrapperNode [2025-01-10 01:03:00,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:03:00,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:03:00,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:03:00,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:03:00,212 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:00" (1/1) ... [2025-01-10 01:03:00,220 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:00" (1/1) ... [2025-01-10 01:03:00,247 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 279 [2025-01-10 01:03:00,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:03:00,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:03:00,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:03:00,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:03:00,259 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:00" (1/1) ... [2025-01-10 01:03:00,260 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:00" (1/1) ... [2025-01-10 01:03:00,268 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:00" (1/1) ... [2025-01-10 01:03:00,287 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 10, 6]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-01-10 01:03:00,287 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:00" (1/1) ... [2025-01-10 01:03:00,287 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:00" (1/1) ... [2025-01-10 01:03:00,297 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:00" (1/1) ... [2025-01-10 01:03:00,304 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:00" (1/1) ... [2025-01-10 01:03:00,307 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:00" (1/1) ... [2025-01-10 01:03:00,308 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:00" (1/1) ... [2025-01-10 01:03:00,309 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:00" (1/1) ... [2025-01-10 01:03:00,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:03:00,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:03:00,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:03:00,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:03:00,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:00" (1/1) ... [2025-01-10 01:03:00,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:03:00,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:00,340 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:00,342 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:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:03:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:03:00,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:03:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:03:00,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:03:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:03:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:03:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:03:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:03:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:03:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:03:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:03:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:03:00,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:03:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:03:00,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:03:00,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:03:00,362 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:00,448 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:03:00,449 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:03:00,851 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:03:00,851 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:03:01,114 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:03:01,115 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:03:01,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:03:01 BoogieIcfgContainer [2025-01-10 01:03:01,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:03:01,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:03:01,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:03:01,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:03:01,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:02:59" (1/3) ... [2025-01-10 01:03:01,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10795268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:03:01, skipping insertion in model container [2025-01-10 01:03:01,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:00" (2/3) ... [2025-01-10 01:03:01,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10795268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:03:01, skipping insertion in model container [2025-01-10 01:03:01,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:03:01" (3/3) ... [2025-01-10 01:03:01,122 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-01-10 01:03:01,134 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:03:01,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 75 locations, 1 initial locations, 4 loop locations, and 34 error locations. [2025-01-10 01:03:01,136 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:03:01,191 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:03:01,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 82 transitions, 178 flow [2025-01-10 01:03:01,254 INFO L124 PetriNetUnfolderBase]: 8/80 cut-off events. [2025-01-10 01:03:01,256 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:03:01,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 80 events. 8/80 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 239 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-01-10 01:03:01,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 82 transitions, 178 flow [2025-01-10 01:03:01,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 79 transitions, 170 flow [2025-01-10 01:03:01,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:03:01,286 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;@49ecc866, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:03:01,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-01-10 01:03:01,289 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:03:01,290 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:03:01,290 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:03:01,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:01,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:03:01,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:01,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:01,294 INFO L85 PathProgramCache]: Analyzing trace with hash 904427, now seen corresponding path program 1 times [2025-01-10 01:03:01,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:01,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834029022] [2025-01-10 01:03:01,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:01,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:01,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:03:01,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:03:01,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:01,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:01,515 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:01,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:01,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834029022] [2025-01-10 01:03:01,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834029022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:01,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:01,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:03:01,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870541012] [2025-01-10 01:03:01,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:01,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:01,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:01,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:01,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:01,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-01-10 01:03:01,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:01,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:01,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-01-10 01:03:01,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:01,782 INFO L124 PetriNetUnfolderBase]: 192/580 cut-off events. [2025-01-10 01:03:01,783 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 01:03:01,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 580 events. 192/580 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3498 event pairs, 113 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 827. Up to 301 conditions per place. [2025-01-10 01:03:01,788 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 32 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-01-10 01:03:01,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 75 transitions, 230 flow [2025-01-10 01:03:01,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-01-10 01:03:01,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6869918699186992 [2025-01-10 01:03:01,799 INFO L175 Difference]: Start difference. First operand has 78 places, 79 transitions, 170 flow. Second operand 3 states and 169 transitions. [2025-01-10 01:03:01,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 75 transitions, 230 flow [2025-01-10 01:03:01,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 75 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:03:01,805 INFO L231 Difference]: Finished difference. Result has 72 places, 75 transitions, 158 flow [2025-01-10 01:03:01,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2025-01-10 01:03:01,809 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -6 predicate places. [2025-01-10 01:03:01,809 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 158 flow [2025-01-10 01:03:01,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:01,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:01,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:03:01,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:03:01,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:01,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash 904428, now seen corresponding path program 1 times [2025-01-10 01:03:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:01,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021602613] [2025-01-10 01:03:01,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:01,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:01,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:03:01,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:03:01,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:01,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:02,049 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:02,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:02,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021602613] [2025-01-10 01:03:02,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021602613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:02,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:02,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:03:02,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577310030] [2025-01-10 01:03:02,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:02,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:02,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:02,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:02,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:02,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-01-10 01:03:02,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:02,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:02,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-01-10 01:03:02,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:02,222 INFO L124 PetriNetUnfolderBase]: 193/583 cut-off events. [2025-01-10 01:03:02,223 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:03:02,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 583 events. 193/583 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3520 event pairs, 113 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 877. Up to 310 conditions per place. [2025-01-10 01:03:02,229 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 36 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2025-01-10 01:03:02,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 78 transitions, 242 flow [2025-01-10 01:03:02,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2025-01-10 01:03:02,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6991869918699187 [2025-01-10 01:03:02,231 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 158 flow. Second operand 3 states and 172 transitions. [2025-01-10 01:03:02,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 78 transitions, 242 flow [2025-01-10 01:03:02,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 78 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:02,234 INFO L231 Difference]: Finished difference. Result has 73 places, 77 transitions, 173 flow [2025-01-10 01:03:02,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=73, PETRI_TRANSITIONS=77} [2025-01-10 01:03:02,235 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -5 predicate places. [2025-01-10 01:03:02,235 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 77 transitions, 173 flow [2025-01-10 01:03:02,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:02,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:02,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:03:02,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:03:02,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:02,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:02,236 INFO L85 PathProgramCache]: Analyzing trace with hash 28037202, now seen corresponding path program 1 times [2025-01-10 01:03:02,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:02,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245438277] [2025-01-10 01:03:02,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:02,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:02,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:03:02,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:03:02,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:02,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:02,313 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:02,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:02,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245438277] [2025-01-10 01:03:02,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245438277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:02,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:02,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:03:02,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715188546] [2025-01-10 01:03:02,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:02,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:02,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:02,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:02,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:02,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:03:02,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 77 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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:02,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:02,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:03:02,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:02,418 INFO L124 PetriNetUnfolderBase]: 192/582 cut-off events. [2025-01-10 01:03:02,418 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:03:02,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 582 events. 192/582 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3504 event pairs, 113 based on Foata normal form. 1/427 useless extension candidates. Maximal degree in co-relation 894. Up to 305 conditions per place. [2025-01-10 01:03:02,422 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 30 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2025-01-10 01:03:02,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 77 transitions, 242 flow [2025-01-10 01:03:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2025-01-10 01:03:02,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7073170731707317 [2025-01-10 01:03:02,424 INFO L175 Difference]: Start difference. First operand has 73 places, 77 transitions, 173 flow. Second operand 3 states and 174 transitions. [2025-01-10 01:03:02,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 77 transitions, 242 flow [2025-01-10 01:03:02,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 77 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:03:02,425 INFO L231 Difference]: Finished difference. Result has 75 places, 77 transitions, 188 flow [2025-01-10 01:03:02,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=75, PETRI_TRANSITIONS=77} [2025-01-10 01:03:02,426 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -3 predicate places. [2025-01-10 01:03:02,426 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 188 flow [2025-01-10 01:03:02,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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:02,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:02,427 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:03:02,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:03:02,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:02,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:02,428 INFO L85 PathProgramCache]: Analyzing trace with hash 869184265, now seen corresponding path program 1 times [2025-01-10 01:03:02,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:02,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370977469] [2025-01-10 01:03:02,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:02,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:02,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:03:02,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:03:02,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:02,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:02,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:02,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370977469] [2025-01-10 01:03:02,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370977469] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:02,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303919415] [2025-01-10 01:03:02,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:02,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:02,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:02,660 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:02,662 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:02,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:03:02,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:03:02,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:02,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:02,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:03:02,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:02,769 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:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:02,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:03,022 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:03,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303919415] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:03,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:03,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:03:03,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920523365] [2025-01-10 01:03:03,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:03,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:03:03,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:03,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:03:03,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:03:03,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-01-10 01:03:03,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 188 flow. Second operand has 11 states, 11 states have (on average 45.36363636363637) internal successors, (499), 11 states have internal predecessors, (499), 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:03,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:03,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-01-10 01:03:03,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:03,608 INFO L124 PetriNetUnfolderBase]: 192/581 cut-off events. [2025-01-10 01:03:03,608 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:03:03,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 581 events. 192/581 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3509 event pairs, 113 based on Foata normal form. 1/427 useless extension candidates. Maximal degree in co-relation 888. Up to 305 conditions per place. [2025-01-10 01:03:03,612 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 32 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-01-10 01:03:03,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 76 transitions, 258 flow [2025-01-10 01:03:03,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:03:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:03:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 258 transitions. [2025-01-10 01:03:03,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6292682926829268 [2025-01-10 01:03:03,614 INFO L175 Difference]: Start difference. First operand has 75 places, 77 transitions, 188 flow. Second operand 5 states and 258 transitions. [2025-01-10 01:03:03,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 76 transitions, 258 flow [2025-01-10 01:03:03,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 76 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:03:03,616 INFO L231 Difference]: Finished difference. Result has 77 places, 76 transitions, 188 flow [2025-01-10 01:03:03,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=77, PETRI_TRANSITIONS=76} [2025-01-10 01:03:03,617 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2025-01-10 01:03:03,617 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 76 transitions, 188 flow [2025-01-10 01:03:03,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 45.36363636363637) internal successors, (499), 11 states have internal predecessors, (499), 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:03,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:03,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:03:03,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:03,817 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:03,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:03,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:03,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1174908373, now seen corresponding path program 1 times [2025-01-10 01:03:03,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:03,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240668475] [2025-01-10 01:03:03,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:03,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:03,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:03:03,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:03:03,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:03,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:04,019 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:04,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:04,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240668475] [2025-01-10 01:03:04,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240668475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:04,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:04,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:04,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840546397] [2025-01-10 01:03:04,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:04,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:04,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:04,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:04,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:04,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-01-10 01:03:04,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 76 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:04,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:04,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-01-10 01:03:04,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:04,273 INFO L124 PetriNetUnfolderBase]: 193/584 cut-off events. [2025-01-10 01:03:04,274 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:03:04,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 584 events. 193/584 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3512 event pairs, 113 based on Foata normal form. 1/430 useless extension candidates. Maximal degree in co-relation 895. Up to 308 conditions per place. [2025-01-10 01:03:04,277 INFO L140 encePairwiseOnDemand]: 75/82 looper letters, 34 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2025-01-10 01:03:04,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 79 transitions, 278 flow [2025-01-10 01:03:04,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:03:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:03:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 261 transitions. [2025-01-10 01:03:04,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6365853658536585 [2025-01-10 01:03:04,279 INFO L175 Difference]: Start difference. First operand has 77 places, 76 transitions, 188 flow. Second operand 5 states and 261 transitions. [2025-01-10 01:03:04,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 79 transitions, 278 flow [2025-01-10 01:03:04,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 79 transitions, 260 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 01:03:04,281 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 207 flow [2025-01-10 01:03:04,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2025-01-10 01:03:04,282 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2025-01-10 01:03:04,282 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 207 flow [2025-01-10 01:03:04,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:04,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:04,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:04,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:03:04,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:04,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:04,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2062422175, now seen corresponding path program 1 times [2025-01-10 01:03:04,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:04,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943184561] [2025-01-10 01:03:04,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:04,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:04,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:03:04,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:03:04,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:04,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:04,325 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:04,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:04,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943184561] [2025-01-10 01:03:04,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943184561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:04,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:04,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:03:04,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190222810] [2025-01-10 01:03:04,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:04,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:04,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:04,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:04,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:04,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-01-10 01:03:04,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 207 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:04,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-01-10 01:03:04,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:04,467 INFO L124 PetriNetUnfolderBase]: 193/582 cut-off events. [2025-01-10 01:03:04,468 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:03:04,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 582 events. 193/582 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3508 event pairs, 113 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 889. Up to 305 conditions per place. [2025-01-10 01:03:04,474 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 36 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-01-10 01:03:04,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 77 transitions, 281 flow [2025-01-10 01:03:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2025-01-10 01:03:04,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6829268292682927 [2025-01-10 01:03:04,476 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 207 flow. Second operand 3 states and 168 transitions. [2025-01-10 01:03:04,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 77 transitions, 281 flow [2025-01-10 01:03:04,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 77 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:04,478 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 204 flow [2025-01-10 01:03:04,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2025-01-10 01:03:04,479 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2025-01-10 01:03:04,480 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 204 flow [2025-01-10 01:03:04,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:04,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:04,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:03:04,481 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:04,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:04,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2062422176, now seen corresponding path program 1 times [2025-01-10 01:03:04,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:04,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126402925] [2025-01-10 01:03:04,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:04,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:04,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:03:04,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:03:04,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:04,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:04,563 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:04,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:04,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126402925] [2025-01-10 01:03:04,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126402925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:04,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:04,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:04,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604891109] [2025-01-10 01:03:04,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:04,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:04,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:04,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:04,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:04,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:03:04,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 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,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:04,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:03:04,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:04,709 INFO L124 PetriNetUnfolderBase]: 192/581 cut-off events. [2025-01-10 01:03:04,709 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:03:04,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 581 events. 192/581 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3493 event pairs, 113 based on Foata normal form. 1/430 useless extension candidates. Maximal degree in co-relation 884. Up to 306 conditions per place. [2025-01-10 01:03:04,714 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 34 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-01-10 01:03:04,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 274 flow [2025-01-10 01:03:04,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2025-01-10 01:03:04,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6798780487804879 [2025-01-10 01:03:04,716 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 204 flow. Second operand 4 states and 223 transitions. [2025-01-10 01:03:04,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 274 flow [2025-01-10 01:03:04,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 76 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:04,722 INFO L231 Difference]: Finished difference. Result has 78 places, 76 transitions, 202 flow [2025-01-10 01:03:04,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=78, PETRI_TRANSITIONS=76} [2025-01-10 01:03:04,722 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 0 predicate places. [2025-01-10 01:03:04,722 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 76 transitions, 202 flow [2025-01-10 01:03:04,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 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,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:04,723 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:04,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:03:04,723 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:04,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:04,723 INFO L85 PathProgramCache]: Analyzing trace with hash -489423538, now seen corresponding path program 1 times [2025-01-10 01:03:04,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:04,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055347189] [2025-01-10 01:03:04,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:04,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:04,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:03:04,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:03:04,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:04,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:04,967 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:04,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:04,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055347189] [2025-01-10 01:03:04,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055347189] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:04,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505611812] [2025-01-10 01:03:04,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:04,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:04,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:04,970 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:04,972 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:05,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:03:05,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:03:05,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:05,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:05,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:03:05,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:05,053 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:05,156 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:05,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:05,275 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:05,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505611812] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:05,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:05,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:03:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604386539] [2025-01-10 01:03:05,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:05,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:03:05,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:05,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:03:05,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:03:05,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-01-10 01:03:05,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 76 transitions, 202 flow. Second operand has 13 states, 13 states have (on average 45.61538461538461) internal successors, (593), 13 states have internal predecessors, (593), 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,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:05,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-01-10 01:03:05,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:06,078 INFO L124 PetriNetUnfolderBase]: 192/580 cut-off events. [2025-01-10 01:03:06,078 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:03:06,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 580 events. 192/580 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3493 event pairs, 113 based on Foata normal form. 1/427 useless extension candidates. Maximal degree in co-relation 885. Up to 300 conditions per place. [2025-01-10 01:03:06,082 INFO L140 encePairwiseOnDemand]: 74/82 looper letters, 28 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2025-01-10 01:03:06,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 75 transitions, 274 flow [2025-01-10 01:03:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:03:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:03:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 347 transitions. [2025-01-10 01:03:06,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6045296167247387 [2025-01-10 01:03:06,085 INFO L175 Difference]: Start difference. First operand has 78 places, 76 transitions, 202 flow. Second operand 7 states and 347 transitions. [2025-01-10 01:03:06,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 75 transitions, 274 flow [2025-01-10 01:03:06,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:06,088 INFO L231 Difference]: Finished difference. Result has 80 places, 75 transitions, 210 flow [2025-01-10 01:03:06,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=80, PETRI_TRANSITIONS=75} [2025-01-10 01:03:06,090 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 2 predicate places. [2025-01-10 01:03:06,090 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 210 flow [2025-01-10 01:03:06,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 45.61538461538461) internal successors, (593), 13 states have internal predecessors, (593), 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,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:06,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:06,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:03:06,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:06,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:06,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:06,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2007740487, now seen corresponding path program 1 times [2025-01-10 01:03:06,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:06,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095585549] [2025-01-10 01:03:06,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:06,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:06,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:03:06,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:03:06,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:06,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:06,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:06,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095585549] [2025-01-10 01:03:06,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095585549] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:06,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400443049] [2025-01-10 01:03:06,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:06,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:06,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:06,492 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:06,494 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:06,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:03:06,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:03:06,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:06,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:06,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:03:06,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:06,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:03:06,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2025-01-10 01:03:06,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2025-01-10 01:03:06,651 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:06,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:03:06,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400443049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:06,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:03:06,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2025-01-10 01:03:06,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288875806] [2025-01-10 01:03:06,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:06,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:06,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:06,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:06,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:03:06,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-01-10 01:03:06,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:06,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-01-10 01:03:06,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:06,810 INFO L124 PetriNetUnfolderBase]: 193/583 cut-off events. [2025-01-10 01:03:06,810 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:03:06,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 583 events. 193/583 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3500 event pairs, 113 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 892. Up to 313 conditions per place. [2025-01-10 01:03:06,813 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 39 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2025-01-10 01:03:06,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 78 transitions, 302 flow [2025-01-10 01:03:06,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2025-01-10 01:03:06,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6585365853658537 [2025-01-10 01:03:06,815 INFO L175 Difference]: Start difference. First operand has 80 places, 75 transitions, 210 flow. Second operand 4 states and 216 transitions. [2025-01-10 01:03:06,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 78 transitions, 302 flow [2025-01-10 01:03:06,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 78 transitions, 283 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 01:03:06,820 INFO L231 Difference]: Finished difference. Result has 79 places, 77 transitions, 212 flow [2025-01-10 01:03:06,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2025-01-10 01:03:06,821 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2025-01-10 01:03:06,822 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 212 flow [2025-01-10 01:03:06,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:06,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:06,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:03:07,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:07,027 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:07,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:07,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2110414409, now seen corresponding path program 1 times [2025-01-10 01:03:07,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:07,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733183630] [2025-01-10 01:03:07,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:07,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:07,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:03:07,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:03:07,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:07,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:07,106 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:07,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:07,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733183630] [2025-01-10 01:03:07,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733183630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:07,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:07,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:07,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641998420] [2025-01-10 01:03:07,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:07,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:07,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:07,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:07,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:07,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:03:07,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:07,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:03:07,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:07,221 INFO L124 PetriNetUnfolderBase]: 192/582 cut-off events. [2025-01-10 01:03:07,221 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:03:07,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 582 events. 192/582 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3499 event pairs, 113 based on Foata normal form. 1/430 useless extension candidates. Maximal degree in co-relation 884. Up to 310 conditions per place. [2025-01-10 01:03:07,224 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 37 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-01-10 01:03:07,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 77 transitions, 289 flow [2025-01-10 01:03:07,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:07,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 221 transitions. [2025-01-10 01:03:07,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6737804878048781 [2025-01-10 01:03:07,226 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 212 flow. Second operand 4 states and 221 transitions. [2025-01-10 01:03:07,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 77 transitions, 289 flow [2025-01-10 01:03:07,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 77 transitions, 285 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:07,227 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 209 flow [2025-01-10 01:03:07,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2025-01-10 01:03:07,228 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 2 predicate places. [2025-01-10 01:03:07,228 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 209 flow [2025-01-10 01:03:07,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:07,229 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:07,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:03:07,229 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:07,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:07,229 INFO L85 PathProgramCache]: Analyzing trace with hash 998320829, now seen corresponding path program 1 times [2025-01-10 01:03:07,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:07,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650962659] [2025-01-10 01:03:07,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:07,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:07,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:03:07,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:03:07,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:07,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:07,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:07,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650962659] [2025-01-10 01:03:07,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650962659] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:07,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618685323] [2025-01-10 01:03:07,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:07,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:07,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:07,353 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:07,354 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:07,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:03:07,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:03:07,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:07,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:07,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:03:07,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:07,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:07,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618685323] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:07,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:07,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:03:07,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101887963] [2025-01-10 01:03:07,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:07,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:03:07,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:07,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:03:07,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:03:07,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:03:07,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 209 flow. Second operand has 14 states, 14 states have (on average 47.785714285714285) internal successors, (669), 14 states have internal predecessors, (669), 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,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:07,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:03:07,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:07,938 INFO L124 PetriNetUnfolderBase]: 375/1129 cut-off events. [2025-01-10 01:03:07,938 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-10 01:03:07,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1802 conditions, 1129 events. 375/1129 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8081 event pairs, 225 based on Foata normal form. 1/843 useless extension candidates. Maximal degree in co-relation 877. Up to 299 conditions per place. [2025-01-10 01:03:07,944 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 57 selfloop transitions, 17 changer transitions 0/111 dead transitions. [2025-01-10 01:03:07,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 111 transitions, 468 flow [2025-01-10 01:03:07,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:03:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:03:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 530 transitions. [2025-01-10 01:03:07,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6463414634146342 [2025-01-10 01:03:07,946 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 209 flow. Second operand 10 states and 530 transitions. [2025-01-10 01:03:07,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 111 transitions, 468 flow [2025-01-10 01:03:07,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 111 transitions, 458 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:07,948 INFO L231 Difference]: Finished difference. Result has 91 places, 86 transitions, 323 flow [2025-01-10 01:03:07,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=323, PETRI_PLACES=91, PETRI_TRANSITIONS=86} [2025-01-10 01:03:07,952 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 13 predicate places. [2025-01-10 01:03:07,952 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 86 transitions, 323 flow [2025-01-10 01:03:07,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 47.785714285714285) internal successors, (669), 14 states have internal predecessors, (669), 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,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:07,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:07,960 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:08,159 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:08,159 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:08,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:08,159 INFO L85 PathProgramCache]: Analyzing trace with hash 883176083, now seen corresponding path program 1 times [2025-01-10 01:03:08,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:08,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954826333] [2025-01-10 01:03:08,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:08,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:03:08,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:03:08,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:08,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:08,290 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:08,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:08,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954826333] [2025-01-10 01:03:08,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954826333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:08,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:08,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:08,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859971213] [2025-01-10 01:03:08,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:08,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:08,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:08,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:08,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:08,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-01-10 01:03:08,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 86 transitions, 323 flow. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:08,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:08,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-01-10 01:03:08,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:08,511 INFO L124 PetriNetUnfolderBase]: 382/1162 cut-off events. [2025-01-10 01:03:08,511 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 01:03:08,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1162 events. 382/1162 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8341 event pairs, 226 based on Foata normal form. 0/855 useless extension candidates. Maximal degree in co-relation 925. Up to 622 conditions per place. [2025-01-10 01:03:08,517 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 49 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2025-01-10 01:03:08,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 433 flow [2025-01-10 01:03:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2025-01-10 01:03:08,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6585365853658537 [2025-01-10 01:03:08,519 INFO L175 Difference]: Start difference. First operand has 91 places, 86 transitions, 323 flow. Second operand 4 states and 216 transitions. [2025-01-10 01:03:08,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 433 flow [2025-01-10 01:03:08,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 88 transitions, 429 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 01:03:08,521 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 338 flow [2025-01-10 01:03:08,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=338, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2025-01-10 01:03:08,522 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 16 predicate places. [2025-01-10 01:03:08,522 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 338 flow [2025-01-10 01:03:08,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:08,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:08,522 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:08,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:03:08,522 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:08,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:08,523 INFO L85 PathProgramCache]: Analyzing trace with hash -155409446, now seen corresponding path program 2 times [2025-01-10 01:03:08,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:08,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103964148] [2025-01-10 01:03:08,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:08,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:08,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 01:03:08,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:03:08,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:08,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:08,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:08,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103964148] [2025-01-10 01:03:08,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103964148] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:08,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487409779] [2025-01-10 01:03:08,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:08,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:08,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:08,751 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:08,753 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:08,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 01:03:08,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:03:08,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:08,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:08,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 01:03:08,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:08,854 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:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:03:08,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:09,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487409779] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:09,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:09,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 14 [2025-01-10 01:03:09,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681708106] [2025-01-10 01:03:09,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:09,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:03:09,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:09,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:03:09,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:03:09,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-01-10 01:03:09,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 338 flow. Second operand has 16 states, 16 states have (on average 46.1875) internal successors, (739), 16 states have internal predecessors, (739), 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,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:09,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-01-10 01:03:09,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:09,788 INFO L124 PetriNetUnfolderBase]: 382/1161 cut-off events. [2025-01-10 01:03:09,788 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 01:03:09,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1896 conditions, 1161 events. 382/1161 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8359 event pairs, 226 based on Foata normal form. 0/857 useless extension candidates. Maximal degree in co-relation 930. Up to 606 conditions per place. [2025-01-10 01:03:09,794 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 37 selfloop transitions, 15 changer transitions 0/87 dead transitions. [2025-01-10 01:03:09,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 87 transitions, 442 flow [2025-01-10 01:03:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:03:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:03:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 482 transitions. [2025-01-10 01:03:09,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878048780487805 [2025-01-10 01:03:09,796 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 338 flow. Second operand 10 states and 482 transitions. [2025-01-10 01:03:09,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 87 transitions, 442 flow [2025-01-10 01:03:09,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 87 transitions, 437 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:09,798 INFO L231 Difference]: Finished difference. Result has 100 places, 87 transitions, 363 flow [2025-01-10 01:03:09,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=363, PETRI_PLACES=100, PETRI_TRANSITIONS=87} [2025-01-10 01:03:09,799 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 22 predicate places. [2025-01-10 01:03:09,799 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 87 transitions, 363 flow [2025-01-10 01:03:09,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 46.1875) internal successors, (739), 16 states have internal predecessors, (739), 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,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:09,800 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:09,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:03:10,004 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,SelfDestructingSolverStorable12 [2025-01-10 01:03:10,004 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:10,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:10,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1671278900, now seen corresponding path program 1 times [2025-01-10 01:03:10,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:10,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472109666] [2025-01-10 01:03:10,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:10,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:10,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:03:10,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:03:10,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:10,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:10,136 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:10,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:10,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472109666] [2025-01-10 01:03:10,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472109666] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:10,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969621308] [2025-01-10 01:03:10,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:10,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:10,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:10,140 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:10,141 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:10,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:03:10,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:03:10,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:10,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:10,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:03:10,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:10,260 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:10,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:10,312 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:10,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969621308] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:10,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:10,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-10 01:03:10,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590178250] [2025-01-10 01:03:10,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:10,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:03:10,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:10,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:03:10,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:03:10,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:03:10,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 87 transitions, 363 flow. Second operand has 14 states, 14 states have (on average 48.0) internal successors, (672), 14 states have internal predecessors, (672), 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,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:10,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:03:10,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:10,774 INFO L124 PetriNetUnfolderBase]: 745/2245 cut-off events. [2025-01-10 01:03:10,774 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-10 01:03:10,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3641 conditions, 2245 events. 745/2245 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 18907 event pairs, 450 based on Foata normal form. 2/1681 useless extension candidates. Maximal degree in co-relation 1799. Up to 596 conditions per place. [2025-01-10 01:03:10,790 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 66 selfloop transitions, 22 changer transitions 0/124 dead transitions. [2025-01-10 01:03:10,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 124 transitions, 704 flow [2025-01-10 01:03:10,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:03:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:03:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 436 transitions. [2025-01-10 01:03:10,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6646341463414634 [2025-01-10 01:03:10,792 INFO L175 Difference]: Start difference. First operand has 100 places, 87 transitions, 363 flow. Second operand 8 states and 436 transitions. [2025-01-10 01:03:10,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 124 transitions, 704 flow [2025-01-10 01:03:10,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 124 transitions, 642 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-01-10 01:03:10,794 INFO L231 Difference]: Finished difference. Result has 105 places, 97 transitions, 492 flow [2025-01-10 01:03:10,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=492, PETRI_PLACES=105, PETRI_TRANSITIONS=97} [2025-01-10 01:03:10,795 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 27 predicate places. [2025-01-10 01:03:10,795 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 97 transitions, 492 flow [2025-01-10 01:03:10,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 48.0) internal successors, (672), 14 states have internal predecessors, (672), 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,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:10,795 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:10,802 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:10,996 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,SelfDestructingSolverStorable13 [2025-01-10 01:03:10,996 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:10,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:10,996 INFO L85 PathProgramCache]: Analyzing trace with hash -540535483, now seen corresponding path program 2 times [2025-01-10 01:03:10,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:10,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107644235] [2025-01-10 01:03:10,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:10,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:11,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 01:03:11,020 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:11,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:11,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:11,237 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:11,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107644235] [2025-01-10 01:03:11,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107644235] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781317540] [2025-01-10 01:03:11,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:11,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:11,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:11,239 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:11,242 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:11,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 01:03:11,327 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:11,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:11,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:11,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:03:11,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:11,370 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:11,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:11,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:11,600 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:11,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781317540] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:11,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:11,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 13 [2025-01-10 01:03:11,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675939328] [2025-01-10 01:03:11,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:11,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:03:11,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:11,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:03:11,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:03:11,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-01-10 01:03:11,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 97 transitions, 492 flow. Second operand has 15 states, 15 states have (on average 46.6) internal successors, (699), 15 states have internal predecessors, (699), 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,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:11,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-01-10 01:03:11,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:12,331 INFO L124 PetriNetUnfolderBase]: 759/2301 cut-off events. [2025-01-10 01:03:12,331 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-01-10 01:03:12,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 2301 events. 759/2301 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19511 event pairs, 452 based on Foata normal form. 0/1697 useless extension candidates. Maximal degree in co-relation 1847. Up to 1197 conditions per place. [2025-01-10 01:03:12,343 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 41 selfloop transitions, 21 changer transitions 0/97 dead transitions. [2025-01-10 01:03:12,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 97 transitions, 616 flow [2025-01-10 01:03:12,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:03:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:03:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 481 transitions. [2025-01-10 01:03:12,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5865853658536585 [2025-01-10 01:03:12,345 INFO L175 Difference]: Start difference. First operand has 105 places, 97 transitions, 492 flow. Second operand 10 states and 481 transitions. [2025-01-10 01:03:12,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 97 transitions, 616 flow [2025-01-10 01:03:12,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 97 transitions, 610 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 01:03:12,347 INFO L231 Difference]: Finished difference. Result has 112 places, 97 transitions, 528 flow [2025-01-10 01:03:12,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=528, PETRI_PLACES=112, PETRI_TRANSITIONS=97} [2025-01-10 01:03:12,348 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 34 predicate places. [2025-01-10 01:03:12,348 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 97 transitions, 528 flow [2025-01-10 01:03:12,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 46.6) internal successors, (699), 15 states have internal predecessors, (699), 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:12,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:12,348 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:12,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:03:12,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:12,553 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:12,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:12,554 INFO L85 PathProgramCache]: Analyzing trace with hash 218888162, now seen corresponding path program 1 times [2025-01-10 01:03:12,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:12,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646259400] [2025-01-10 01:03:12,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:12,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:12,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:03:12,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:03:12,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:12,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:12,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:12,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646259400] [2025-01-10 01:03:12,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646259400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:12,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:12,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:12,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3822590] [2025-01-10 01:03:12,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:12,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:12,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:12,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:12,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:12,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 82 [2025-01-10 01:03:12,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 97 transitions, 528 flow. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:12,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:12,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 82 [2025-01-10 01:03:12,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:12,999 INFO L124 PetriNetUnfolderBase]: 847/2321 cut-off events. [2025-01-10 01:03:13,000 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-10 01:03:13,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3934 conditions, 2321 events. 847/2321 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 19010 event pairs, 524 based on Foata normal form. 0/1873 useless extension candidates. Maximal degree in co-relation 1944. Up to 1352 conditions per place. [2025-01-10 01:03:13,012 INFO L140 encePairwiseOnDemand]: 75/82 looper letters, 56 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2025-01-10 01:03:13,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 93 transitions, 646 flow [2025-01-10 01:03:13,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:03:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:03:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2025-01-10 01:03:13,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707317073170731 [2025-01-10 01:03:13,013 INFO L175 Difference]: Start difference. First operand has 112 places, 97 transitions, 528 flow. Second operand 5 states and 234 transitions. [2025-01-10 01:03:13,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 93 transitions, 646 flow [2025-01-10 01:03:13,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 93 transitions, 582 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-01-10 01:03:13,018 INFO L231 Difference]: Finished difference. Result has 103 places, 93 transitions, 470 flow [2025-01-10 01:03:13,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=470, PETRI_PLACES=103, PETRI_TRANSITIONS=93} [2025-01-10 01:03:13,020 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 25 predicate places. [2025-01-10 01:03:13,020 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 93 transitions, 470 flow [2025-01-10 01:03:13,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:13,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:13,020 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:13,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:03:13,021 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:13,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:13,021 INFO L85 PathProgramCache]: Analyzing trace with hash 218888163, now seen corresponding path program 1 times [2025-01-10 01:03:13,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:13,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720481003] [2025-01-10 01:03:13,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:13,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:13,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:03:13,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:03:13,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:13,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:03:13,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:13,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720481003] [2025-01-10 01:03:13,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720481003] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:13,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026971316] [2025-01-10 01:03:13,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:13,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:13,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:13,318 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:13,320 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:13,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:03:13,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:03:13,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:13,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:13,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 01:03:13,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:13,408 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:13,414 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:13,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:03:13,465 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:13,485 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:03:13,486 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 19 treesize of output 16 [2025-01-10 01:03:13,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:03:13,522 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:13,535 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:03:13,536 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 19 treesize of output 16 [2025-01-10 01:03:13,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:03:13,561 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:13,567 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:03:13,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:03:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:13,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:03:13,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026971316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:13,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:03:13,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2025-01-10 01:03:13,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633344355] [2025-01-10 01:03:13,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:13,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:03:13,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:13,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:03:13,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:03:13,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 82 [2025-01-10 01:03:13,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 93 transitions, 470 flow. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 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,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:13,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 82 [2025-01-10 01:03:13,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:13,987 INFO L124 PetriNetUnfolderBase]: 847/2197 cut-off events. [2025-01-10 01:03:13,987 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-01-10 01:03:13,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3766 conditions, 2197 events. 847/2197 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17209 event pairs, 524 based on Foata normal form. 0/1747 useless extension candidates. Maximal degree in co-relation 1860. Up to 1366 conditions per place. [2025-01-10 01:03:13,998 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 60 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2025-01-10 01:03:13,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 89 transitions, 588 flow [2025-01-10 01:03:13,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2025-01-10 01:03:14,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5457317073170732 [2025-01-10 01:03:14,000 INFO L175 Difference]: Start difference. First operand has 103 places, 93 transitions, 470 flow. Second operand 4 states and 179 transitions. [2025-01-10 01:03:14,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 89 transitions, 588 flow [2025-01-10 01:03:14,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 89 transitions, 578 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:14,003 INFO L231 Difference]: Finished difference. Result has 99 places, 89 transitions, 458 flow [2025-01-10 01:03:14,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=458, PETRI_PLACES=99, PETRI_TRANSITIONS=89} [2025-01-10 01:03:14,004 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 21 predicate places. [2025-01-10 01:03:14,004 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 89 transitions, 458 flow [2025-01-10 01:03:14,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 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,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:14,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:14,011 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:14,209 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:14,209 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:14,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:14,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1804400569, now seen corresponding path program 1 times [2025-01-10 01:03:14,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:14,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244469417] [2025-01-10 01:03:14,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:14,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:03:14,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:03:14,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:14,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:03:14,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:14,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244469417] [2025-01-10 01:03:14,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244469417] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:14,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231829992] [2025-01-10 01:03:14,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:14,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:14,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:14,312 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:14,317 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:14,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:03:14,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:03:14,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:14,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:14,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:03:14,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:14,397 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:14,421 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:03:14,422 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 19 treesize of output 16 [2025-01-10 01:03:14,434 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-10 01:03:14,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-10 01:03:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 01:03:14,457 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:03:14,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231829992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:14,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:03:14,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2025-01-10 01:03:14,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446345188] [2025-01-10 01:03:14,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:14,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:14,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:14,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:14,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:14,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 82 [2025-01-10 01:03:14,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 89 transitions, 458 flow. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:14,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 82 [2025-01-10 01:03:14,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:14,673 INFO L124 PetriNetUnfolderBase]: 863/2085 cut-off events. [2025-01-10 01:03:14,673 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-10 01:03:14,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3670 conditions, 2085 events. 863/2085 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15233 event pairs, 532 based on Foata normal form. 0/1823 useless extension candidates. Maximal degree in co-relation 1812. Up to 1372 conditions per place. [2025-01-10 01:03:14,682 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 58 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2025-01-10 01:03:14,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 85 transitions, 576 flow [2025-01-10 01:03:14,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2025-01-10 01:03:14,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5945121951219512 [2025-01-10 01:03:14,683 INFO L175 Difference]: Start difference. First operand has 99 places, 89 transitions, 458 flow. Second operand 4 states and 195 transitions. [2025-01-10 01:03:14,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 85 transitions, 576 flow [2025-01-10 01:03:14,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 85 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:14,686 INFO L231 Difference]: Finished difference. Result has 96 places, 85 transitions, 456 flow [2025-01-10 01:03:14,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=456, PETRI_PLACES=96, PETRI_TRANSITIONS=85} [2025-01-10 01:03:14,688 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 18 predicate places. [2025-01-10 01:03:14,688 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 85 transitions, 456 flow [2025-01-10 01:03:14,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:14,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:14,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:14,889 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:14,889 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:14,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:14,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1804400568, now seen corresponding path program 1 times [2025-01-10 01:03:14,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:14,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035337624] [2025-01-10 01:03:14,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:14,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:03:14,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:03:14,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:14,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:15,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:15,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035337624] [2025-01-10 01:03:15,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035337624] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:15,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986964700] [2025-01-10 01:03:15,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:15,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:15,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:15,171 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:15,172 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:15,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:03:15,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:03:15,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:15,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:15,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 01:03:15,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:15,266 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:15,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:03:15,320 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:15,333 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:03:15,333 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 19 treesize of output 16 [2025-01-10 01:03:15,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:03:15,372 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:15,379 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:03:15,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:03:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:03:15,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:15,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2025-01-10 01:03:15,780 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:03:15,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 100 [2025-01-10 01:03:15,790 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:03:15,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986964700] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:15,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:15,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-01-10 01:03:15,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198283922] [2025-01-10 01:03:15,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:15,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:03:15,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:15,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:03:15,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:03:16,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 82 [2025-01-10 01:03:16,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 85 transitions, 456 flow. Second operand has 16 states, 16 states have (on average 37.625) internal successors, (602), 16 states have internal predecessors, (602), 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:16,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:16,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 82 [2025-01-10 01:03:16,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:16,780 INFO L124 PetriNetUnfolderBase]: 863/1961 cut-off events. [2025-01-10 01:03:16,780 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-10 01:03:16,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3550 conditions, 1961 events. 863/1961 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13557 event pairs, 532 based on Foata normal form. 0/1699 useless extension candidates. Maximal degree in co-relation 1752. Up to 1372 conditions per place. [2025-01-10 01:03:16,789 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 51 selfloop transitions, 12 changer transitions 0/81 dead transitions. [2025-01-10 01:03:16,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 81 transitions, 574 flow [2025-01-10 01:03:16,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:03:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:03:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 250 transitions. [2025-01-10 01:03:16,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.508130081300813 [2025-01-10 01:03:16,793 INFO L175 Difference]: Start difference. First operand has 96 places, 85 transitions, 456 flow. Second operand 6 states and 250 transitions. [2025-01-10 01:03:16,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 81 transitions, 574 flow [2025-01-10 01:03:16,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 81 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:16,797 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 466 flow [2025-01-10 01:03:16,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2025-01-10 01:03:16,797 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 17 predicate places. [2025-01-10 01:03:16,797 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 466 flow [2025-01-10 01:03:16,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 37.625) internal successors, (602), 16 states have internal predecessors, (602), 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:16,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:16,798 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:16,808 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:17,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:17,002 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:17,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash -101841787, now seen corresponding path program 1 times [2025-01-10 01:03:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254468517] [2025-01-10 01:03:17,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:17,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:17,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:03:17,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:03:17,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:17,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:17,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:17,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254468517] [2025-01-10 01:03:17,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254468517] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:17,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131350943] [2025-01-10 01:03:17,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:17,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:17,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:17,068 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:17,070 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:17,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:03:17,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:03:17,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:17,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:17,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:03:17,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:17,149 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:17,164 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-10 01:03:17,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-10 01:03:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:03:17,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:03:17,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131350943] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:17,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:17,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-01-10 01:03:17,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035935229] [2025-01-10 01:03:17,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:17,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:17,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:17,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:17,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:17,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 82 [2025-01-10 01:03:17,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 466 flow. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:17,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 82 [2025-01-10 01:03:17,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:17,418 INFO L124 PetriNetUnfolderBase]: 759/1773 cut-off events. [2025-01-10 01:03:17,418 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-01-10 01:03:17,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 1773 events. 759/1773 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12178 event pairs, 452 based on Foata normal form. 0/1567 useless extension candidates. Maximal degree in co-relation 1580. Up to 1176 conditions per place. [2025-01-10 01:03:17,426 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 52 selfloop transitions, 10 changer transitions 0/79 dead transitions. [2025-01-10 01:03:17,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 79 transitions, 586 flow [2025-01-10 01:03:17,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:03:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:03:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 246 transitions. [2025-01-10 01:03:17,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-01-10 01:03:17,427 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 466 flow. Second operand 5 states and 246 transitions. [2025-01-10 01:03:17,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 79 transitions, 586 flow [2025-01-10 01:03:17,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 79 transitions, 566 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:03:17,429 INFO L231 Difference]: Finished difference. Result has 93 places, 79 transitions, 462 flow [2025-01-10 01:03:17,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=462, PETRI_PLACES=93, PETRI_TRANSITIONS=79} [2025-01-10 01:03:17,429 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 15 predicate places. [2025-01-10 01:03:17,430 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 79 transitions, 462 flow [2025-01-10 01:03:17,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:17,430 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:17,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:17,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:17,630 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:17,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:17,631 INFO L85 PathProgramCache]: Analyzing trace with hash -101841786, now seen corresponding path program 1 times [2025-01-10 01:03:17,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:17,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687415761] [2025-01-10 01:03:17,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:17,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:03:17,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:03:17,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:17,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:17,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:17,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687415761] [2025-01-10 01:03:17,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687415761] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:17,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681374096] [2025-01-10 01:03:17,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:17,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:17,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:17,814 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:17,815 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:17,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:03:17,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:03:17,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:17,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:17,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:03:17,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:17,929 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:17,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:03:17,970 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 16 treesize of output 11 [2025-01-10 01:03:17,977 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:03:17,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:03:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:18,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:18,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2025-01-10 01:03:18,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:03:18,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 37 [2025-01-10 01:03:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:18,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681374096] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:18,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:18,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-01-10 01:03:18,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486741131] [2025-01-10 01:03:18,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:18,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:03:18,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:18,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:03:18,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:03:18,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 82 [2025-01-10 01:03:18,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 79 transitions, 462 flow. Second operand has 18 states, 18 states have (on average 44.611111111111114) internal successors, (803), 18 states have internal predecessors, (803), 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,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:18,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 82 [2025-01-10 01:03:18,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:19,424 INFO L124 PetriNetUnfolderBase]: 881/2049 cut-off events. [2025-01-10 01:03:19,424 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-10 01:03:19,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3711 conditions, 2049 events. 881/2049 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14439 event pairs, 374 based on Foata normal form. 0/1789 useless extension candidates. Maximal degree in co-relation 2101. Up to 588 conditions per place. [2025-01-10 01:03:19,433 INFO L140 encePairwiseOnDemand]: 67/82 looper letters, 77 selfloop transitions, 29 changer transitions 0/121 dead transitions. [2025-01-10 01:03:19,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 121 transitions, 781 flow [2025-01-10 01:03:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:03:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:03:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 636 transitions. [2025-01-10 01:03:19,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5966228893058161 [2025-01-10 01:03:19,435 INFO L175 Difference]: Start difference. First operand has 93 places, 79 transitions, 462 flow. Second operand 13 states and 636 transitions. [2025-01-10 01:03:19,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 121 transitions, 781 flow [2025-01-10 01:03:19,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 121 transitions, 761 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:19,437 INFO L231 Difference]: Finished difference. Result has 107 places, 85 transitions, 572 flow [2025-01-10 01:03:19,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=572, PETRI_PLACES=107, PETRI_TRANSITIONS=85} [2025-01-10 01:03:19,438 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 29 predicate places. [2025-01-10 01:03:19,438 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 85 transitions, 572 flow [2025-01-10 01:03:19,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 44.611111111111114) internal successors, (803), 18 states have internal predecessors, (803), 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,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:19,439 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] [2025-01-10 01:03:19,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:19,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:19,640 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:19,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:19,640 INFO L85 PathProgramCache]: Analyzing trace with hash -558139155, now seen corresponding path program 1 times [2025-01-10 01:03:19,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:19,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684294820] [2025-01-10 01:03:19,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:19,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:19,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:03:19,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:03:19,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:19,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 01:03:19,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:19,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684294820] [2025-01-10 01:03:19,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684294820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:19,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:19,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:19,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610407346] [2025-01-10 01:03:19,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:19,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:19,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:19,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:19,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:19,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 82 [2025-01-10 01:03:19,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 85 transitions, 572 flow. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 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,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:19,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 82 [2025-01-10 01:03:19,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:19,904 INFO L124 PetriNetUnfolderBase]: 817/1845 cut-off events. [2025-01-10 01:03:19,904 INFO L125 PetriNetUnfolderBase]: For 278/310 co-relation queries the response was YES. [2025-01-10 01:03:19,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3674 conditions, 1845 events. 817/1845 cut-off events. For 278/310 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12457 event pairs, 492 based on Foata normal form. 0/1697 useless extension candidates. Maximal degree in co-relation 2199. Up to 1284 conditions per place. [2025-01-10 01:03:19,914 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 60 selfloop transitions, 8 changer transitions 0/83 dead transitions. [2025-01-10 01:03:19,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 83 transitions, 704 flow [2025-01-10 01:03:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2025-01-10 01:03:19,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6219512195121951 [2025-01-10 01:03:19,916 INFO L175 Difference]: Start difference. First operand has 107 places, 85 transitions, 572 flow. Second operand 4 states and 204 transitions. [2025-01-10 01:03:19,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 83 transitions, 704 flow [2025-01-10 01:03:19,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 83 transitions, 660 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 01:03:19,920 INFO L231 Difference]: Finished difference. Result has 100 places, 83 transitions, 540 flow [2025-01-10 01:03:19,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=540, PETRI_PLACES=100, PETRI_TRANSITIONS=83} [2025-01-10 01:03:19,920 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 22 predicate places. [2025-01-10 01:03:19,920 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 83 transitions, 540 flow [2025-01-10 01:03:19,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 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,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:19,921 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] [2025-01-10 01:03:19,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:03:19,921 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:19,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:19,921 INFO L85 PathProgramCache]: Analyzing trace with hash -558139154, now seen corresponding path program 1 times [2025-01-10 01:03:19,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:19,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869735559] [2025-01-10 01:03:19,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:19,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:19,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:03:19,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:03:19,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:19,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:20,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:20,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869735559] [2025-01-10 01:03:20,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869735559] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:20,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100021018] [2025-01-10 01:03:20,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:20,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:20,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:20,091 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:20,093 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:20,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:03:20,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:03:20,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:20,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:20,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:03:20,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:20,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:20,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-01-10 01:03:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:20,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100021018] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:20,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:20,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-01-10 01:03:20,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008584016] [2025-01-10 01:03:20,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:20,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:03:20,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:20,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:03:20,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:03:20,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-01-10 01:03:20,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 83 transitions, 540 flow. Second operand has 19 states, 19 states have (on average 46.473684210526315) internal successors, (883), 19 states have internal predecessors, (883), 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,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:20,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-01-10 01:03:20,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:21,175 INFO L124 PetriNetUnfolderBase]: 960/2096 cut-off events. [2025-01-10 01:03:21,176 INFO L125 PetriNetUnfolderBase]: For 306/330 co-relation queries the response was YES. [2025-01-10 01:03:21,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4190 conditions, 2096 events. 960/2096 cut-off events. For 306/330 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14304 event pairs, 410 based on Foata normal form. 0/1910 useless extension candidates. Maximal degree in co-relation 2439. Up to 651 conditions per place. [2025-01-10 01:03:21,184 INFO L140 encePairwiseOnDemand]: 67/82 looper letters, 86 selfloop transitions, 28 changer transitions 0/127 dead transitions. [2025-01-10 01:03:21,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 127 transitions, 888 flow [2025-01-10 01:03:21,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:03:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:03:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 573 transitions. [2025-01-10 01:03:21,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6352549889135255 [2025-01-10 01:03:21,185 INFO L175 Difference]: Start difference. First operand has 100 places, 83 transitions, 540 flow. Second operand 11 states and 573 transitions. [2025-01-10 01:03:21,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 127 transitions, 888 flow [2025-01-10 01:03:21,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 127 transitions, 876 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:21,189 INFO L231 Difference]: Finished difference. Result has 112 places, 87 transitions, 637 flow [2025-01-10 01:03:21,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=637, PETRI_PLACES=112, PETRI_TRANSITIONS=87} [2025-01-10 01:03:21,189 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 34 predicate places. [2025-01-10 01:03:21,189 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 87 transitions, 637 flow [2025-01-10 01:03:21,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 46.473684210526315) internal successors, (883), 19 states have internal predecessors, (883), 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,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:21,189 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:21,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 01:03:21,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:21,394 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:21,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1762296009, now seen corresponding path program 2 times [2025-01-10 01:03:21,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:21,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957845549] [2025-01-10 01:03:21,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:21,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:21,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:03:21,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:03:21,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:21,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:21,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:21,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957845549] [2025-01-10 01:03:21,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957845549] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:21,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219602297] [2025-01-10 01:03:21,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:21,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:21,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:21,495 INFO L229 MonitoredProcess]: Starting monitored process 15 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:21,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 01:03:21,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:03:21,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:03:21,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:21,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:21,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:03:21,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:21,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:21,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219602297] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:21,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:21,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 01:03:21,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114458619] [2025-01-10 01:03:21,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:21,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:03:21,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:21,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:03:21,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:03:21,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:03:21,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 87 transitions, 637 flow. Second operand has 15 states, 15 states have (on average 48.266666666666666) internal successors, (724), 15 states have internal predecessors, (724), 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,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:21,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:03:21,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:22,087 INFO L124 PetriNetUnfolderBase]: 909/2019 cut-off events. [2025-01-10 01:03:22,087 INFO L125 PetriNetUnfolderBase]: For 533/565 co-relation queries the response was YES. [2025-01-10 01:03:22,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4314 conditions, 2019 events. 909/2019 cut-off events. For 533/565 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13467 event pairs, 568 based on Foata normal form. 2/1878 useless extension candidates. Maximal degree in co-relation 2581. Up to 810 conditions per place. [2025-01-10 01:03:22,096 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 76 selfloop transitions, 25 changer transitions 0/116 dead transitions. [2025-01-10 01:03:22,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 116 transitions, 921 flow [2025-01-10 01:03:22,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:03:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:03:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 533 transitions. [2025-01-10 01:03:22,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-01-10 01:03:22,100 INFO L175 Difference]: Start difference. First operand has 112 places, 87 transitions, 637 flow. Second operand 10 states and 533 transitions. [2025-01-10 01:03:22,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 116 transitions, 921 flow [2025-01-10 01:03:22,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 116 transitions, 882 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:03:22,105 INFO L231 Difference]: Finished difference. Result has 118 places, 93 transitions, 696 flow [2025-01-10 01:03:22,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=696, PETRI_PLACES=118, PETRI_TRANSITIONS=93} [2025-01-10 01:03:22,105 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 40 predicate places. [2025-01-10 01:03:22,106 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 93 transitions, 696 flow [2025-01-10 01:03:22,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 48.266666666666666) internal successors, (724), 15 states have internal predecessors, (724), 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,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:22,106 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:22,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:22,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 01:03:22,307 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:22,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:22,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1426505895, now seen corresponding path program 2 times [2025-01-10 01:03:22,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:22,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448394027] [2025-01-10 01:03:22,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:22,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:22,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:03:22,320 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:22,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:22,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:22,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:22,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448394027] [2025-01-10 01:03:22,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448394027] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:22,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997612419] [2025-01-10 01:03:22,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:22,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:22,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:22,400 INFO L229 MonitoredProcess]: Starting monitored process 16 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,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 01:03:22,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:03:22,496 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:22,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:22,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:22,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:03:22,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:22,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:22,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997612419] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:22,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:22,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-10 01:03:22,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258838431] [2025-01-10 01:03:22,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:22,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:03:22,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:22,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:03:22,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:03:22,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:03:22,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 93 transitions, 696 flow. Second operand has 14 states, 14 states have (on average 48.5) internal successors, (679), 14 states have internal predecessors, (679), 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,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:22,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:03:22,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:23,142 INFO L124 PetriNetUnfolderBase]: 905/2017 cut-off events. [2025-01-10 01:03:23,142 INFO L125 PetriNetUnfolderBase]: For 547/585 co-relation queries the response was YES. [2025-01-10 01:03:23,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4353 conditions, 2017 events. 905/2017 cut-off events. For 547/585 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13319 event pairs, 558 based on Foata normal form. 2/1877 useless extension candidates. Maximal degree in co-relation 2631. Up to 812 conditions per place. [2025-01-10 01:03:23,150 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 73 selfloop transitions, 40 changer transitions 0/128 dead transitions. [2025-01-10 01:03:23,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 128 transitions, 1055 flow [2025-01-10 01:03:23,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:03:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:03:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 530 transitions. [2025-01-10 01:03:23,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6463414634146342 [2025-01-10 01:03:23,151 INFO L175 Difference]: Start difference. First operand has 118 places, 93 transitions, 696 flow. Second operand 10 states and 530 transitions. [2025-01-10 01:03:23,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 128 transitions, 1055 flow [2025-01-10 01:03:23,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 128 transitions, 1012 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-01-10 01:03:23,158 INFO L231 Difference]: Finished difference. Result has 125 places, 105 transitions, 850 flow [2025-01-10 01:03:23,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=850, PETRI_PLACES=125, PETRI_TRANSITIONS=105} [2025-01-10 01:03:23,159 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 47 predicate places. [2025-01-10 01:03:23,159 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 105 transitions, 850 flow [2025-01-10 01:03:23,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 48.5) internal successors, (679), 14 states have internal predecessors, (679), 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,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:23,159 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:23,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:23,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-10 01:03:23,360 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:23,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1768580691, now seen corresponding path program 3 times [2025-01-10 01:03:23,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:23,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101060929] [2025-01-10 01:03:23,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:03:23,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:23,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 5 equivalence classes. [2025-01-10 01:03:23,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 22 statements. [2025-01-10 01:03:23,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 01:03:23,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:03:23,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101060929] [2025-01-10 01:03:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101060929] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695535841] [2025-01-10 01:03:23,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:03:23,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:23,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:23,670 INFO L229 MonitoredProcess]: Starting monitored process 17 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,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 01:03:23,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 5 equivalence classes. [2025-01-10 01:03:23,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 22 statements. [2025-01-10 01:03:23,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 01:03:23,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:23,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 01:03:23,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:23,861 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:23,866 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:23,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:03:23,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 01:03:23,918 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:03:23,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:03:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:03:23,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:24,069 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 01:03:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:03:24,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695535841] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:24,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:24,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2025-01-10 01:03:24,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067041912] [2025-01-10 01:03:24,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:24,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 01:03:24,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:24,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 01:03:24,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-01-10 01:03:25,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 82 [2025-01-10 01:03:25,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 105 transitions, 850 flow. Second operand has 23 states, 23 states have (on average 44.47826086956522) internal successors, (1023), 23 states have internal predecessors, (1023), 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,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:25,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 82 [2025-01-10 01:03:25,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:25,820 INFO L124 PetriNetUnfolderBase]: 1334/2933 cut-off events. [2025-01-10 01:03:25,820 INFO L125 PetriNetUnfolderBase]: For 977/994 co-relation queries the response was YES. [2025-01-10 01:03:25,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6360 conditions, 2933 events. 1334/2933 cut-off events. For 977/994 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20844 event pairs, 837 based on Foata normal form. 80/2815 useless extension candidates. Maximal degree in co-relation 4590. Up to 1397 conditions per place. [2025-01-10 01:03:25,834 INFO L140 encePairwiseOnDemand]: 74/82 looper letters, 131 selfloop transitions, 19 changer transitions 0/163 dead transitions. [2025-01-10 01:03:25,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 163 transitions, 1595 flow [2025-01-10 01:03:25,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:03:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:03:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 580 transitions. [2025-01-10 01:03:25,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5894308943089431 [2025-01-10 01:03:25,838 INFO L175 Difference]: Start difference. First operand has 125 places, 105 transitions, 850 flow. Second operand 12 states and 580 transitions. [2025-01-10 01:03:25,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 163 transitions, 1595 flow [2025-01-10 01:03:25,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 163 transitions, 1509 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-01-10 01:03:25,843 INFO L231 Difference]: Finished difference. Result has 127 places, 109 transitions, 904 flow [2025-01-10 01:03:25,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=904, PETRI_PLACES=127, PETRI_TRANSITIONS=109} [2025-01-10 01:03:25,844 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 49 predicate places. [2025-01-10 01:03:25,844 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 109 transitions, 904 flow [2025-01-10 01:03:25,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 44.47826086956522) internal successors, (1023), 23 states have internal predecessors, (1023), 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,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:25,845 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:25,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-10 01:03:26,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:26,046 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:26,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:26,047 INFO L85 PathProgramCache]: Analyzing trace with hash 947030432, now seen corresponding path program 3 times [2025-01-10 01:03:26,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:26,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642471218] [2025-01-10 01:03:26,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:03:26,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:26,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 5 equivalence classes. [2025-01-10 01:03:26,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:03:26,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-10 01:03:26,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:26,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:26,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642471218] [2025-01-10 01:03:26,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642471218] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:26,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452660090] [2025-01-10 01:03:26,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:03:26,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:26,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:26,242 INFO L229 MonitoredProcess]: Starting monitored process 18 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:26,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 01:03:26,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 5 equivalence classes. [2025-01-10 01:03:26,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:03:26,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-10 01:03:26,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:26,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 01:03:26,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:26,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:26,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-01-10 01:03:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:03:26,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452660090] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:26,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:26,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-01-10 01:03:26,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773119915] [2025-01-10 01:03:26,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:26,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 01:03:26,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:26,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 01:03:26,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:03:27,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-01-10 01:03:27,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 109 transitions, 904 flow. Second operand has 28 states, 28 states have (on average 46.17857142857143) internal successors, (1293), 28 states have internal predecessors, (1293), 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,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:27,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-01-10 01:03:27,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:28,520 INFO L124 PetriNetUnfolderBase]: 2206/4797 cut-off events. [2025-01-10 01:03:28,521 INFO L125 PetriNetUnfolderBase]: For 1180/1180 co-relation queries the response was YES. [2025-01-10 01:03:28,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10279 conditions, 4797 events. 2206/4797 cut-off events. For 1180/1180 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 37243 event pairs, 835 based on Foata normal form. 63/4607 useless extension candidates. Maximal degree in co-relation 6643. Up to 1113 conditions per place. [2025-01-10 01:03:28,534 INFO L140 encePairwiseOnDemand]: 66/82 looper letters, 149 selfloop transitions, 57 changer transitions 0/217 dead transitions. [2025-01-10 01:03:28,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 217 transitions, 1851 flow [2025-01-10 01:03:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 01:03:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 01:03:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 972 transitions. [2025-01-10 01:03:28,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6238767650834403 [2025-01-10 01:03:28,537 INFO L175 Difference]: Start difference. First operand has 127 places, 109 transitions, 904 flow. Second operand 19 states and 972 transitions. [2025-01-10 01:03:28,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 217 transitions, 1851 flow [2025-01-10 01:03:28,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 217 transitions, 1840 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 01:03:28,544 INFO L231 Difference]: Finished difference. Result has 151 places, 138 transitions, 1424 flow [2025-01-10 01:03:28,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1424, PETRI_PLACES=151, PETRI_TRANSITIONS=138} [2025-01-10 01:03:28,544 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 73 predicate places. [2025-01-10 01:03:28,544 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 138 transitions, 1424 flow [2025-01-10 01:03:28,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 46.17857142857143) internal successors, (1293), 28 states have internal predecessors, (1293), 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,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:28,545 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:28,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 01:03:28,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:28,745 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:28,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:28,747 INFO L85 PathProgramCache]: Analyzing trace with hash -608876331, now seen corresponding path program 1 times [2025-01-10 01:03:28,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:28,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287572839] [2025-01-10 01:03:28,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:28,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:28,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:03:28,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:03:28,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:28,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:28,856 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:28,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:28,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287572839] [2025-01-10 01:03:28,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287572839] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:28,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305879887] [2025-01-10 01:03:28,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:28,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:28,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:28,859 INFO L229 MonitoredProcess]: Starting monitored process 19 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:28,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 01:03:28,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:03:28,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:03:28,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:28,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:28,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:03:28,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:29,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 17 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:03:29,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305879887] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:29,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:29,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-01-10 01:03:29,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154563248] [2025-01-10 01:03:29,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:29,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:03:29,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:29,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:03:29,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:03:29,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:03:29,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 138 transitions, 1424 flow. Second operand has 19 states, 19 states have (on average 48.31578947368421) internal successors, (918), 19 states have internal predecessors, (918), 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,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:29,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:03:29,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:29,769 INFO L124 PetriNetUnfolderBase]: 2144/4690 cut-off events. [2025-01-10 01:03:29,769 INFO L125 PetriNetUnfolderBase]: For 1912/1947 co-relation queries the response was YES. [2025-01-10 01:03:29,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10703 conditions, 4690 events. 2144/4690 cut-off events. For 1912/1947 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 35737 event pairs, 1366 based on Foata normal form. 3/4408 useless extension candidates. Maximal degree in co-relation 7173. Up to 2292 conditions per place. [2025-01-10 01:03:29,787 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 88 selfloop transitions, 71 changer transitions 0/172 dead transitions. [2025-01-10 01:03:29,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 172 transitions, 1910 flow [2025-01-10 01:03:29,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:03:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:03:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 627 transitions. [2025-01-10 01:03:29,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6371951219512195 [2025-01-10 01:03:29,789 INFO L175 Difference]: Start difference. First operand has 151 places, 138 transitions, 1424 flow. Second operand 12 states and 627 transitions. [2025-01-10 01:03:29,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 172 transitions, 1910 flow [2025-01-10 01:03:29,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 172 transitions, 1848 flow, removed 13 selfloop flow, removed 6 redundant places. [2025-01-10 01:03:29,798 INFO L231 Difference]: Finished difference. Result has 159 places, 149 transitions, 1681 flow [2025-01-10 01:03:29,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1362, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1681, PETRI_PLACES=159, PETRI_TRANSITIONS=149} [2025-01-10 01:03:29,800 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 81 predicate places. [2025-01-10 01:03:29,800 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 149 transitions, 1681 flow [2025-01-10 01:03:29,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 48.31578947368421) internal successors, (918), 19 states have internal predecessors, (918), 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,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:29,800 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:29,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-10 01:03:30,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-10 01:03:30,001 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:30,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:30,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1364275890, now seen corresponding path program 2 times [2025-01-10 01:03:30,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:30,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833396220] [2025-01-10 01:03:30,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:30,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:30,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:03:30,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:03:30,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:30,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 32 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:03:30,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:30,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833396220] [2025-01-10 01:03:30,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833396220] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:30,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059945970] [2025-01-10 01:03:30,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:30,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:30,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:30,207 INFO L229 MonitoredProcess]: Starting monitored process 20 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,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-10 01:03:30,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 01:03:30,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:03:30,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:30,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:30,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 01:03:30,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:03:30,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:30,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-01-10 01:03:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:03:30,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059945970] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:30,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:30,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2025-01-10 01:03:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808228237] [2025-01-10 01:03:30,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:30,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-10 01:03:30,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:30,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-10 01:03:30,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2025-01-10 01:03:31,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-01-10 01:03:31,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 149 transitions, 1681 flow. Second operand has 31 states, 31 states have (on average 46.16129032258065) internal successors, (1431), 31 states have internal predecessors, (1431), 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:31,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:31,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-01-10 01:03:31,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:32,669 INFO L124 PetriNetUnfolderBase]: 2799/6016 cut-off events. [2025-01-10 01:03:32,669 INFO L125 PetriNetUnfolderBase]: For 2976/2976 co-relation queries the response was YES. [2025-01-10 01:03:32,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13816 conditions, 6016 events. 2799/6016 cut-off events. For 2976/2976 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 47122 event pairs, 1784 based on Foata normal form. 126/5787 useless extension candidates. Maximal degree in co-relation 10813. Up to 2244 conditions per place. [2025-01-10 01:03:32,687 INFO L140 encePairwiseOnDemand]: 69/82 looper letters, 145 selfloop transitions, 79 changer transitions 0/235 dead transitions. [2025-01-10 01:03:32,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 235 transitions, 2826 flow [2025-01-10 01:03:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-10 01:03:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-10 01:03:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1358 transitions. [2025-01-10 01:03:32,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2025-01-10 01:03:32,689 INFO L175 Difference]: Start difference. First operand has 159 places, 149 transitions, 1681 flow. Second operand 28 states and 1358 transitions. [2025-01-10 01:03:32,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 235 transitions, 2826 flow [2025-01-10 01:03:32,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 235 transitions, 2660 flow, removed 42 selfloop flow, removed 13 redundant places. [2025-01-10 01:03:32,700 INFO L231 Difference]: Finished difference. Result has 177 places, 169 transitions, 2061 flow [2025-01-10 01:03:32,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2061, PETRI_PLACES=177, PETRI_TRANSITIONS=169} [2025-01-10 01:03:32,701 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 99 predicate places. [2025-01-10 01:03:32,701 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 169 transitions, 2061 flow [2025-01-10 01:03:32,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 46.16129032258065) internal successors, (1431), 31 states have internal predecessors, (1431), 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,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:32,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:32,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-01-10 01:03:32,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:32,902 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:32,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:32,902 INFO L85 PathProgramCache]: Analyzing trace with hash 903005441, now seen corresponding path program 1 times [2025-01-10 01:03:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:32,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280386156] [2025-01-10 01:03:32,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:32,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:32,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:03:32,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:03:32,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:32,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:03:32,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:32,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280386156] [2025-01-10 01:03:32,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280386156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:32,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:32,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:32,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583520207] [2025-01-10 01:03:32,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:32,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:32,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:32,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:32,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:32,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 82 [2025-01-10 01:03:32,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 169 transitions, 2061 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:32,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 82 [2025-01-10 01:03:32,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:33,540 INFO L124 PetriNetUnfolderBase]: 4151/7976 cut-off events. [2025-01-10 01:03:33,541 INFO L125 PetriNetUnfolderBase]: For 1982/1982 co-relation queries the response was YES. [2025-01-10 01:03:33,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18545 conditions, 7976 events. 4151/7976 cut-off events. For 1982/1982 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 59230 event pairs, 1978 based on Foata normal form. 0/7360 useless extension candidates. Maximal degree in co-relation 15334. Up to 4837 conditions per place. [2025-01-10 01:03:33,577 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 173 selfloop transitions, 3 changer transitions 0/184 dead transitions. [2025-01-10 01:03:33,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 184 transitions, 2464 flow [2025-01-10 01:03:33,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2025-01-10 01:03:33,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7276422764227642 [2025-01-10 01:03:33,578 INFO L175 Difference]: Start difference. First operand has 177 places, 169 transitions, 2061 flow. Second operand 3 states and 179 transitions. [2025-01-10 01:03:33,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 184 transitions, 2464 flow [2025-01-10 01:03:33,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 184 transitions, 2324 flow, removed 14 selfloop flow, removed 14 redundant places. [2025-01-10 01:03:33,590 INFO L231 Difference]: Finished difference. Result has 167 places, 171 transitions, 1943 flow [2025-01-10 01:03:33,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1921, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1943, PETRI_PLACES=167, PETRI_TRANSITIONS=171} [2025-01-10 01:03:33,591 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 89 predicate places. [2025-01-10 01:03:33,591 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 171 transitions, 1943 flow [2025-01-10 01:03:33,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:33,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:33,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:33,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 01:03:33,591 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:33,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:33,592 INFO L85 PathProgramCache]: Analyzing trace with hash -951978379, now seen corresponding path program 1 times [2025-01-10 01:03:33,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:33,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750499471] [2025-01-10 01:03:33,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:33,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:33,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:03:33,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:03:33,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:33,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:03:33,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:33,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750499471] [2025-01-10 01:03:33,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750499471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:33,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:33,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:33,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640824435] [2025-01-10 01:03:33,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:33,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:33,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:33,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:33,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:33,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 82 [2025-01-10 01:03:33,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 171 transitions, 1943 flow. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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:33,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:33,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 82 [2025-01-10 01:03:33,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:34,442 INFO L124 PetriNetUnfolderBase]: 4347/8420 cut-off events. [2025-01-10 01:03:34,442 INFO L125 PetriNetUnfolderBase]: For 3348/3516 co-relation queries the response was YES. [2025-01-10 01:03:34,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21367 conditions, 8420 events. 4347/8420 cut-off events. For 3348/3516 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 64455 event pairs, 2308 based on Foata normal form. 168/8024 useless extension candidates. Maximal degree in co-relation 17692. Up to 5377 conditions per place. [2025-01-10 01:03:34,474 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 172 selfloop transitions, 3 changer transitions 0/184 dead transitions. [2025-01-10 01:03:34,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 184 transitions, 2337 flow [2025-01-10 01:03:34,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:34,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2025-01-10 01:03:34,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7235772357723578 [2025-01-10 01:03:34,475 INFO L175 Difference]: Start difference. First operand has 167 places, 171 transitions, 1943 flow. Second operand 3 states and 178 transitions. [2025-01-10 01:03:34,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 184 transitions, 2337 flow [2025-01-10 01:03:34,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 184 transitions, 2329 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:34,509 INFO L231 Difference]: Finished difference. Result has 169 places, 173 transitions, 1959 flow [2025-01-10 01:03:34,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1937, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1959, PETRI_PLACES=169, PETRI_TRANSITIONS=173} [2025-01-10 01:03:34,510 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 91 predicate places. [2025-01-10 01:03:34,510 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 173 transitions, 1959 flow [2025-01-10 01:03:34,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:34,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:34,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 01:03:34,510 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:34,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:34,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1127963343, now seen corresponding path program 1 times [2025-01-10 01:03:34,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:34,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013660989] [2025-01-10 01:03:34,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:34,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:34,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 01:03:34,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:03:34,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:34,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:03:34,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:34,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013660989] [2025-01-10 01:03:34,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013660989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:34,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:34,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:03:34,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350555447] [2025-01-10 01:03:34,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:34,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:03:34,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:34,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:03:34,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:03:35,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:03:35,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 173 transitions, 1959 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:35,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:03:35,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:37,080 INFO L124 PetriNetUnfolderBase]: 9514/19435 cut-off events. [2025-01-10 01:03:37,080 INFO L125 PetriNetUnfolderBase]: For 9205/9912 co-relation queries the response was YES. [2025-01-10 01:03:37,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50689 conditions, 19435 events. 9514/19435 cut-off events. For 9205/9912 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 184271 event pairs, 583 based on Foata normal form. 719/19908 useless extension candidates. Maximal degree in co-relation 41941. Up to 4696 conditions per place. [2025-01-10 01:03:37,216 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 260 selfloop transitions, 6 changer transitions 6/285 dead transitions. [2025-01-10 01:03:37,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 285 transitions, 2972 flow [2025-01-10 01:03:37,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:03:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:03:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 572 transitions. [2025-01-10 01:03:37,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.697560975609756 [2025-01-10 01:03:37,217 INFO L175 Difference]: Start difference. First operand has 169 places, 173 transitions, 1959 flow. Second operand 10 states and 572 transitions. [2025-01-10 01:03:37,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 285 transitions, 2972 flow [2025-01-10 01:03:37,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 285 transitions, 2958 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:37,484 INFO L231 Difference]: Finished difference. Result has 184 places, 178 transitions, 2006 flow [2025-01-10 01:03:37,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1953, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2006, PETRI_PLACES=184, PETRI_TRANSITIONS=178} [2025-01-10 01:03:37,485 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 106 predicate places. [2025-01-10 01:03:37,485 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 178 transitions, 2006 flow [2025-01-10 01:03:37,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:37,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:37,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:37,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-10 01:03:37,485 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:37,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:37,486 INFO L85 PathProgramCache]: Analyzing trace with hash -158014939, now seen corresponding path program 2 times [2025-01-10 01:03:37,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:37,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808726565] [2025-01-10 01:03:37,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:37,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:37,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:03:37,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-01-10 01:03:37,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:03:37,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:37,916 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:03:37,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:37,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808726565] [2025-01-10 01:03:37,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808726565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:37,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:37,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:03:37,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368640643] [2025-01-10 01:03:37,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:37,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:03:37,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:37,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:03:37,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:03:38,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:03:38,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 178 transitions, 2006 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:38,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:38,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:03:38,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:40,506 INFO L124 PetriNetUnfolderBase]: 9752/20321 cut-off events. [2025-01-10 01:03:40,506 INFO L125 PetriNetUnfolderBase]: For 15448/16359 co-relation queries the response was YES. [2025-01-10 01:03:40,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57503 conditions, 20321 events. 9752/20321 cut-off events. For 15448/16359 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 199227 event pairs, 1693 based on Foata normal form. 923/20864 useless extension candidates. Maximal degree in co-relation 57033. Up to 10224 conditions per place. [2025-01-10 01:03:40,659 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 216 selfloop transitions, 10 changer transitions 6/245 dead transitions. [2025-01-10 01:03:40,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 245 transitions, 2757 flow [2025-01-10 01:03:40,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:03:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:03:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 550 transitions. [2025-01-10 01:03:40,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6707317073170732 [2025-01-10 01:03:40,660 INFO L175 Difference]: Start difference. First operand has 184 places, 178 transitions, 2006 flow. Second operand 10 states and 550 transitions. [2025-01-10 01:03:40,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 245 transitions, 2757 flow [2025-01-10 01:03:40,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 245 transitions, 2732 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:40,998 INFO L231 Difference]: Finished difference. Result has 193 places, 180 transitions, 2043 flow [2025-01-10 01:03:40,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1999, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2043, PETRI_PLACES=193, PETRI_TRANSITIONS=180} [2025-01-10 01:03:40,998 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 115 predicate places. [2025-01-10 01:03:40,998 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 180 transitions, 2043 flow [2025-01-10 01:03:40,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:40,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:40,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-10 01:03:40,999 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:40,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:40,999 INFO L85 PathProgramCache]: Analyzing trace with hash -712946707, now seen corresponding path program 3 times [2025-01-10 01:03:40,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:40,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903431417] [2025-01-10 01:03:40,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:03:41,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:41,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-01-10 01:03:41,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-01-10 01:03:41,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:03:41,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:03:41,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:41,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903431417] [2025-01-10 01:03:41,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903431417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:41,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:41,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:03:41,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399392935] [2025-01-10 01:03:41,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:41,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:03:41,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:41,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:03:41,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:03:41,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:03:41,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 180 transitions, 2043 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:41,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:41,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:03:41,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:44,224 INFO L124 PetriNetUnfolderBase]: 10200/21661 cut-off events. [2025-01-10 01:03:44,224 INFO L125 PetriNetUnfolderBase]: For 25836/26588 co-relation queries the response was YES. [2025-01-10 01:03:44,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64550 conditions, 21661 events. 10200/21661 cut-off events. For 25836/26588 co-relation queries the response was YES. Maximal size of possible extension queue 985. Compared 215950 event pairs, 1503 based on Foata normal form. 764/22105 useless extension candidates. Maximal degree in co-relation 63981. Up to 11254 conditions per place. [2025-01-10 01:03:44,418 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 238 selfloop transitions, 9 changer transitions 7/267 dead transitions. [2025-01-10 01:03:44,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 267 transitions, 2982 flow [2025-01-10 01:03:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:03:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:03:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 559 transitions. [2025-01-10 01:03:44,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6817073170731708 [2025-01-10 01:03:44,420 INFO L175 Difference]: Start difference. First operand has 193 places, 180 transitions, 2043 flow. Second operand 10 states and 559 transitions. [2025-01-10 01:03:44,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 267 transitions, 2982 flow [2025-01-10 01:03:44,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 267 transitions, 2929 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-01-10 01:03:44,956 INFO L231 Difference]: Finished difference. Result has 202 places, 184 transitions, 2090 flow [2025-01-10 01:03:44,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=2025, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2090, PETRI_PLACES=202, PETRI_TRANSITIONS=184} [2025-01-10 01:03:44,957 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 124 predicate places. [2025-01-10 01:03:44,957 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 184 transitions, 2090 flow [2025-01-10 01:03:44,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:44,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:44,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:44,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-10 01:03:44,957 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:44,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:44,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1876014735, now seen corresponding path program 4 times [2025-01-10 01:03:44,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:44,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289297564] [2025-01-10 01:03:44,958 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:03:44,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:44,966 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:03:44,970 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-01-10 01:03:44,970 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 01:03:44,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:03:45,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:45,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289297564] [2025-01-10 01:03:45,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289297564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:45,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:45,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:03:45,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970912824] [2025-01-10 01:03:45,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:45,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:03:45,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:45,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:03:45,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:03:45,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:03:45,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 184 transitions, 2090 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:45,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:45,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:03:45,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:47,997 INFO L124 PetriNetUnfolderBase]: 10583/22824 cut-off events. [2025-01-10 01:03:47,997 INFO L125 PetriNetUnfolderBase]: For 36535/37419 co-relation queries the response was YES. [2025-01-10 01:03:48,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70577 conditions, 22824 events. 10583/22824 cut-off events. For 36535/37419 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 232639 event pairs, 1740 based on Foata normal form. 896/23344 useless extension candidates. Maximal degree in co-relation 69907. Up to 13034 conditions per place. [2025-01-10 01:03:48,265 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 227 selfloop transitions, 13 changer transitions 6/259 dead transitions. [2025-01-10 01:03:48,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 259 transitions, 2982 flow [2025-01-10 01:03:48,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:03:48,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:03:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 556 transitions. [2025-01-10 01:03:48,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6780487804878049 [2025-01-10 01:03:48,266 INFO L175 Difference]: Start difference. First operand has 202 places, 184 transitions, 2090 flow. Second operand 10 states and 556 transitions. [2025-01-10 01:03:48,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 259 transitions, 2982 flow [2025-01-10 01:03:49,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 259 transitions, 2938 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-01-10 01:03:49,099 INFO L231 Difference]: Finished difference. Result has 210 places, 187 transitions, 2136 flow [2025-01-10 01:03:49,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=2071, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2136, PETRI_PLACES=210, PETRI_TRANSITIONS=187} [2025-01-10 01:03:49,100 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 132 predicate places. [2025-01-10 01:03:49,100 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 187 transitions, 2136 flow [2025-01-10 01:03:49,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:49,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:49,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:49,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-10 01:03:49,100 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:49,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:49,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1839810745, now seen corresponding path program 5 times [2025-01-10 01:03:49,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:49,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2441018] [2025-01-10 01:03:49,101 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:03:49,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:49,107 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-01-10 01:03:49,125 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:03:49,126 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-10 01:03:49,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:03:49,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:49,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2441018] [2025-01-10 01:03:49,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2441018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:49,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:49,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:03:49,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740687362] [2025-01-10 01:03:49,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:49,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:03:49,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:49,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:03:49,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:03:49,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:03:49,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 187 transitions, 2136 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:49,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:49,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:03:49,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:52,569 INFO L124 PetriNetUnfolderBase]: 10620/23017 cut-off events. [2025-01-10 01:03:52,569 INFO L125 PetriNetUnfolderBase]: For 50110/50802 co-relation queries the response was YES. [2025-01-10 01:03:52,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74526 conditions, 23017 events. 10620/23017 cut-off events. For 50110/50802 co-relation queries the response was YES. Maximal size of possible extension queue 1042. Compared 235080 event pairs, 1377 based on Foata normal form. 704/23401 useless extension candidates. Maximal degree in co-relation 73853. Up to 12130 conditions per place. [2025-01-10 01:03:52,836 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 243 selfloop transitions, 11 changer transitions 6/273 dead transitions. [2025-01-10 01:03:52,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 273 transitions, 3103 flow [2025-01-10 01:03:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:03:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:03:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 559 transitions. [2025-01-10 01:03:52,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6817073170731708 [2025-01-10 01:03:52,838 INFO L175 Difference]: Start difference. First operand has 210 places, 187 transitions, 2136 flow. Second operand 10 states and 559 transitions. [2025-01-10 01:03:52,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 273 transitions, 3103 flow [2025-01-10 01:03:53,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 273 transitions, 3039 flow, removed 13 selfloop flow, removed 6 redundant places. [2025-01-10 01:03:53,612 INFO L231 Difference]: Finished difference. Result has 216 places, 189 transitions, 2158 flow [2025-01-10 01:03:53,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2158, PETRI_PLACES=216, PETRI_TRANSITIONS=189} [2025-01-10 01:03:53,613 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 138 predicate places. [2025-01-10 01:03:53,613 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 189 transitions, 2158 flow [2025-01-10 01:03:53,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:53,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:53,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:53,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-10 01:03:53,614 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:53,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:53,614 INFO L85 PathProgramCache]: Analyzing trace with hash 931069165, now seen corresponding path program 6 times [2025-01-10 01:03:53,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:53,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747867660] [2025-01-10 01:03:53,614 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:03:53,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:53,622 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-01-10 01:03:53,625 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-01-10 01:03:53,625 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 01:03:53,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:03:53,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:53,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747867660] [2025-01-10 01:03:53,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747867660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:53,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:53,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:03:53,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897342072] [2025-01-10 01:03:53,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:53,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:03:53,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:53,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:03:53,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:03:54,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:03:54,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 189 transitions, 2158 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:54,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:54,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:03:54,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:57,865 INFO L124 PetriNetUnfolderBase]: 12635/27184 cut-off events. [2025-01-10 01:03:57,866 INFO L125 PetriNetUnfolderBase]: For 60835/61939 co-relation queries the response was YES. [2025-01-10 01:03:58,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88016 conditions, 27184 events. 12635/27184 cut-off events. For 60835/61939 co-relation queries the response was YES. Maximal size of possible extension queue 1297. Compared 283981 event pairs, 2540 based on Foata normal form. 1116/27794 useless extension candidates. Maximal degree in co-relation 87196. Up to 14468 conditions per place. [2025-01-10 01:03:58,163 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 244 selfloop transitions, 12 changer transitions 6/275 dead transitions. [2025-01-10 01:03:58,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 275 transitions, 3163 flow [2025-01-10 01:03:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:03:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:03:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 561 transitions. [2025-01-10 01:03:58,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6841463414634147 [2025-01-10 01:03:58,164 INFO L175 Difference]: Start difference. First operand has 216 places, 189 transitions, 2158 flow. Second operand 10 states and 561 transitions. [2025-01-10 01:03:58,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 275 transitions, 3163 flow [2025-01-10 01:03:59,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 275 transitions, 3116 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-01-10 01:03:59,059 INFO L231 Difference]: Finished difference. Result has 224 places, 193 transitions, 2226 flow [2025-01-10 01:03:59,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=2133, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2226, PETRI_PLACES=224, PETRI_TRANSITIONS=193} [2025-01-10 01:03:59,060 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 146 predicate places. [2025-01-10 01:03:59,060 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 193 transitions, 2226 flow [2025-01-10 01:03:59,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:59,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:59,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:59,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-10 01:03:59,060 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:03:59,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:59,061 INFO L85 PathProgramCache]: Analyzing trace with hash 847590789, now seen corresponding path program 7 times [2025-01-10 01:03:59,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:59,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702531991] [2025-01-10 01:03:59,061 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:03:59,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:59,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 01:03:59,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:03:59,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:59,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:03:59,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:59,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702531991] [2025-01-10 01:03:59,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702531991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:59,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:59,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:03:59,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762892564] [2025-01-10 01:03:59,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:59,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:03:59,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:59,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:03:59,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:03:59,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:03:59,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 193 transitions, 2226 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:59,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:59,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:03:59,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:03,078 INFO L124 PetriNetUnfolderBase]: 12727/27512 cut-off events. [2025-01-10 01:04:03,078 INFO L125 PetriNetUnfolderBase]: For 82681/83535 co-relation queries the response was YES. [2025-01-10 01:04:03,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92171 conditions, 27512 events. 12727/27512 cut-off events. For 82681/83535 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 287980 event pairs, 2190 based on Foata normal form. 866/27922 useless extension candidates. Maximal degree in co-relation 91346. Up to 15456 conditions per place. [2025-01-10 01:04:03,338 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 235 selfloop transitions, 15 changer transitions 7/270 dead transitions. [2025-01-10 01:04:03,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 270 transitions, 3176 flow [2025-01-10 01:04:03,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:04:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:04:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 553 transitions. [2025-01-10 01:04:03,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6743902439024391 [2025-01-10 01:04:03,340 INFO L175 Difference]: Start difference. First operand has 224 places, 193 transitions, 2226 flow. Second operand 10 states and 553 transitions. [2025-01-10 01:04:03,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 270 transitions, 3176 flow [2025-01-10 01:04:04,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 270 transitions, 3129 flow, removed 18 selfloop flow, removed 4 redundant places. [2025-01-10 01:04:04,496 INFO L231 Difference]: Finished difference. Result has 231 places, 195 transitions, 2263 flow [2025-01-10 01:04:04,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=2197, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2263, PETRI_PLACES=231, PETRI_TRANSITIONS=195} [2025-01-10 01:04:04,497 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 153 predicate places. [2025-01-10 01:04:04,497 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 195 transitions, 2263 flow [2025-01-10 01:04:04,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:04,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:04,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:04,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-10 01:04:04,497 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:04:04,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash 968566077, now seen corresponding path program 8 times [2025-01-10 01:04:04,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:04,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971785526] [2025-01-10 01:04:04,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:04:04,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:04,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:04:04,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-01-10 01:04:04,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:04:04,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:04:04,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:04,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971785526] [2025-01-10 01:04:04,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971785526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:04,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:04,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:04:04,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484231470] [2025-01-10 01:04:04,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:04,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:04:04,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:04,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:04:04,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:04:04,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:04:04,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 195 transitions, 2263 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:04,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:04,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:04:04,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:08,572 INFO L124 PetriNetUnfolderBase]: 14610/31339 cut-off events. [2025-01-10 01:04:08,572 INFO L125 PetriNetUnfolderBase]: For 92500/93765 co-relation queries the response was YES. [2025-01-10 01:04:08,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105352 conditions, 31339 events. 14610/31339 cut-off events. For 92500/93765 co-relation queries the response was YES. Maximal size of possible extension queue 1479. Compared 334273 event pairs, 3173 based on Foata normal form. 1277/31874 useless extension candidates. Maximal degree in co-relation 104333. Up to 11812 conditions per place. [2025-01-10 01:04:08,795 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 272 selfloop transitions, 11 changer transitions 7/303 dead transitions. [2025-01-10 01:04:08,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 303 transitions, 3468 flow [2025-01-10 01:04:08,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:04:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:04:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 571 transitions. [2025-01-10 01:04:08,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6963414634146341 [2025-01-10 01:04:08,796 INFO L175 Difference]: Start difference. First operand has 231 places, 195 transitions, 2263 flow. Second operand 10 states and 571 transitions. [2025-01-10 01:04:08,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 303 transitions, 3468 flow [2025-01-10 01:04:10,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 303 transitions, 3422 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-01-10 01:04:10,122 INFO L231 Difference]: Finished difference. Result has 238 places, 200 transitions, 2338 flow [2025-01-10 01:04:10,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=2231, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2338, PETRI_PLACES=238, PETRI_TRANSITIONS=200} [2025-01-10 01:04:10,122 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 160 predicate places. [2025-01-10 01:04:10,122 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 200 transitions, 2338 flow [2025-01-10 01:04:10,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:10,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:10,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:10,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-10 01:04:10,123 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:04:10,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:10,123 INFO L85 PathProgramCache]: Analyzing trace with hash 280665753, now seen corresponding path program 9 times [2025-01-10 01:04:10,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:10,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32746222] [2025-01-10 01:04:10,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:04:10,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:10,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-01-10 01:04:10,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-01-10 01:04:10,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:04:10,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:04:10,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:10,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32746222] [2025-01-10 01:04:10,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32746222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:10,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:10,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:04:10,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903043218] [2025-01-10 01:04:10,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:10,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:04:10,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:10,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:04:10,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:04:10,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:04:10,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 200 transitions, 2338 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:10,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:10,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:04:10,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:15,001 INFO L124 PetriNetUnfolderBase]: 14652/31757 cut-off events. [2025-01-10 01:04:15,002 INFO L125 PetriNetUnfolderBase]: For 114420/115450 co-relation queries the response was YES. [2025-01-10 01:04:15,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109146 conditions, 31757 events. 14652/31757 cut-off events. For 114420/115450 co-relation queries the response was YES. Maximal size of possible extension queue 1475. Compared 342694 event pairs, 2429 based on Foata normal form. 1042/32219 useless extension candidates. Maximal degree in co-relation 108121. Up to 18864 conditions per place. [2025-01-10 01:04:15,435 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 239 selfloop transitions, 19 changer transitions 7/278 dead transitions. [2025-01-10 01:04:15,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 278 transitions, 3313 flow [2025-01-10 01:04:15,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:04:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:04:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 554 transitions. [2025-01-10 01:04:15,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675609756097561 [2025-01-10 01:04:15,436 INFO L175 Difference]: Start difference. First operand has 238 places, 200 transitions, 2338 flow. Second operand 10 states and 554 transitions. [2025-01-10 01:04:15,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 278 transitions, 3313 flow [2025-01-10 01:04:17,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 278 transitions, 3270 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-01-10 01:04:17,274 INFO L231 Difference]: Finished difference. Result has 245 places, 202 transitions, 2379 flow [2025-01-10 01:04:17,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=2305, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2379, PETRI_PLACES=245, PETRI_TRANSITIONS=202} [2025-01-10 01:04:17,274 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 167 predicate places. [2025-01-10 01:04:17,274 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 202 transitions, 2379 flow [2025-01-10 01:04:17,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:17,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:17,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:17,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-10 01:04:17,275 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:04:17,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:17,275 INFO L85 PathProgramCache]: Analyzing trace with hash -823832961, now seen corresponding path program 10 times [2025-01-10 01:04:17,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:17,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254601513] [2025-01-10 01:04:17,275 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:04:17,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:17,283 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:04:17,285 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-01-10 01:04:17,285 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 01:04:17,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:04:17,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:17,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254601513] [2025-01-10 01:04:17,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254601513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:17,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:17,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 01:04:17,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039139468] [2025-01-10 01:04:17,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:17,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:04:17,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:17,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:04:17,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:04:17,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-01-10 01:04:17,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 202 transitions, 2379 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:17,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:17,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-01-10 01:04:17,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:22,845 INFO L124 PetriNetUnfolderBase]: 15675/35000 cut-off events. [2025-01-10 01:04:22,845 INFO L125 PetriNetUnfolderBase]: For 122767/123999 co-relation queries the response was YES. [2025-01-10 01:04:23,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118873 conditions, 35000 events. 15675/35000 cut-off events. For 122767/123999 co-relation queries the response was YES. Maximal size of possible extension queue 1644. Compared 394127 event pairs, 2548 based on Foata normal form. 1244/35576 useless extension candidates. Maximal degree in co-relation 117271. Up to 18168 conditions per place. [2025-01-10 01:04:23,393 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 252 selfloop transitions, 20 changer transitions 7/292 dead transitions. [2025-01-10 01:04:23,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 292 transitions, 3566 flow [2025-01-10 01:04:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:04:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:04:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 557 transitions. [2025-01-10 01:04:23,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6792682926829269 [2025-01-10 01:04:23,394 INFO L175 Difference]: Start difference. First operand has 245 places, 202 transitions, 2379 flow. Second operand 10 states and 557 transitions. [2025-01-10 01:04:23,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 292 transitions, 3566 flow [2025-01-10 01:04:25,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 292 transitions, 3498 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-01-10 01:04:25,006 INFO L231 Difference]: Finished difference. Result has 250 places, 204 transitions, 2416 flow [2025-01-10 01:04:25,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=2337, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2416, PETRI_PLACES=250, PETRI_TRANSITIONS=204} [2025-01-10 01:04:25,007 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 172 predicate places. [2025-01-10 01:04:25,007 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 204 transitions, 2416 flow [2025-01-10 01:04:25,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 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:25,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:25,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:25,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-10 01:04:25,008 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-01-10 01:04:25,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:25,008 INFO L85 PathProgramCache]: Analyzing trace with hash 391547793, now seen corresponding path program 11 times [2025-01-10 01:04:25,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:25,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085642873] [2025-01-10 01:04:25,008 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:04:25,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:25,015 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-01-10 01:04:25,034 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:04:25,035 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-10 01:04:25,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat