./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.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/popl20-bad-buffer-mult-alt2.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 a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:06:30,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:06:30,964 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:06:30,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:06:30,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:06:31,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:06:31,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:06:31,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:06:31,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:06:31,006 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:06:31,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:06:31,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:06:31,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:06:31,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:06:31,008 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:06:31,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:06:31,008 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:06:31,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:06:31,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:06:31,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:06:31,009 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:06:31,009 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:06:31,009 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:06:31,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:06:31,009 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:06:31,009 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:06:31,009 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:06:31,010 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:06:31,010 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:06:31,010 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:06:31,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:06:31,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:06:31,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:06:31,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:06:31,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:06:31,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:06:31,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:06:31,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:06:31,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:06:31,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:06:31,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:06:31,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:06:31,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:06:31,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:06:31,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:06:31,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:06:31,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:06:31,012 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 -> a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 [2025-01-10 01:06:31,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:06:31,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:06:31,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:06:31,302 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:06:31,303 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:06:31,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-01-10 01:06:32,621 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd4c9ddc5/2b6244fa129643cdb7c8b173e6aee2f6/FLAGbdd8e8402 [2025-01-10 01:06:32,880 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:06:32,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-01-10 01:06:32,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd4c9ddc5/2b6244fa129643cdb7c8b173e6aee2f6/FLAGbdd8e8402 [2025-01-10 01:06:32,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd4c9ddc5/2b6244fa129643cdb7c8b173e6aee2f6 [2025-01-10 01:06:32,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:06:32,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:06:32,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:06:32,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:06:32,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:06:32,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:06:32" (1/1) ... [2025-01-10 01:06:32,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b59dc07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:32, skipping insertion in model container [2025-01-10 01:06:32,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:06:32" (1/1) ... [2025-01-10 01:06:32,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:06:33,089 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:06:33,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:06:33,102 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:06:33,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:06:33,155 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:06:33,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:33 WrapperNode [2025-01-10 01:06:33,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:06:33,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:06:33,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:06:33,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:06:33,162 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:06:33" (1/1) ... [2025-01-10 01:06:33,168 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:06:33" (1/1) ... [2025-01-10 01:06:33,193 INFO L138 Inliner]: procedures = 25, calls = 56, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 291 [2025-01-10 01:06:33,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:06:33,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:06:33,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:06:33,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:06:33,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:33" (1/1) ... [2025-01-10 01:06:33,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:33" (1/1) ... [2025-01-10 01:06:33,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:33" (1/1) ... [2025-01-10 01:06:33,236 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-10 01:06:33,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:33" (1/1) ... [2025-01-10 01:06:33,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:33" (1/1) ... [2025-01-10 01:06:33,252 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:33" (1/1) ... [2025-01-10 01:06:33,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:33" (1/1) ... [2025-01-10 01:06:33,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:33" (1/1) ... [2025-01-10 01:06:33,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:33" (1/1) ... [2025-01-10 01:06:33,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:33" (1/1) ... [2025-01-10 01:06:33,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:06:33,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:06:33,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:06:33,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:06:33,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:33" (1/1) ... [2025-01-10 01:06:33,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:06:33,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:33,305 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:06:33,311 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:06:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:06:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:06:33,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:06:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:06:33,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:06:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:06:33,335 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:06:33,335 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 01:06:33,335 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 01:06:33,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:06:33,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:06:33,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:06:33,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:06:33,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:06:33,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:06:33,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:06:33,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:06:33,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:06:33,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:06:33,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:06:33,339 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:06:33,471 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:06:33,473 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:06:33,937 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:06:33,938 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:06:34,391 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:06:34,393 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:06:34,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:06:34 BoogieIcfgContainer [2025-01-10 01:06:34,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:06:34,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:06:34,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:06:34,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:06:34,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:06:32" (1/3) ... [2025-01-10 01:06:34,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a648e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:06:34, skipping insertion in model container [2025-01-10 01:06:34,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:33" (2/3) ... [2025-01-10 01:06:34,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a648e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:06:34, skipping insertion in model container [2025-01-10 01:06:34,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:06:34" (3/3) ... [2025-01-10 01:06:34,404 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2025-01-10 01:06:34,418 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:06:34,419 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt2.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-01-10 01:06:34,420 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:06:34,503 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 01:06:34,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 64 transitions, 156 flow [2025-01-10 01:06:34,578 INFO L124 PetriNetUnfolderBase]: 6/60 cut-off events. [2025-01-10 01:06:34,580 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:06:34,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 60 events. 6/60 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 124 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-01-10 01:06:34,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 64 transitions, 156 flow [2025-01-10 01:06:34,589 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 59 transitions, 142 flow [2025-01-10 01:06:34,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:06:34,616 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;@6582f9c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:06:34,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-10 01:06:34,621 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:06:34,621 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:06:34,621 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:06:34,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:34,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:06:34,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:34,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:34,630 INFO L85 PathProgramCache]: Analyzing trace with hash 847529, now seen corresponding path program 1 times [2025-01-10 01:06:34,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:34,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971331625] [2025-01-10 01:06:34,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:34,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:34,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:06:34,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:06:34,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:34,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:34,938 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:06:34,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:34,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971331625] [2025-01-10 01:06:34,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971331625] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:34,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:34,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:06:34,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080348095] [2025-01-10 01:06:34,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:34,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:06:34,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:34,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:06:34,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:06:34,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:06:34,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:06:34,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:34,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:06:34,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:36,117 INFO L124 PetriNetUnfolderBase]: 4566/6759 cut-off events. [2025-01-10 01:06:36,117 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-01-10 01:06:36,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13365 conditions, 6759 events. 4566/6759 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 49849 event pairs, 4408 based on Foata normal form. 1/3784 useless extension candidates. Maximal degree in co-relation 12180. Up to 6127 conditions per place. [2025-01-10 01:06:36,218 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 34 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-01-10 01:06:36,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 206 flow [2025-01-10 01:06:36,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:06:36,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:06:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-01-10 01:06:36,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.578125 [2025-01-10 01:06:36,235 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 142 flow. Second operand 3 states and 111 transitions. [2025-01-10 01:06:36,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 206 flow [2025-01-10 01:06:36,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 190 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 01:06:36,258 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 122 flow [2025-01-10 01:06:36,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2025-01-10 01:06:36,265 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2025-01-10 01:06:36,265 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 122 flow [2025-01-10 01:06:36,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:06:36,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:36,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:06:36,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:06:36,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:36,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:36,267 INFO L85 PathProgramCache]: Analyzing trace with hash 847530, now seen corresponding path program 1 times [2025-01-10 01:06:36,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:36,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895073270] [2025-01-10 01:06:36,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:36,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:36,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:06:36,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:06:36,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:36,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:36,608 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:06:36,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:36,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895073270] [2025-01-10 01:06:36,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895073270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:36,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:36,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:06:36,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042360081] [2025-01-10 01:06:36,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:36,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:06:36,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:36,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:06:36,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:06:36,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:06:36,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:06:36,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:36,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:06:36,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:37,378 INFO L124 PetriNetUnfolderBase]: 4566/6758 cut-off events. [2025-01-10 01:06:37,378 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:06:37,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13052 conditions, 6758 events. 4566/6758 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 49822 event pairs, 4408 based on Foata normal form. 0/3782 useless extension candidates. Maximal degree in co-relation 13031. Up to 6131 conditions per place. [2025-01-10 01:06:37,455 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 33 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2025-01-10 01:06:37,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 194 flow [2025-01-10 01:06:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:06:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:06:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-01-10 01:06:37,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2025-01-10 01:06:37,458 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 122 flow. Second operand 4 states and 134 transitions. [2025-01-10 01:06:37,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 194 flow [2025-01-10 01:06:37,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:37,460 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 124 flow [2025-01-10 01:06:37,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2025-01-10 01:06:37,462 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2025-01-10 01:06:37,462 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 124 flow [2025-01-10 01:06:37,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:06:37,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:37,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:06:37,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:06:37,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:37,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:37,464 INFO L85 PathProgramCache]: Analyzing trace with hash 26275504, now seen corresponding path program 1 times [2025-01-10 01:06:37,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:37,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765006603] [2025-01-10 01:06:37,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:37,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:37,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:06:37,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:06:37,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:37,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:37,720 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:06:37,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:37,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765006603] [2025-01-10 01:06:37,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765006603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:37,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:37,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:06:37,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521030085] [2025-01-10 01:06:37,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:37,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:06:37,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:37,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:06:37,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:06:37,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:06:37,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:06:37,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:37,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:06:37,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:38,555 INFO L124 PetriNetUnfolderBase]: 4568/6764 cut-off events. [2025-01-10 01:06:38,555 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:06:38,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13069 conditions, 6764 events. 4568/6764 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 49977 event pairs, 4408 based on Foata normal form. 0/3785 useless extension candidates. Maximal degree in co-relation 13045. Up to 6134 conditions per place. [2025-01-10 01:06:38,603 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 36 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-01-10 01:06:38,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 228 flow [2025-01-10 01:06:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:06:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:06:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2025-01-10 01:06:38,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5125 [2025-01-10 01:06:38,605 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 124 flow. Second operand 5 states and 164 transitions. [2025-01-10 01:06:38,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 228 flow [2025-01-10 01:06:38,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:06:38,609 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 169 flow [2025-01-10 01:06:38,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2025-01-10 01:06:38,610 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2025-01-10 01:06:38,611 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 169 flow [2025-01-10 01:06:38,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:06:38,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:38,611 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 01:06:38,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:06:38,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:38,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:38,612 INFO L85 PathProgramCache]: Analyzing trace with hash -519017682, now seen corresponding path program 1 times [2025-01-10 01:06:38,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:38,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124283638] [2025-01-10 01:06:38,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:38,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:38,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:06:38,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:06:38,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:38,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:38,959 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:06:38,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:38,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124283638] [2025-01-10 01:06:38,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124283638] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:38,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961625005] [2025-01-10 01:06:38,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:38,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:38,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:38,963 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:06:38,966 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:06:39,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:06:39,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:06:39,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:39,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:39,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:06:39,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:39,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:06:39,393 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:06:39,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:06:39,564 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:06:39,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961625005] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:06:39,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:06:39,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:06:39,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211424017] [2025-01-10 01:06:39,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:06:39,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:06:39,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:39,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:06:39,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:06:39,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:06:39,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 169 flow. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 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:06:39,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:39,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:06:39,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:40,712 INFO L124 PetriNetUnfolderBase]: 4570/6769 cut-off events. [2025-01-10 01:06:40,712 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:06:40,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13101 conditions, 6769 events. 4570/6769 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 50060 event pairs, 4408 based on Foata normal form. 0/3793 useless extension candidates. Maximal degree in co-relation 13041. Up to 6128 conditions per place. [2025-01-10 01:06:40,757 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 30 selfloop transitions, 18 changer transitions 0/65 dead transitions. [2025-01-10 01:06:40,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 287 flow [2025-01-10 01:06:40,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:06:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:06:40,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 266 transitions. [2025-01-10 01:06:40,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4618055555555556 [2025-01-10 01:06:40,762 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 169 flow. Second operand 9 states and 266 transitions. [2025-01-10 01:06:40,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 287 flow [2025-01-10 01:06:40,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 286 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:06:40,765 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 226 flow [2025-01-10 01:06:40,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=226, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2025-01-10 01:06:40,766 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-01-10 01:06:40,766 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 226 flow [2025-01-10 01:06:40,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 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:06:40,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:40,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:40,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:06:40,971 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:06:40,971 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:40,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash -482580794, now seen corresponding path program 1 times [2025-01-10 01:06:40,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:40,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296434314] [2025-01-10 01:06:40,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:40,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:40,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:06:40,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:06:40,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:40,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:41,067 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:06:41,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:41,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296434314] [2025-01-10 01:06:41,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296434314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:41,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:41,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:06:41,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657994101] [2025-01-10 01:06:41,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:41,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:06:41,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:41,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:06:41,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:06:41,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:06:41,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:06:41,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:41,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:06:41,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:41,843 INFO L124 PetriNetUnfolderBase]: 5237/7874 cut-off events. [2025-01-10 01:06:41,843 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:06:41,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15261 conditions, 7874 events. 5237/7874 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 59852 event pairs, 5051 based on Foata normal form. 250/4913 useless extension candidates. Maximal degree in co-relation 13045. Up to 6142 conditions per place. [2025-01-10 01:06:41,896 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 75 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2025-01-10 01:06:41,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 500 flow [2025-01-10 01:06:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:06:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:06:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2025-01-10 01:06:41,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6375 [2025-01-10 01:06:41,898 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 226 flow. Second operand 5 states and 204 transitions. [2025-01-10 01:06:41,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 500 flow [2025-01-10 01:06:41,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 97 transitions, 432 flow, removed 16 selfloop flow, removed 6 redundant places. [2025-01-10 01:06:41,904 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 221 flow [2025-01-10 01:06:41,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2025-01-10 01:06:41,904 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-01-10 01:06:41,905 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 221 flow [2025-01-10 01:06:41,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:06:41,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:41,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:41,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:06:41,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:41,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:41,907 INFO L85 PathProgramCache]: Analyzing trace with hash 43895406, now seen corresponding path program 1 times [2025-01-10 01:06:41,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:41,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385740369] [2025-01-10 01:06:41,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:41,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:41,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:06:41,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:06:41,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:41,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:41,994 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:06:41,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:41,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385740369] [2025-01-10 01:06:41,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385740369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:41,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:41,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:06:41,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863105508] [2025-01-10 01:06:41,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:41,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:06:41,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:41,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:06:41,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:06:42,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:06:42,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:06:42,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:42,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:06:42,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:42,522 INFO L124 PetriNetUnfolderBase]: 3403/5266 cut-off events. [2025-01-10 01:06:42,522 INFO L125 PetriNetUnfolderBase]: For 425/425 co-relation queries the response was YES. [2025-01-10 01:06:42,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11415 conditions, 5266 events. 3403/5266 cut-off events. For 425/425 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 38957 event pairs, 3251 based on Foata normal form. 0/3349 useless extension candidates. Maximal degree in co-relation 9960. Up to 4639 conditions per place. [2025-01-10 01:06:42,551 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 43 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2025-01-10 01:06:42,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 313 flow [2025-01-10 01:06:42,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:06:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:06:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-01-10 01:06:42,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.515625 [2025-01-10 01:06:42,553 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 221 flow. Second operand 4 states and 132 transitions. [2025-01-10 01:06:42,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 313 flow [2025-01-10 01:06:42,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 309 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 01:06:42,558 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 223 flow [2025-01-10 01:06:42,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2025-01-10 01:06:42,559 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-01-10 01:06:42,560 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 223 flow [2025-01-10 01:06:42,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:06:42,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:42,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:42,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:06:42,561 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:42,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:42,561 INFO L85 PathProgramCache]: Analyzing trace with hash 43895407, now seen corresponding path program 1 times [2025-01-10 01:06:42,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:42,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35617000] [2025-01-10 01:06:42,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:42,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:42,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:06:42,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:06:42,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:42,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:42,657 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:06:42,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:42,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35617000] [2025-01-10 01:06:42,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35617000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:42,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:42,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:06:42,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813731732] [2025-01-10 01:06:42,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:42,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:06:42,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:42,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:06:42,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:06:42,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:06:42,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:06:42,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:42,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:06:42,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:43,233 INFO L124 PetriNetUnfolderBase]: 4227/6777 cut-off events. [2025-01-10 01:06:43,233 INFO L125 PetriNetUnfolderBase]: For 556/556 co-relation queries the response was YES. [2025-01-10 01:06:43,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14663 conditions, 6777 events. 4227/6777 cut-off events. For 556/556 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 53714 event pairs, 4066 based on Foata normal form. 241/4790 useless extension candidates. Maximal degree in co-relation 9931. Up to 4655 conditions per place. [2025-01-10 01:06:43,284 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 64 selfloop transitions, 7 changer transitions 0/88 dead transitions. [2025-01-10 01:06:43,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 431 flow [2025-01-10 01:06:43,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:06:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:06:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2025-01-10 01:06:43,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-01-10 01:06:43,286 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 223 flow. Second operand 4 states and 168 transitions. [2025-01-10 01:06:43,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 431 flow [2025-01-10 01:06:43,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 88 transitions, 418 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:06:43,289 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 234 flow [2025-01-10 01:06:43,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2025-01-10 01:06:43,290 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2025-01-10 01:06:43,290 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 234 flow [2025-01-10 01:06:43,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:06:43,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:43,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:43,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:06:43,291 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:43,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:43,291 INFO L85 PathProgramCache]: Analyzing trace with hash 799343057, now seen corresponding path program 1 times [2025-01-10 01:06:43,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:43,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113498844] [2025-01-10 01:06:43,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:43,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:43,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:06:43,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:06:43,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:43,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:06:43,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:43,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113498844] [2025-01-10 01:06:43,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113498844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:43,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:43,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:06:43,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611081134] [2025-01-10 01:06:43,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:43,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:06:43,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:43,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:06:43,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:06:43,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:06:43,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:06:43,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:43,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:06:43,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:43,945 INFO L124 PetriNetUnfolderBase]: 2874/4728 cut-off events. [2025-01-10 01:06:43,945 INFO L125 PetriNetUnfolderBase]: For 843/843 co-relation queries the response was YES. [2025-01-10 01:06:43,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10822 conditions, 4728 events. 2874/4728 cut-off events. For 843/843 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 36508 event pairs, 2756 based on Foata normal form. 0/3378 useless extension candidates. Maximal degree in co-relation 6932. Up to 4074 conditions per place. [2025-01-10 01:06:43,983 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 38 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2025-01-10 01:06:43,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 63 transitions, 318 flow [2025-01-10 01:06:43,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:06:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:06:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-01-10 01:06:43,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48125 [2025-01-10 01:06:43,985 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 234 flow. Second operand 5 states and 154 transitions. [2025-01-10 01:06:43,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 63 transitions, 318 flow [2025-01-10 01:06:43,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:06:43,989 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 237 flow [2025-01-10 01:06:43,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2025-01-10 01:06:43,990 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 2 predicate places. [2025-01-10 01:06:43,990 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 237 flow [2025-01-10 01:06:43,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:06:43,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:43,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:43,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:06:43,991 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:43,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:43,992 INFO L85 PathProgramCache]: Analyzing trace with hash 799343058, now seen corresponding path program 1 times [2025-01-10 01:06:43,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:43,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906454491] [2025-01-10 01:06:43,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:43,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:44,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:06:44,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:06:44,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:44,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:44,228 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:06:44,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:44,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906454491] [2025-01-10 01:06:44,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906454491] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:44,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58168114] [2025-01-10 01:06:44,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:44,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:44,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:44,231 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:06:44,234 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:06:44,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:06:44,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:06:44,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:44,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:44,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:06:44,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:44,329 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:06:44,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:06:44,395 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 18 treesize of output 13 [2025-01-10 01:06:44,414 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:06:44,415 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:06:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:44,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:06:44,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58168114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:44,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:06:44,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-01-10 01:06:44,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416548105] [2025-01-10 01:06:44,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:44,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:06:44,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:44,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:06:44,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:06:44,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:06:44,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:06:44,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:44,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:06:44,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:44,864 INFO L124 PetriNetUnfolderBase]: 1825/3123 cut-off events. [2025-01-10 01:06:44,864 INFO L125 PetriNetUnfolderBase]: For 621/621 co-relation queries the response was YES. [2025-01-10 01:06:44,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6919 conditions, 3123 events. 1825/3123 cut-off events. For 621/621 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 23307 event pairs, 1742 based on Foata normal form. 0/2490 useless extension candidates. Maximal degree in co-relation 3827. Up to 2669 conditions per place. [2025-01-10 01:06:44,882 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 40 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2025-01-10 01:06:44,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 317 flow [2025-01-10 01:06:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:06:44,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:06:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-01-10 01:06:44,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 01:06:44,883 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 237 flow. Second operand 4 states and 128 transitions. [2025-01-10 01:06:44,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 317 flow [2025-01-10 01:06:44,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 305 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:06:44,886 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 225 flow [2025-01-10 01:06:44,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2025-01-10 01:06:44,887 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-01-10 01:06:44,887 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 225 flow [2025-01-10 01:06:44,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:06:44,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:44,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:44,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:06:45,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:45,092 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:45,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:45,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1797164947, now seen corresponding path program 1 times [2025-01-10 01:06:45,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:45,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948313640] [2025-01-10 01:06:45,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:45,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:45,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:06:45,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:06:45,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:45,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:45,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:45,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948313640] [2025-01-10 01:06:45,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948313640] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:45,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937555582] [2025-01-10 01:06:45,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:45,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:45,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:45,342 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:06:45,344 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:06:45,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:06:45,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:06:45,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:45,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:45,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:06:45,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:45,539 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:06:45,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937555582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:45,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:06:45,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-10 01:06:45,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927932318] [2025-01-10 01:06:45,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:45,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:06:45,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:45,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:06:45,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:06:45,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:06:45,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 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:06:45,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:45,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:06:45,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:45,816 INFO L124 PetriNetUnfolderBase]: 1199/2183 cut-off events. [2025-01-10 01:06:45,817 INFO L125 PetriNetUnfolderBase]: For 467/467 co-relation queries the response was YES. [2025-01-10 01:06:45,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4632 conditions, 2183 events. 1199/2183 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16047 event pairs, 1132 based on Foata normal form. 0/1892 useless extension candidates. Maximal degree in co-relation 3219. Up to 1784 conditions per place. [2025-01-10 01:06:45,829 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 35 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2025-01-10 01:06:45,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 301 flow [2025-01-10 01:06:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:06:45,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:06:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-01-10 01:06:45,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2025-01-10 01:06:45,832 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 225 flow. Second operand 4 states and 134 transitions. [2025-01-10 01:06:45,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 301 flow [2025-01-10 01:06:45,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:45,834 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 226 flow [2025-01-10 01:06:45,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2025-01-10 01:06:45,834 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-01-10 01:06:45,835 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 226 flow [2025-01-10 01:06:45,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 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:06:45,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:45,836 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] [2025-01-10 01:06:45,844 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:06:46,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:46,040 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:46,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:46,041 INFO L85 PathProgramCache]: Analyzing trace with hash 603602869, now seen corresponding path program 1 times [2025-01-10 01:06:46,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:46,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000204274] [2025-01-10 01:06:46,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:46,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:46,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:06:46,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:06:46,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:46,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:46,210 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:06:46,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:46,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000204274] [2025-01-10 01:06:46,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000204274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:46,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:46,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:06:46,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166804988] [2025-01-10 01:06:46,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:46,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:06:46,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:46,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:06:46,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:06:46,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:06:46,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 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:06:46,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:46,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:06:46,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:46,609 INFO L124 PetriNetUnfolderBase]: 2553/3833 cut-off events. [2025-01-10 01:06:46,609 INFO L125 PetriNetUnfolderBase]: For 1046/1106 co-relation queries the response was YES. [2025-01-10 01:06:46,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8583 conditions, 3833 events. 2553/3833 cut-off events. For 1046/1106 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 21204 event pairs, 383 based on Foata normal form. 208/3946 useless extension candidates. Maximal degree in co-relation 7250. Up to 2033 conditions per place. [2025-01-10 01:06:46,630 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 62 selfloop transitions, 6 changer transitions 3/86 dead transitions. [2025-01-10 01:06:46,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 442 flow [2025-01-10 01:06:46,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:06:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:06:46,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2025-01-10 01:06:46,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55625 [2025-01-10 01:06:46,633 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 226 flow. Second operand 5 states and 178 transitions. [2025-01-10 01:06:46,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 442 flow [2025-01-10 01:06:46,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 86 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:46,636 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 208 flow [2025-01-10 01:06:46,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2025-01-10 01:06:46,637 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 2 predicate places. [2025-01-10 01:06:46,637 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 208 flow [2025-01-10 01:06:46,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 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:06:46,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:46,638 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] [2025-01-10 01:06:46,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:06:46,639 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:46,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:46,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2036632048, now seen corresponding path program 1 times [2025-01-10 01:06:46,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:46,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596321044] [2025-01-10 01:06:46,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:46,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:46,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:06:46,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:06:46,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:46,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:06:46,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:46,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596321044] [2025-01-10 01:06:46,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596321044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:46,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:46,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:06:46,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315274556] [2025-01-10 01:06:46,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:46,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:06:46,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:46,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:06:46,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:06:46,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:06:46,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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:06:46,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:46,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:06:46,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:47,245 INFO L124 PetriNetUnfolderBase]: 2165/3342 cut-off events. [2025-01-10 01:06:47,245 INFO L125 PetriNetUnfolderBase]: For 2108/2558 co-relation queries the response was YES. [2025-01-10 01:06:47,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8480 conditions, 3342 events. 2165/3342 cut-off events. For 2108/2558 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 19829 event pairs, 249 based on Foata normal form. 576/3889 useless extension candidates. Maximal degree in co-relation 8440. Up to 1976 conditions per place. [2025-01-10 01:06:47,271 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 69 selfloop transitions, 9 changer transitions 0/93 dead transitions. [2025-01-10 01:06:47,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 93 transitions, 480 flow [2025-01-10 01:06:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:06:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:06:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2025-01-10 01:06:47,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5494791666666666 [2025-01-10 01:06:47,273 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 208 flow. Second operand 6 states and 211 transitions. [2025-01-10 01:06:47,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 93 transitions, 480 flow [2025-01-10 01:06:47,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 93 transitions, 463 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 01:06:47,276 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 257 flow [2025-01-10 01:06:47,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2025-01-10 01:06:47,278 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 4 predicate places. [2025-01-10 01:06:47,278 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 257 flow [2025-01-10 01:06:47,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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:06:47,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:47,279 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] [2025-01-10 01:06:47,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:06:47,279 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:47,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:47,279 INFO L85 PathProgramCache]: Analyzing trace with hash -997673378, now seen corresponding path program 2 times [2025-01-10 01:06:47,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:47,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464397245] [2025-01-10 01:06:47,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:06:47,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:47,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-10 01:06:47,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 34 statements. [2025-01-10 01:06:47,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:06:47,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:47,427 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:06:47,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:47,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464397245] [2025-01-10 01:06:47,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464397245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:47,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:47,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:06:47,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384682439] [2025-01-10 01:06:47,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:47,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:06:47,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:47,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:06:47,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:06:47,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:06:47,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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:06:47,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:47,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:06:47,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:47,828 INFO L124 PetriNetUnfolderBase]: 2082/3345 cut-off events. [2025-01-10 01:06:47,828 INFO L125 PetriNetUnfolderBase]: For 3308/3470 co-relation queries the response was YES. [2025-01-10 01:06:47,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9245 conditions, 3345 events. 2082/3345 cut-off events. For 3308/3470 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 20817 event pairs, 94 based on Foata normal form. 283/3594 useless extension candidates. Maximal degree in co-relation 9203. Up to 1492 conditions per place. [2025-01-10 01:06:47,845 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 83 selfloop transitions, 9 changer transitions 0/107 dead transitions. [2025-01-10 01:06:47,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 107 transitions, 573 flow [2025-01-10 01:06:47,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:06:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:06:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2025-01-10 01:06:47,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5859375 [2025-01-10 01:06:47,847 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 257 flow. Second operand 6 states and 225 transitions. [2025-01-10 01:06:47,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 107 transitions, 573 flow [2025-01-10 01:06:47,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 107 transitions, 562 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:47,851 INFO L231 Difference]: Finished difference. Result has 75 places, 63 transitions, 272 flow [2025-01-10 01:06:47,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=75, PETRI_TRANSITIONS=63} [2025-01-10 01:06:47,851 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 9 predicate places. [2025-01-10 01:06:47,851 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 63 transitions, 272 flow [2025-01-10 01:06:47,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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:06:47,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:47,852 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:06:47,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:06:47,852 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:47,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:47,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1858031100, now seen corresponding path program 1 times [2025-01-10 01:06:47,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:47,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094052428] [2025-01-10 01:06:47,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:47,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:47,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 01:06:47,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:06:47,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:47,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:48,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:48,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094052428] [2025-01-10 01:06:48,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094052428] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:48,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008160072] [2025-01-10 01:06:48,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:48,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:48,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:48,454 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:06:48,455 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:06:48,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 01:06:48,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:06:48,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:48,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:48,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:06:48,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:48,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 01:06:48,810 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 5 treesize of output 3 [2025-01-10 01:06:48,817 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 10 treesize of output 8 [2025-01-10 01:06:48,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 01:06:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:48,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:06:49,061 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 6 treesize of output 4 [2025-01-10 01:06:49,066 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 10 treesize of output 8 [2025-01-10 01:06:49,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2025-01-10 01:06:49,643 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 47 treesize of output 35 [2025-01-10 01:06:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:49,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008160072] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:06:49,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:06:49,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-01-10 01:06:49,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194916283] [2025-01-10 01:06:49,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:06:49,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:06:49,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:49,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:06:49,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:06:49,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:06:49,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 63 transitions, 272 flow. Second operand has 18 states, 18 states have (on average 29.555555555555557) internal successors, (532), 18 states have internal predecessors, (532), 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:06:49,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:49,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:06:49,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:51,295 INFO L124 PetriNetUnfolderBase]: 3586/6188 cut-off events. [2025-01-10 01:06:51,296 INFO L125 PetriNetUnfolderBase]: For 10117/10584 co-relation queries the response was YES. [2025-01-10 01:06:51,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17794 conditions, 6188 events. 3586/6188 cut-off events. For 10117/10584 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 44948 event pairs, 823 based on Foata normal form. 454/6396 useless extension candidates. Maximal degree in co-relation 10451. Up to 2303 conditions per place. [2025-01-10 01:06:51,339 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 129 selfloop transitions, 44 changer transitions 5/198 dead transitions. [2025-01-10 01:06:51,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 198 transitions, 1187 flow [2025-01-10 01:06:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 01:06:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 01:06:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 626 transitions. [2025-01-10 01:06:51,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5434027777777778 [2025-01-10 01:06:51,342 INFO L175 Difference]: Start difference. First operand has 75 places, 63 transitions, 272 flow. Second operand 18 states and 626 transitions. [2025-01-10 01:06:51,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 198 transitions, 1187 flow [2025-01-10 01:06:51,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 198 transitions, 1136 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:51,380 INFO L231 Difference]: Finished difference. Result has 95 places, 98 transitions, 635 flow [2025-01-10 01:06:51,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=635, PETRI_PLACES=95, PETRI_TRANSITIONS=98} [2025-01-10 01:06:51,380 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 29 predicate places. [2025-01-10 01:06:51,380 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 98 transitions, 635 flow [2025-01-10 01:06:51,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 29.555555555555557) internal successors, (532), 18 states have internal predecessors, (532), 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:06:51,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:51,381 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:51,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:06:51,581 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,SelfDestructingSolverStorable13 [2025-01-10 01:06:51,582 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:51,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:51,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1390234687, now seen corresponding path program 1 times [2025-01-10 01:06:51,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:51,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689969132] [2025-01-10 01:06:51,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:51,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 01:06:51,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:06:51,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:51,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:06:52,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:52,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689969132] [2025-01-10 01:06:52,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689969132] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:52,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509884123] [2025-01-10 01:06:52,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:52,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:52,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:52,396 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:06:52,398 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:06:52,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 01:06:52,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:06:52,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:52,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:52,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:06:52,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:52,650 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 5 treesize of output 3 [2025-01-10 01:06:52,654 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 10 treesize of output 8 [2025-01-10 01:06:52,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-01-10 01:06:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:06:52,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:06:52,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:06:52,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-01-10 01:06:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:06:52,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509884123] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:06:52,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:06:52,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 14 [2025-01-10 01:06:52,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831466339] [2025-01-10 01:06:52,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:06:52,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 01:06:52,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:52,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 01:06:52,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:06:53,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:06:53,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 98 transitions, 635 flow. Second operand has 15 states, 15 states have (on average 30.333333333333332) internal successors, (455), 15 states have internal predecessors, (455), 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:06:53,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:53,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:06:53,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:53,921 INFO L124 PetriNetUnfolderBase]: 4054/7017 cut-off events. [2025-01-10 01:06:53,921 INFO L125 PetriNetUnfolderBase]: For 14652/15124 co-relation queries the response was YES. [2025-01-10 01:06:53,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21308 conditions, 7017 events. 4054/7017 cut-off events. For 14652/15124 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 52192 event pairs, 127 based on Foata normal form. 442/7247 useless extension candidates. Maximal degree in co-relation 17475. Up to 1928 conditions per place. [2025-01-10 01:06:53,970 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 105 selfloop transitions, 51 changer transitions 1/177 dead transitions. [2025-01-10 01:06:53,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 177 transitions, 1290 flow [2025-01-10 01:06:53,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:06:53,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:06:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 478 transitions. [2025-01-10 01:06:53,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5334821428571429 [2025-01-10 01:06:53,973 INFO L175 Difference]: Start difference. First operand has 95 places, 98 transitions, 635 flow. Second operand 14 states and 478 transitions. [2025-01-10 01:06:53,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 177 transitions, 1290 flow [2025-01-10 01:06:54,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 177 transitions, 1288 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:06:54,040 INFO L231 Difference]: Finished difference. Result has 108 places, 115 transitions, 906 flow [2025-01-10 01:06:54,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=906, PETRI_PLACES=108, PETRI_TRANSITIONS=115} [2025-01-10 01:06:54,041 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 42 predicate places. [2025-01-10 01:06:54,041 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 115 transitions, 906 flow [2025-01-10 01:06:54,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 30.333333333333332) internal successors, (455), 15 states have internal predecessors, (455), 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:06:54,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:54,041 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, 1, 1, 1, 1, 1] [2025-01-10 01:06:54,048 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:06:54,242 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,SelfDestructingSolverStorable14 [2025-01-10 01:06:54,242 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:54,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:54,242 INFO L85 PathProgramCache]: Analyzing trace with hash -315545948, now seen corresponding path program 1 times [2025-01-10 01:06:54,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:54,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102187718] [2025-01-10 01:06:54,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:54,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:54,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:06:54,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:06:54,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:54,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:06:54,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:54,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102187718] [2025-01-10 01:06:54,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102187718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:54,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:54,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:06:54,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014114094] [2025-01-10 01:06:54,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:54,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:06:54,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:54,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:06:54,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:06:54,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:06:54,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 115 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:06:54,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:54,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:06:54,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:55,207 INFO L124 PetriNetUnfolderBase]: 4919/8142 cut-off events. [2025-01-10 01:06:55,207 INFO L125 PetriNetUnfolderBase]: For 33053/34024 co-relation queries the response was YES. [2025-01-10 01:06:55,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26988 conditions, 8142 events. 4919/8142 cut-off events. For 33053/34024 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 58854 event pairs, 1783 based on Foata normal form. 918/8673 useless extension candidates. Maximal degree in co-relation 19541. Up to 3563 conditions per place. [2025-01-10 01:06:55,258 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 115 selfloop transitions, 10 changer transitions 0/145 dead transitions. [2025-01-10 01:06:55,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 145 transitions, 1382 flow [2025-01-10 01:06:55,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:06:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:06:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-01-10 01:06:55,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-01-10 01:06:55,259 INFO L175 Difference]: Start difference. First operand has 108 places, 115 transitions, 906 flow. Second operand 3 states and 124 transitions. [2025-01-10 01:06:55,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 145 transitions, 1382 flow [2025-01-10 01:06:55,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 145 transitions, 1354 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-10 01:06:55,292 INFO L231 Difference]: Finished difference. Result has 108 places, 116 transitions, 938 flow [2025-01-10 01:06:55,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=938, PETRI_PLACES=108, PETRI_TRANSITIONS=116} [2025-01-10 01:06:55,292 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 42 predicate places. [2025-01-10 01:06:55,293 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 116 transitions, 938 flow [2025-01-10 01:06:55,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:06:55,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:55,293 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:55,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:06:55,293 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:55,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2019755045, now seen corresponding path program 2 times [2025-01-10 01:06:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:55,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068855039] [2025-01-10 01:06:55,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:06:55,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:55,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-10 01:06:55,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:06:55,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:06:55,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:06:55,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:55,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068855039] [2025-01-10 01:06:55,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068855039] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:55,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400240375] [2025-01-10 01:06:55,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:06:55,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:55,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:55,412 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:06:55,414 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:06:55,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-10 01:06:55,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:06:55,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:06:55,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:55,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:06:55,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:06:55,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:06:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:06:55,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400240375] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:06:55,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:06:55,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-10 01:06:55,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811888453] [2025-01-10 01:06:55,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:06:55,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:06:55,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:55,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:06:55,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:06:55,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:06:55,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 116 transitions, 938 flow. Second operand has 8 states, 8 states have (on average 30.5) internal successors, (244), 8 states have internal predecessors, (244), 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:06:55,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:55,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:06:55,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:57,547 INFO L124 PetriNetUnfolderBase]: 11331/19312 cut-off events. [2025-01-10 01:06:57,547 INFO L125 PetriNetUnfolderBase]: For 65229/66733 co-relation queries the response was YES. [2025-01-10 01:06:57,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62213 conditions, 19312 events. 11331/19312 cut-off events. For 65229/66733 co-relation queries the response was YES. Maximal size of possible extension queue 1069. Compared 162267 event pairs, 2056 based on Foata normal form. 1287/20143 useless extension candidates. Maximal degree in co-relation 43844. Up to 6541 conditions per place. [2025-01-10 01:06:57,682 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 122 selfloop transitions, 38 changer transitions 0/180 dead transitions. [2025-01-10 01:06:57,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 180 transitions, 1707 flow [2025-01-10 01:06:57,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:06:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:06:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2025-01-10 01:06:57,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.671875 [2025-01-10 01:06:57,684 INFO L175 Difference]: Start difference. First operand has 108 places, 116 transitions, 938 flow. Second operand 4 states and 172 transitions. [2025-01-10 01:06:57,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 180 transitions, 1707 flow [2025-01-10 01:06:57,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 180 transitions, 1647 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-01-10 01:06:57,933 INFO L231 Difference]: Finished difference. Result has 112 places, 133 transitions, 1284 flow [2025-01-10 01:06:57,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1284, PETRI_PLACES=112, PETRI_TRANSITIONS=133} [2025-01-10 01:06:57,934 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 46 predicate places. [2025-01-10 01:06:57,934 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 133 transitions, 1284 flow [2025-01-10 01:06:57,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.5) internal successors, (244), 8 states have internal predecessors, (244), 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:06:57,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:57,935 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:57,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:06:58,136 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,SelfDestructingSolverStorable16 [2025-01-10 01:06:58,136 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:06:58,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:58,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1700326039, now seen corresponding path program 3 times [2025-01-10 01:06:58,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:58,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115465717] [2025-01-10 01:06:58,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:06:58,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:58,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 3 equivalence classes. [2025-01-10 01:06:58,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 43 of 45 statements. [2025-01-10 01:06:58,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:06:58,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:06:58,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:58,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115465717] [2025-01-10 01:06:58,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115465717] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:06:58,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517613050] [2025-01-10 01:06:58,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:06:58,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:06:58,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:58,673 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:06:58,675 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:06:58,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 3 equivalence classes. [2025-01-10 01:06:58,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 43 of 45 statements. [2025-01-10 01:06:58,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:06:58,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:58,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:06:58,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:06:59,137 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 5 treesize of output 3 [2025-01-10 01:06:59,140 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 10 treesize of output 8 [2025-01-10 01:06:59,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:06:59,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 12 [2025-01-10 01:06:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:06:59,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:06:59,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:06:59,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 51 [2025-01-10 01:06:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:06:59,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517613050] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:06:59,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:06:59,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2025-01-10 01:06:59,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504123533] [2025-01-10 01:06:59,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:06:59,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:06:59,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:59,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:06:59,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:06:59,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:06:59,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 133 transitions, 1284 flow. Second operand has 19 states, 19 states have (on average 29.68421052631579) internal successors, (564), 19 states have internal predecessors, (564), 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:06:59,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:59,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:06:59,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:03,943 INFO L124 PetriNetUnfolderBase]: 18113/30885 cut-off events. [2025-01-10 01:07:03,944 INFO L125 PetriNetUnfolderBase]: For 122616/125183 co-relation queries the response was YES. [2025-01-10 01:07:04,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105366 conditions, 30885 events. 18113/30885 cut-off events. For 122616/125183 co-relation queries the response was YES. Maximal size of possible extension queue 1587. Compared 273809 event pairs, 176 based on Foata normal form. 1194/31817 useless extension candidates. Maximal degree in co-relation 69739. Up to 5570 conditions per place. [2025-01-10 01:07:04,146 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 244 selfloop transitions, 97 changer transitions 11/372 dead transitions. [2025-01-10 01:07:04,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 372 transitions, 3153 flow [2025-01-10 01:07:04,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 01:07:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 01:07:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 747 transitions. [2025-01-10 01:07:04,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6143092105263158 [2025-01-10 01:07:04,149 INFO L175 Difference]: Start difference. First operand has 112 places, 133 transitions, 1284 flow. Second operand 19 states and 747 transitions. [2025-01-10 01:07:04,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 372 transitions, 3153 flow [2025-01-10 01:07:04,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 372 transitions, 3099 flow, removed 27 selfloop flow, removed 0 redundant places. [2025-01-10 01:07:04,539 INFO L231 Difference]: Finished difference. Result has 138 places, 177 transitions, 1994 flow [2025-01-10 01:07:04,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1994, PETRI_PLACES=138, PETRI_TRANSITIONS=177} [2025-01-10 01:07:04,540 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 72 predicate places. [2025-01-10 01:07:04,540 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 177 transitions, 1994 flow [2025-01-10 01:07:04,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 29.68421052631579) internal successors, (564), 19 states have internal predecessors, (564), 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:07:04,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:04,541 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:04,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:04,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:04,741 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:07:04,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:04,742 INFO L85 PathProgramCache]: Analyzing trace with hash 588442725, now seen corresponding path program 4 times [2025-01-10 01:07:04,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:04,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245977181] [2025-01-10 01:07:04,742 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:07:04,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:04,752 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-01-10 01:07:04,781 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:07:04,782 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:07:04,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:05,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:05,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245977181] [2025-01-10 01:07:05,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245977181] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:05,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261120731] [2025-01-10 01:07:05,933 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:07:05,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:05,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:05,935 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:07:05,938 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:07:06,015 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-01-10 01:07:06,058 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:07:06,058 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:07:06,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:06,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 01:07:06,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:06,492 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 9 treesize of output 7 [2025-01-10 01:07:06,498 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 5 treesize of output 3 [2025-01-10 01:07:06,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:07:06,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2025-01-10 01:07:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:06,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:06,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:07:06,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 51 [2025-01-10 01:07:06,973 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 10 treesize of output 8 [2025-01-10 01:07:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:07,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261120731] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:07,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:07,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2025-01-10 01:07:07,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686440078] [2025-01-10 01:07:07,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:07,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-10 01:07:07,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:07,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-10 01:07:07,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2025-01-10 01:07:08,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:07:08,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 177 transitions, 1994 flow. Second operand has 29 states, 29 states have (on average 28.75862068965517) internal successors, (834), 29 states have internal predecessors, (834), 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:07:08,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:08,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:07:08,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:23,228 INFO L124 PetriNetUnfolderBase]: 44814/75302 cut-off events. [2025-01-10 01:07:23,228 INFO L125 PetriNetUnfolderBase]: For 381479/385244 co-relation queries the response was YES. [2025-01-10 01:07:23,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270910 conditions, 75302 events. 44814/75302 cut-off events. For 381479/385244 co-relation queries the response was YES. Maximal size of possible extension queue 2992. Compared 708615 event pairs, 3783 based on Foata normal form. 2995/77825 useless extension candidates. Maximal degree in co-relation 266698. Up to 15561 conditions per place. [2025-01-10 01:07:23,932 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 831 selfloop transitions, 288 changer transitions 101/1240 dead transitions. [2025-01-10 01:07:23,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 1240 transitions, 10788 flow [2025-01-10 01:07:23,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2025-01-10 01:07:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2025-01-10 01:07:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 3247 transitions. [2025-01-10 01:07:23,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6039806547619048 [2025-01-10 01:07:23,939 INFO L175 Difference]: Start difference. First operand has 138 places, 177 transitions, 1994 flow. Second operand 84 states and 3247 transitions. [2025-01-10 01:07:23,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 1240 transitions, 10788 flow [2025-01-10 01:07:24,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 1240 transitions, 10438 flow, removed 124 selfloop flow, removed 4 redundant places. [2025-01-10 01:07:24,956 INFO L231 Difference]: Finished difference. Result has 250 places, 422 transitions, 5672 flow [2025-01-10 01:07:24,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1741, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=5672, PETRI_PLACES=250, PETRI_TRANSITIONS=422} [2025-01-10 01:07:24,956 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 184 predicate places. [2025-01-10 01:07:24,956 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 422 transitions, 5672 flow [2025-01-10 01:07:24,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 28.75862068965517) internal successors, (834), 29 states have internal predecessors, (834), 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:07:24,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:24,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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:24,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:07:25,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:25,158 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:07:25,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:25,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1813059072, now seen corresponding path program 1 times [2025-01-10 01:07:25,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:25,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579978160] [2025-01-10 01:07:25,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:25,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:25,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 01:07:25,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:07:25,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:25,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:07:25,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:25,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579978160] [2025-01-10 01:07:25,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579978160] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:25,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415405573] [2025-01-10 01:07:25,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:25,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:25,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:25,555 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:07:25,557 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:07:25,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 01:07:25,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:07:25,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:25,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:25,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:07:25,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:07:26,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:26,378 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:07:26,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415405573] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:26,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:26,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 25 [2025-01-10 01:07:26,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056533326] [2025-01-10 01:07:26,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:26,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:07:26,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:26,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:07:26,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:07:26,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2025-01-10 01:07:26,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 422 transitions, 5672 flow. Second operand has 26 states, 26 states have (on average 20.73076923076923) internal successors, (539), 26 states have internal predecessors, (539), 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:07:26,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:26,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2025-01-10 01:07:26,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand