./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/unroll-cond-5.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/unroll-cond-5.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 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:14:40,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:14:40,771 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:14:40,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:14:40,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:14:40,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:14:40,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:14:40,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:14:40,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:14:40,798 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:14:40,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:14:40,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:14:40,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:14:40,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:14:40,799 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:14:40,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:14:40,800 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:14:40,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:14:40,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:14:40,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:14:40,800 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:14:40,800 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:14:40,800 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:14:40,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:14:40,800 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:14:40,801 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:14:40,801 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:14:40,801 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:14:40,801 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:14:40,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:14:40,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:14:40,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:14:40,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:14:40,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:14:40,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:14:40,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:14:40,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:14:40,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:14:40,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:14:40,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:14:40,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:14:40,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:14:40,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:14:40,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:14:40,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:14:40,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:14:40,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:14:40,803 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 -> 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 [2025-01-10 01:14:41,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:14:41,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:14:41,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:14:41,010 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:14:41,011 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:14:41,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-5.wvr.c [2025-01-10 01:14:42,143 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8df8b575d/8952f4d16a7a46d999e8e72886fd0935/FLAGeebb0b53f [2025-01-10 01:14:42,400 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:14:42,400 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-5.wvr.c [2025-01-10 01:14:42,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8df8b575d/8952f4d16a7a46d999e8e72886fd0935/FLAGeebb0b53f [2025-01-10 01:14:42,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8df8b575d/8952f4d16a7a46d999e8e72886fd0935 [2025-01-10 01:14:42,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:14:42,421 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:14:42,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:14:42,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:14:42,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:14:42,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:14:42" (1/1) ... [2025-01-10 01:14:42,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75133cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:42, skipping insertion in model container [2025-01-10 01:14:42,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:14:42" (1/1) ... [2025-01-10 01:14:42,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:14:42,570 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:14:42,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:14:42,585 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:14:42,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:14:42,626 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:14:42,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:42 WrapperNode [2025-01-10 01:14:42,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:14:42,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:14:42,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:14:42,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:14:42,633 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:14:42" (1/1) ... [2025-01-10 01:14:42,639 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:14:42" (1/1) ... [2025-01-10 01:14:42,665 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 190 [2025-01-10 01:14:42,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:14:42,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:14:42,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:14:42,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:14:42,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:42" (1/1) ... [2025-01-10 01:14:42,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:42" (1/1) ... [2025-01-10 01:14:42,678 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:42" (1/1) ... [2025-01-10 01:14:42,693 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:14:42,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:42" (1/1) ... [2025-01-10 01:14:42,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:42" (1/1) ... [2025-01-10 01:14:42,698 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:42" (1/1) ... [2025-01-10 01:14:42,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:42" (1/1) ... [2025-01-10 01:14:42,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:42" (1/1) ... [2025-01-10 01:14:42,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:42" (1/1) ... [2025-01-10 01:14:42,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:42" (1/1) ... [2025-01-10 01:14:42,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:14:42,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:14:42,706 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:14:42,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:14:42,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:42" (1/1) ... [2025-01-10 01:14:42,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:14:42,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:42,734 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:14:42,736 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:14:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:14:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:14:42,752 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:14:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:14:42,752 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:14:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:14:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:14:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:14:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:14:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:14:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:14:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:14:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:14:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:14:42,754 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:14:42,827 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:14:42,828 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:14:43,109 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:14:43,109 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:14:43,343 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:14:43,344 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:14:43,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:14:43 BoogieIcfgContainer [2025-01-10 01:14:43,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:14:43,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:14:43,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:14:43,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:14:43,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:14:42" (1/3) ... [2025-01-10 01:14:43,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce69b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:14:43, skipping insertion in model container [2025-01-10 01:14:43,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:14:42" (2/3) ... [2025-01-10 01:14:43,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce69b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:14:43, skipping insertion in model container [2025-01-10 01:14:43,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:14:43" (3/3) ... [2025-01-10 01:14:43,352 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2025-01-10 01:14:43,367 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:14:43,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-5.wvr.c that has 3 procedures, 58 locations, 1 initial locations, 3 loop locations, and 24 error locations. [2025-01-10 01:14:43,368 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:14:43,425 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:14:43,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 64 transitions, 142 flow [2025-01-10 01:14:43,473 INFO L124 PetriNetUnfolderBase]: 7/62 cut-off events. [2025-01-10 01:14:43,475 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:14:43,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 62 events. 7/62 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 177 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2025-01-10 01:14:43,477 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 64 transitions, 142 flow [2025-01-10 01:14:43,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 61 transitions, 134 flow [2025-01-10 01:14:43,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:14:43,493 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;@2796b0e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:14:43,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-01-10 01:14:43,496 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:14:43,496 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:14:43,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:14:43,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:43,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:14:43,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:43,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:43,501 INFO L85 PathProgramCache]: Analyzing trace with hash 653798, now seen corresponding path program 1 times [2025-01-10 01:14:43,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:43,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890767937] [2025-01-10 01:14:43,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:43,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:43,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:14:43,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:14:43,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:43,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:43,692 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:14:43,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:43,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890767937] [2025-01-10 01:14:43,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890767937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:43,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:43,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:14:43,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134146779] [2025-01-10 01:14:43,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:43,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:14:43,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:43,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:14:43,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:14:43,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-01-10 01:14:43,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:14:43,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:43,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-01-10 01:14:43,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:43,881 INFO L124 PetriNetUnfolderBase]: 205/526 cut-off events. [2025-01-10 01:14:43,882 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-01-10 01:14:43,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 526 events. 205/526 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3139 event pairs, 130 based on Foata normal form. 1/419 useless extension candidates. Maximal degree in co-relation 772. Up to 325 conditions per place. [2025-01-10 01:14:43,886 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 29 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-01-10 01:14:43,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 190 flow [2025-01-10 01:14:43,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:14:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:14:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-01-10 01:14:43,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-01-10 01:14:43,897 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 134 flow. Second operand 3 states and 123 transitions. [2025-01-10 01:14:43,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 190 flow [2025-01-10 01:14:43,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 182 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:43,902 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 124 flow [2025-01-10 01:14:43,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2025-01-10 01:14:43,906 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2025-01-10 01:14:43,906 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 124 flow [2025-01-10 01:14:43,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:14:43,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:43,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:14:43,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:14:43,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:43,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:43,907 INFO L85 PathProgramCache]: Analyzing trace with hash 653799, now seen corresponding path program 1 times [2025-01-10 01:14:43,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:43,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353012093] [2025-01-10 01:14:43,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:43,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:43,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:14:43,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:14:43,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:43,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:44,179 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:14:44,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:44,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353012093] [2025-01-10 01:14:44,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353012093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:44,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:44,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:14:44,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829378378] [2025-01-10 01:14:44,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:44,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:14:44,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:44,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:14:44,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:14:44,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-01-10 01:14:44,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:14:44,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:44,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-01-10 01:14:44,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:44,354 INFO L124 PetriNetUnfolderBase]: 206/529 cut-off events. [2025-01-10 01:14:44,354 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-10 01:14:44,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 529 events. 206/529 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3146 event pairs, 130 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 849. Up to 330 conditions per place. [2025-01-10 01:14:44,357 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 32 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2025-01-10 01:14:44,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 202 flow [2025-01-10 01:14:44,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:14:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:14:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-01-10 01:14:44,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-01-10 01:14:44,361 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 124 flow. Second operand 3 states and 126 transitions. [2025-01-10 01:14:44,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 202 flow [2025-01-10 01:14:44,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 61 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:44,362 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 139 flow [2025-01-10 01:14:44,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2025-01-10 01:14:44,363 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2025-01-10 01:14:44,363 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 139 flow [2025-01-10 01:14:44,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:14:44,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:44,363 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:14:44,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:14:44,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:44,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash 628321339, now seen corresponding path program 1 times [2025-01-10 01:14:44,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:44,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4902978] [2025-01-10 01:14:44,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:44,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:44,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:14:44,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:14:44,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:44,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:44,625 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:14:44,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:44,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4902978] [2025-01-10 01:14:44,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4902978] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:44,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620375255] [2025-01-10 01:14:44,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:44,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:44,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:44,629 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:14:44,631 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:14:44,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:14:44,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:14:44,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:44,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:44,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:14:44,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:44,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:14:44,815 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:14:44,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:44,908 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:14:44,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620375255] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:44,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:44,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:14:44,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696483185] [2025-01-10 01:14:44,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:44,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:14:44,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:44,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:14:44,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:14:45,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-01-10 01:14:45,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 139 flow. Second operand has 11 states, 11 states have (on average 31.363636363636363) internal successors, (345), 11 states have internal predecessors, (345), 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:14:45,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:45,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-01-10 01:14:45,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:45,352 INFO L124 PetriNetUnfolderBase]: 206/528 cut-off events. [2025-01-10 01:14:45,352 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-10 01:14:45,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 528 events. 206/528 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3152 event pairs, 130 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 849. Up to 326 conditions per place. [2025-01-10 01:14:45,358 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 28 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-01-10 01:14:45,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 205 flow [2025-01-10 01:14:45,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2025-01-10 01:14:45,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.578125 [2025-01-10 01:14:45,362 INFO L175 Difference]: Start difference. First operand has 57 places, 60 transitions, 139 flow. Second operand 5 states and 185 transitions. [2025-01-10 01:14:45,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 205 flow [2025-01-10 01:14:45,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:45,364 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 152 flow [2025-01-10 01:14:45,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=152, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2025-01-10 01:14:45,365 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2025-01-10 01:14:45,366 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 152 flow [2025-01-10 01:14:45,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 31.363636363636363) internal successors, (345), 11 states have internal predecessors, (345), 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:14:45,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:45,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:14:45,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:45,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:45,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:45,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:45,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1994499551, now seen corresponding path program 1 times [2025-01-10 01:14:45,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:45,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423855444] [2025-01-10 01:14:45,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:45,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:45,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:14:45,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:14:45,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:45,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:45,648 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:14:45,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:45,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423855444] [2025-01-10 01:14:45,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423855444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:45,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:45,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:14:45,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518637194] [2025-01-10 01:14:45,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:45,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:14:45,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:45,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:14:45,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:14:45,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2025-01-10 01:14:45,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:14:45,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:45,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2025-01-10 01:14:45,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:45,770 INFO L124 PetriNetUnfolderBase]: 206/451 cut-off events. [2025-01-10 01:14:45,770 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-10 01:14:45,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 451 events. 206/451 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2228 event pairs, 130 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 780. Up to 325 conditions per place. [2025-01-10 01:14:45,772 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 31 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2025-01-10 01:14:45,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 200 flow [2025-01-10 01:14:45,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:14:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:14:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-01-10 01:14:45,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47265625 [2025-01-10 01:14:45,773 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 152 flow. Second operand 4 states and 121 transitions. [2025-01-10 01:14:45,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 200 flow [2025-01-10 01:14:45,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 187 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:45,774 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 125 flow [2025-01-10 01:14:45,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2025-01-10 01:14:45,775 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -11 predicate places. [2025-01-10 01:14:45,775 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 125 flow [2025-01-10 01:14:45,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:14:45,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:45,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:14:45,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:14:45,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:45,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:45,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1994499550, now seen corresponding path program 1 times [2025-01-10 01:14:45,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:45,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518465492] [2025-01-10 01:14:45,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:45,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:45,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:14:45,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:14:45,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:45,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:45,837 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:14:45,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:45,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518465492] [2025-01-10 01:14:45,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518465492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:45,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:45,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:14:45,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955598061] [2025-01-10 01:14:45,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:45,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:14:45,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:45,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:14:45,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:14:45,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 64 [2025-01-10 01:14:45,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:14:45,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:45,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 64 [2025-01-10 01:14:45,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:45,931 INFO L124 PetriNetUnfolderBase]: 205/450 cut-off events. [2025-01-10 01:14:45,932 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-10 01:14:45,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 450 events. 205/450 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2222 event pairs, 130 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 772. Up to 328 conditions per place. [2025-01-10 01:14:45,934 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 31 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-01-10 01:14:45,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 186 flow [2025-01-10 01:14:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:14:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:14:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-01-10 01:14:45,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6614583333333334 [2025-01-10 01:14:45,936 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 125 flow. Second operand 3 states and 127 transitions. [2025-01-10 01:14:45,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 186 flow [2025-01-10 01:14:45,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 183 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:45,938 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 121 flow [2025-01-10 01:14:45,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2025-01-10 01:14:45,939 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -11 predicate places. [2025-01-10 01:14:45,939 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 121 flow [2025-01-10 01:14:45,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:14:45,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:45,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:45,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:14:45,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:45,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:45,941 INFO L85 PathProgramCache]: Analyzing trace with hash 856545102, now seen corresponding path program 1 times [2025-01-10 01:14:45,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:45,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257297859] [2025-01-10 01:14:45,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:45,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:45,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:14:45,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:14:45,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:45,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:46,130 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:14:46,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:46,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257297859] [2025-01-10 01:14:46,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257297859] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:46,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421440060] [2025-01-10 01:14:46,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:46,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:46,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:46,134 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:14:46,139 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:14:46,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:14:46,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:14:46,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:46,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:46,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:14:46,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:46,264 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:14:46,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:46,339 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 29 treesize of output 25 [2025-01-10 01:14:46,357 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:14:46,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421440060] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:46,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:46,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:14:46,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160928261] [2025-01-10 01:14:46,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:46,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:14:46,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:46,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:14:46,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:14:46,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-01-10 01:14:46,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 121 flow. Second operand has 11 states, 11 states have (on average 32.18181818181818) internal successors, (354), 11 states have internal predecessors, (354), 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:14:46,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:46,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-01-10 01:14:46,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:46,824 INFO L124 PetriNetUnfolderBase]: 484/882 cut-off events. [2025-01-10 01:14:46,824 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 01:14:46,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1640 conditions, 882 events. 484/882 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4564 event pairs, 158 based on Foata normal form. 0/758 useless extension candidates. Maximal degree in co-relation 1625. Up to 433 conditions per place. [2025-01-10 01:14:46,828 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 55 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-01-10 01:14:46,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 292 flow [2025-01-10 01:14:46,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 210 transitions. [2025-01-10 01:14:46,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-01-10 01:14:46,829 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 121 flow. Second operand 5 states and 210 transitions. [2025-01-10 01:14:46,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 292 flow [2025-01-10 01:14:46,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:46,830 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 133 flow [2025-01-10 01:14:46,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-01-10 01:14:46,831 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -8 predicate places. [2025-01-10 01:14:46,831 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 133 flow [2025-01-10 01:14:46,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.18181818181818) internal successors, (354), 11 states have internal predecessors, (354), 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:14:46,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:46,831 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:46,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:14:47,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:47,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:47,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:47,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1493855599, now seen corresponding path program 1 times [2025-01-10 01:14:47,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:47,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597158352] [2025-01-10 01:14:47,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:47,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:47,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:47,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:47,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:47,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:47,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:47,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597158352] [2025-01-10 01:14:47,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597158352] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:47,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953826979] [2025-01-10 01:14:47,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:47,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:47,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:47,221 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:14:47,226 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:14:47,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:47,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:47,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:47,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:47,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:14:47,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:47,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:47,496 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 36 treesize of output 32 [2025-01-10 01:14:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:14:47,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953826979] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:47,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:47,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-01-10 01:14:47,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321699364] [2025-01-10 01:14:47,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:47,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:14:47,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:47,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:14:47,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:14:48,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-01-10 01:14:48,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 133 flow. Second operand has 17 states, 17 states have (on average 31.764705882352942) internal successors, (540), 17 states have internal predecessors, (540), 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:14:48,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:48,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-01-10 01:14:48,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:48,842 INFO L124 PetriNetUnfolderBase]: 1011/2021 cut-off events. [2025-01-10 01:14:48,843 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2025-01-10 01:14:48,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3837 conditions, 2021 events. 1011/2021 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 13175 event pairs, 399 based on Foata normal form. 0/1830 useless extension candidates. Maximal degree in co-relation 2146. Up to 661 conditions per place. [2025-01-10 01:14:48,854 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 97 selfloop transitions, 15 changer transitions 0/127 dead transitions. [2025-01-10 01:14:48,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 127 transitions, 541 flow [2025-01-10 01:14:48,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:14:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:14:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 351 transitions. [2025-01-10 01:14:48,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.685546875 [2025-01-10 01:14:48,855 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 133 flow. Second operand 8 states and 351 transitions. [2025-01-10 01:14:48,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 127 transitions, 541 flow [2025-01-10 01:14:48,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 532 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:48,858 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 246 flow [2025-01-10 01:14:48,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=246, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2025-01-10 01:14:48,859 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2025-01-10 01:14:48,860 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 246 flow [2025-01-10 01:14:48,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 31.764705882352942) internal successors, (540), 17 states have internal predecessors, (540), 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:14:48,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:48,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:48,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:14:49,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:49,061 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:49,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:49,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1534042503, now seen corresponding path program 1 times [2025-01-10 01:14:49,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:49,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662313282] [2025-01-10 01:14:49,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:49,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:49,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:49,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:49,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:49,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:49,166 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:14:49,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:49,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662313282] [2025-01-10 01:14:49,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662313282] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:49,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355568644] [2025-01-10 01:14:49,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:49,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:49,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:49,172 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:14:49,173 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:14:49,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:14:49,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:14:49,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:49,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:49,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:14:49,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:49,282 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:14:49,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:49,331 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 29 treesize of output 25 [2025-01-10 01:14:49,346 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:14:49,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355568644] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:49,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:49,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:14:49,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313956449] [2025-01-10 01:14:49,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:49,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:14:49,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:49,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:14:49,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:14:49,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-01-10 01:14:49,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 246 flow. Second operand has 11 states, 11 states have (on average 24.727272727272727) internal successors, (272), 11 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:49,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:49,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-01-10 01:14:49,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:49,839 INFO L124 PetriNetUnfolderBase]: 1759/2993 cut-off events. [2025-01-10 01:14:49,839 INFO L125 PetriNetUnfolderBase]: For 1626/1722 co-relation queries the response was YES. [2025-01-10 01:14:49,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7143 conditions, 2993 events. 1759/2993 cut-off events. For 1626/1722 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16912 event pairs, 330 based on Foata normal form. 160/2976 useless extension candidates. Maximal degree in co-relation 4456. Up to 2041 conditions per place. [2025-01-10 01:14:49,857 INFO L140 encePairwiseOnDemand]: 51/64 looper letters, 63 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2025-01-10 01:14:49,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 476 flow [2025-01-10 01:14:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:49,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-01-10 01:14:49,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-01-10 01:14:49,858 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 246 flow. Second operand 5 states and 176 transitions. [2025-01-10 01:14:49,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 476 flow [2025-01-10 01:14:49,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 474 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:49,866 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 324 flow [2025-01-10 01:14:49,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2025-01-10 01:14:49,866 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 5 predicate places. [2025-01-10 01:14:49,866 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 324 flow [2025-01-10 01:14:49,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.727272727272727) internal successors, (272), 11 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:49,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:49,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:49,878 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:14:50,067 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,SelfDestructingSolverStorable7 [2025-01-10 01:14:50,068 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:50,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:50,068 INFO L85 PathProgramCache]: Analyzing trace with hash -310676624, now seen corresponding path program 1 times [2025-01-10 01:14:50,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:50,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595312274] [2025-01-10 01:14:50,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:50,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:50,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:14:50,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:14:50,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:50,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:50,201 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:14:50,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:50,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595312274] [2025-01-10 01:14:50,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595312274] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:50,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415754621] [2025-01-10 01:14:50,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:50,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:50,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:50,206 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:14:50,207 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:14:50,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:14:50,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:14:50,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:50,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:50,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:14:50,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:50,385 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:14:50,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:50,405 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 29 treesize of output 25 [2025-01-10 01:14:50,532 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:14:50,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415754621] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:50,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:50,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-01-10 01:14:50,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609326250] [2025-01-10 01:14:50,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:50,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:14:50,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:50,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:14:50,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:14:50,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-01-10 01:14:50,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 324 flow. Second operand has 14 states, 14 states have (on average 24.357142857142858) internal successors, (341), 14 states have internal predecessors, (341), 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:14:50,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:50,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-01-10 01:14:50,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:51,163 INFO L124 PetriNetUnfolderBase]: 1851/3144 cut-off events. [2025-01-10 01:14:51,163 INFO L125 PetriNetUnfolderBase]: For 2127/2249 co-relation queries the response was YES. [2025-01-10 01:14:51,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8137 conditions, 3144 events. 1851/3144 cut-off events. For 2127/2249 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17684 event pairs, 775 based on Foata normal form. 0/2985 useless extension candidates. Maximal degree in co-relation 4969. Up to 2373 conditions per place. [2025-01-10 01:14:51,176 INFO L140 encePairwiseOnDemand]: 49/64 looper letters, 88 selfloop transitions, 17 changer transitions 0/112 dead transitions. [2025-01-10 01:14:51,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 112 transitions, 676 flow [2025-01-10 01:14:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 252 transitions. [2025-01-10 01:14:51,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-01-10 01:14:51,178 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 324 flow. Second operand 7 states and 252 transitions. [2025-01-10 01:14:51,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 112 transitions, 676 flow [2025-01-10 01:14:51,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 112 transitions, 645 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:51,184 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 383 flow [2025-01-10 01:14:51,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=383, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2025-01-10 01:14:51,185 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 9 predicate places. [2025-01-10 01:14:51,185 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 383 flow [2025-01-10 01:14:51,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 24.357142857142858) internal successors, (341), 14 states have internal predecessors, (341), 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:14:51,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:51,185 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:51,195 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:14:51,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:51,386 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:51,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:51,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1521837635, now seen corresponding path program 2 times [2025-01-10 01:14:51,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:51,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387265686] [2025-01-10 01:14:51,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:51,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:51,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-10 01:14:51,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-01-10 01:14:51,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:51,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:14:51,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:51,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387265686] [2025-01-10 01:14:51,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387265686] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:51,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534874157] [2025-01-10 01:14:51,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:51,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:51,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:51,495 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:14:51,496 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:14:51,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-10 01:14:51,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-01-10 01:14:51,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:51,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:51,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 01:14:51,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:51,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:14:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:14:51,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:14:51,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534874157] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:51,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:51,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:14:51,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443695746] [2025-01-10 01:14:51,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:51,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:14:51,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:51,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:14:51,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:14:52,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 64 [2025-01-10 01:14:52,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 383 flow. Second operand has 11 states, 11 states have (on average 32.72727272727273) internal successors, (360), 11 states have internal predecessors, (360), 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:14:52,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:52,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 64 [2025-01-10 01:14:52,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:52,312 INFO L124 PetriNetUnfolderBase]: 1405/2605 cut-off events. [2025-01-10 01:14:52,312 INFO L125 PetriNetUnfolderBase]: For 1502/1502 co-relation queries the response was YES. [2025-01-10 01:14:52,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6608 conditions, 2605 events. 1405/2605 cut-off events. For 1502/1502 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16190 event pairs, 706 based on Foata normal form. 0/2589 useless extension candidates. Maximal degree in co-relation 4169. Up to 1606 conditions per place. [2025-01-10 01:14:52,324 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 80 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2025-01-10 01:14:52,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 105 transitions, 738 flow [2025-01-10 01:14:52,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 201 transitions. [2025-01-10 01:14:52,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.628125 [2025-01-10 01:14:52,326 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 383 flow. Second operand 5 states and 201 transitions. [2025-01-10 01:14:52,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 105 transitions, 738 flow [2025-01-10 01:14:52,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 105 transitions, 697 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:14:52,330 INFO L231 Difference]: Finished difference. Result has 68 places, 71 transitions, 370 flow [2025-01-10 01:14:52,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=68, PETRI_TRANSITIONS=71} [2025-01-10 01:14:52,331 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2025-01-10 01:14:52,331 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 71 transitions, 370 flow [2025-01-10 01:14:52,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.72727272727273) internal successors, (360), 11 states have internal predecessors, (360), 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:14:52,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:52,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:52,337 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:14:52,536 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,SelfDestructingSolverStorable9 [2025-01-10 01:14:52,536 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:52,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:52,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2086481914, now seen corresponding path program 1 times [2025-01-10 01:14:52,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:52,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18219170] [2025-01-10 01:14:52,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:52,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:52,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:14:52,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:14:52,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:52,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:52,685 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:14:52,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:52,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18219170] [2025-01-10 01:14:52,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18219170] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:14:52,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744263832] [2025-01-10 01:14:52,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:52,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:52,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:14:52,688 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:14:52,693 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:14:52,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:14:52,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:14:52,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:52,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:52,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:14:52,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:14:52,831 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:14:52,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:14:52,870 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 36 treesize of output 32 [2025-01-10 01:14:52,983 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:14:52,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744263832] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:14:52,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:14:52,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-01-10 01:14:52,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309794099] [2025-01-10 01:14:52,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:14:52,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:14:52,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:52,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:14:52,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:14:53,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-01-10 01:14:53,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 71 transitions, 370 flow. Second operand has 17 states, 17 states have (on average 24.11764705882353) internal successors, (410), 17 states have internal predecessors, (410), 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:14:53,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:53,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-01-10 01:14:53,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:53,937 INFO L124 PetriNetUnfolderBase]: 1644/2790 cut-off events. [2025-01-10 01:14:53,938 INFO L125 PetriNetUnfolderBase]: For 3190/3190 co-relation queries the response was YES. [2025-01-10 01:14:53,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7585 conditions, 2790 events. 1644/2790 cut-off events. For 3190/3190 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15302 event pairs, 820 based on Foata normal form. 48/2711 useless extension candidates. Maximal degree in co-relation 4981. Up to 1353 conditions per place. [2025-01-10 01:14:53,950 INFO L140 encePairwiseOnDemand]: 39/64 looper letters, 97 selfloop transitions, 27 changer transitions 0/130 dead transitions. [2025-01-10 01:14:53,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 130 transitions, 795 flow [2025-01-10 01:14:53,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:14:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:14:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 293 transitions. [2025-01-10 01:14:53,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.572265625 [2025-01-10 01:14:53,951 INFO L175 Difference]: Start difference. First operand has 68 places, 71 transitions, 370 flow. Second operand 8 states and 293 transitions. [2025-01-10 01:14:53,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 130 transitions, 795 flow [2025-01-10 01:14:53,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 130 transitions, 763 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:53,957 INFO L231 Difference]: Finished difference. Result has 73 places, 81 transitions, 508 flow [2025-01-10 01:14:53,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=508, PETRI_PLACES=73, PETRI_TRANSITIONS=81} [2025-01-10 01:14:53,958 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 12 predicate places. [2025-01-10 01:14:53,958 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 508 flow [2025-01-10 01:14:53,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 24.11764705882353) internal successors, (410), 17 states have internal predecessors, (410), 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:14:53,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:53,958 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:53,964 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:14:54,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:14:54,159 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:54,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1178119740, now seen corresponding path program 2 times [2025-01-10 01:14:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:54,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153682138] [2025-01-10 01:14:54,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:54,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:54,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 01:14:54,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-01-10 01:14:54,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:54,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:54,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:54,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153682138] [2025-01-10 01:14:54,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153682138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:54,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:54,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:14:54,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390544298] [2025-01-10 01:14:54,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:54,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:54,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:54,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:54,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:54,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-01-10 01:14:54,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 508 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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:14:54,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:54,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-01-10 01:14:54,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:54,636 INFO L124 PetriNetUnfolderBase]: 1551/2622 cut-off events. [2025-01-10 01:14:54,636 INFO L125 PetriNetUnfolderBase]: For 2971/2971 co-relation queries the response was YES. [2025-01-10 01:14:54,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7537 conditions, 2622 events. 1551/2622 cut-off events. For 2971/2971 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14109 event pairs, 875 based on Foata normal form. 48/2557 useless extension candidates. Maximal degree in co-relation 4906. Up to 1865 conditions per place. [2025-01-10 01:14:54,653 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 72 selfloop transitions, 9 changer transitions 0/87 dead transitions. [2025-01-10 01:14:54,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 693 flow [2025-01-10 01:14:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2025-01-10 01:14:54,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4875 [2025-01-10 01:14:54,656 INFO L175 Difference]: Start difference. First operand has 73 places, 81 transitions, 508 flow. Second operand 5 states and 156 transitions. [2025-01-10 01:14:54,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 693 flow [2025-01-10 01:14:54,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 87 transitions, 675 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:14:54,664 INFO L231 Difference]: Finished difference. Result has 68 places, 77 transitions, 484 flow [2025-01-10 01:14:54,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=484, PETRI_PLACES=68, PETRI_TRANSITIONS=77} [2025-01-10 01:14:54,665 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2025-01-10 01:14:54,665 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 77 transitions, 484 flow [2025-01-10 01:14:54,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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:14:54,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:54,665 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:54,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:14:54,666 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:54,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:54,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1697302862, now seen corresponding path program 2 times [2025-01-10 01:14:54,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:54,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425307027] [2025-01-10 01:14:54,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:54,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:54,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:14:54,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 15 statements. [2025-01-10 01:14:54,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:54,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:14:54,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:54,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425307027] [2025-01-10 01:14:54,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425307027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:54,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:54,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:14:54,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797523476] [2025-01-10 01:14:54,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:54,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:14:54,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:54,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:14:54,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:14:54,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-01-10 01:14:54,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 77 transitions, 484 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 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:14:54,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:54,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-01-10 01:14:54,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:55,136 INFO L124 PetriNetUnfolderBase]: 1391/2373 cut-off events. [2025-01-10 01:14:55,137 INFO L125 PetriNetUnfolderBase]: For 2630/2630 co-relation queries the response was YES. [2025-01-10 01:14:55,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6982 conditions, 2373 events. 1391/2373 cut-off events. For 2630/2630 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12825 event pairs, 360 based on Foata normal form. 16/2340 useless extension candidates. Maximal degree in co-relation 4356. Up to 1264 conditions per place. [2025-01-10 01:14:55,147 INFO L140 encePairwiseOnDemand]: 47/64 looper letters, 41 selfloop transitions, 36 changer transitions 0/83 dead transitions. [2025-01-10 01:14:55,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 667 flow [2025-01-10 01:14:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2025-01-10 01:14:55,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-01-10 01:14:55,148 INFO L175 Difference]: Start difference. First operand has 68 places, 77 transitions, 484 flow. Second operand 5 states and 152 transitions. [2025-01-10 01:14:55,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 667 flow [2025-01-10 01:14:55,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 649 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:55,155 INFO L231 Difference]: Finished difference. Result has 63 places, 72 transitions, 508 flow [2025-01-10 01:14:55,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=508, PETRI_PLACES=63, PETRI_TRANSITIONS=72} [2025-01-10 01:14:55,156 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2025-01-10 01:14:55,156 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 72 transitions, 508 flow [2025-01-10 01:14:55,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 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:14:55,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:55,157 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] [2025-01-10 01:14:55,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:14:55,158 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:55,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:55,158 INFO L85 PathProgramCache]: Analyzing trace with hash 622051787, now seen corresponding path program 1 times [2025-01-10 01:14:55,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:55,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128207257] [2025-01-10 01:14:55,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:55,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:55,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:14:55,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:14:55,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:55,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:55,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:55,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:55,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128207257] [2025-01-10 01:14:55,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128207257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:55,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:55,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:14:55,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521559653] [2025-01-10 01:14:55,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:55,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:14:55,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:55,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:14:55,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:14:55,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 64 [2025-01-10 01:14:55,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 72 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:14:55,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:55,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 64 [2025-01-10 01:14:55,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:55,363 INFO L124 PetriNetUnfolderBase]: 1437/2405 cut-off events. [2025-01-10 01:14:55,363 INFO L125 PetriNetUnfolderBase]: For 3344/3344 co-relation queries the response was YES. [2025-01-10 01:14:55,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7524 conditions, 2405 events. 1437/2405 cut-off events. For 3344/3344 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 12735 event pairs, 342 based on Foata normal form. 2/2363 useless extension candidates. Maximal degree in co-relation 4756. Up to 1817 conditions per place. [2025-01-10 01:14:55,372 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 73 selfloop transitions, 13 changer transitions 1/93 dead transitions. [2025-01-10 01:14:55,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 93 transitions, 789 flow [2025-01-10 01:14:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:14:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:14:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2025-01-10 01:14:55,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7604166666666666 [2025-01-10 01:14:55,373 INFO L175 Difference]: Start difference. First operand has 63 places, 72 transitions, 508 flow. Second operand 3 states and 146 transitions. [2025-01-10 01:14:55,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 93 transitions, 789 flow [2025-01-10 01:14:55,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 93 transitions, 699 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:14:55,381 INFO L231 Difference]: Finished difference. Result has 62 places, 78 transitions, 533 flow [2025-01-10 01:14:55,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=62, PETRI_TRANSITIONS=78} [2025-01-10 01:14:55,381 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2025-01-10 01:14:55,381 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 533 flow [2025-01-10 01:14:55,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:14:55,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:55,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:55,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:14:55,382 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:55,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:55,382 INFO L85 PathProgramCache]: Analyzing trace with hash -996488419, now seen corresponding path program 1 times [2025-01-10 01:14:55,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:55,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472282157] [2025-01-10 01:14:55,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:55,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:14:55,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:14:55,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:55,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:55,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472282157] [2025-01-10 01:14:55,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472282157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:55,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:55,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:55,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486120944] [2025-01-10 01:14:55,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:55,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:55,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:55,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:55,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:55,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 64 [2025-01-10 01:14:55,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 533 flow. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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:14:55,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:55,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 64 [2025-01-10 01:14:55,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:55,773 INFO L124 PetriNetUnfolderBase]: 1649/2693 cut-off events. [2025-01-10 01:14:55,774 INFO L125 PetriNetUnfolderBase]: For 3548/3548 co-relation queries the response was YES. [2025-01-10 01:14:55,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8235 conditions, 2693 events. 1649/2693 cut-off events. For 3548/3548 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14598 event pairs, 578 based on Foata normal form. 18/2709 useless extension candidates. Maximal degree in co-relation 5304. Up to 1498 conditions per place. [2025-01-10 01:14:55,784 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 163 selfloop transitions, 9 changer transitions 0/174 dead transitions. [2025-01-10 01:14:55,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 174 transitions, 1470 flow [2025-01-10 01:14:55,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2025-01-10 01:14:55,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.709375 [2025-01-10 01:14:55,785 INFO L175 Difference]: Start difference. First operand has 62 places, 78 transitions, 533 flow. Second operand 5 states and 227 transitions. [2025-01-10 01:14:55,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 174 transitions, 1470 flow [2025-01-10 01:14:55,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 174 transitions, 1411 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:55,792 INFO L231 Difference]: Finished difference. Result has 68 places, 82 transitions, 583 flow [2025-01-10 01:14:55,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=583, PETRI_PLACES=68, PETRI_TRANSITIONS=82} [2025-01-10 01:14:55,793 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2025-01-10 01:14:55,793 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 82 transitions, 583 flow [2025-01-10 01:14:55,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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:14:55,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:55,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:55,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:14:55,793 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:55,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1686468431, now seen corresponding path program 2 times [2025-01-10 01:14:55,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:55,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229213123] [2025-01-10 01:14:55,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:55,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:55,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:14:55,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-01-10 01:14:55,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:55,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:55,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:55,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229213123] [2025-01-10 01:14:55,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229213123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:55,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:55,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:55,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843186506] [2025-01-10 01:14:55,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:55,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:55,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:55,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:55,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:55,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:14:55,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 82 transitions, 583 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:14:55,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:55,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:14:55,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:56,182 INFO L124 PetriNetUnfolderBase]: 1251/2047 cut-off events. [2025-01-10 01:14:56,182 INFO L125 PetriNetUnfolderBase]: For 3458/3458 co-relation queries the response was YES. [2025-01-10 01:14:56,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6769 conditions, 2047 events. 1251/2047 cut-off events. For 3458/3458 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9703 event pairs, 708 based on Foata normal form. 32/2079 useless extension candidates. Maximal degree in co-relation 4090. Up to 1718 conditions per place. [2025-01-10 01:14:56,187 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 82 selfloop transitions, 12 changer transitions 0/95 dead transitions. [2025-01-10 01:14:56,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 95 transitions, 801 flow [2025-01-10 01:14:56,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:14:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:14:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2025-01-10 01:14:56,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6171875 [2025-01-10 01:14:56,188 INFO L175 Difference]: Start difference. First operand has 68 places, 82 transitions, 583 flow. Second operand 4 states and 158 transitions. [2025-01-10 01:14:56,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 95 transitions, 801 flow [2025-01-10 01:14:56,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 95 transitions, 766 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:56,193 INFO L231 Difference]: Finished difference. Result has 71 places, 71 transitions, 477 flow [2025-01-10 01:14:56,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=477, PETRI_PLACES=71, PETRI_TRANSITIONS=71} [2025-01-10 01:14:56,193 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places. [2025-01-10 01:14:56,193 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 71 transitions, 477 flow [2025-01-10 01:14:56,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:14:56,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:56,194 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:56,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:14:56,194 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:56,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:56,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1413086904, now seen corresponding path program 1 times [2025-01-10 01:14:56,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:56,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310775888] [2025-01-10 01:14:56,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:56,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:56,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:14:56,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:14:56,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:56,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:56,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:56,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310775888] [2025-01-10 01:14:56,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310775888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:56,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:56,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:14:56,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069291308] [2025-01-10 01:14:56,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:56,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:14:56,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:56,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:14:56,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:14:56,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:14:56,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 477 flow. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 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:14:56,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:56,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:14:56,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:56,551 INFO L124 PetriNetUnfolderBase]: 1483/2447 cut-off events. [2025-01-10 01:14:56,552 INFO L125 PetriNetUnfolderBase]: For 4264/4264 co-relation queries the response was YES. [2025-01-10 01:14:56,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8326 conditions, 2447 events. 1483/2447 cut-off events. For 4264/4264 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12961 event pairs, 436 based on Foata normal form. 40/2487 useless extension candidates. Maximal degree in co-relation 5088. Up to 1198 conditions per place. [2025-01-10 01:14:56,562 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 135 selfloop transitions, 20 changer transitions 0/156 dead transitions. [2025-01-10 01:14:56,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 156 transitions, 1277 flow [2025-01-10 01:14:56,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:14:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:14:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 254 transitions. [2025-01-10 01:14:56,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6614583333333334 [2025-01-10 01:14:56,563 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 477 flow. Second operand 6 states and 254 transitions. [2025-01-10 01:14:56,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 156 transitions, 1277 flow [2025-01-10 01:14:56,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 156 transitions, 1234 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:56,574 INFO L231 Difference]: Finished difference. Result has 78 places, 83 transitions, 668 flow [2025-01-10 01:14:56,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=668, PETRI_PLACES=78, PETRI_TRANSITIONS=83} [2025-01-10 01:14:56,575 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 17 predicate places. [2025-01-10 01:14:56,575 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 83 transitions, 668 flow [2025-01-10 01:14:56,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 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:14:56,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:56,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:56,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:14:56,575 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:56,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1085489034, now seen corresponding path program 2 times [2025-01-10 01:14:56,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:56,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861836038] [2025-01-10 01:14:56,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:56,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:56,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:14:56,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-01-10 01:14:56,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:56,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:56,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:56,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861836038] [2025-01-10 01:14:56,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861836038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:56,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:56,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:56,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521458157] [2025-01-10 01:14:56,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:56,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:56,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:56,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:56,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:56,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:14:56,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 83 transitions, 668 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:14:56,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:56,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:14:56,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:56,885 INFO L124 PetriNetUnfolderBase]: 1515/2511 cut-off events. [2025-01-10 01:14:56,885 INFO L125 PetriNetUnfolderBase]: For 6342/6342 co-relation queries the response was YES. [2025-01-10 01:14:56,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9248 conditions, 2511 events. 1515/2511 cut-off events. For 6342/6342 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 12728 event pairs, 734 based on Foata normal form. 46/2557 useless extension candidates. Maximal degree in co-relation 6524. Up to 1818 conditions per place. [2025-01-10 01:14:56,893 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 99 selfloop transitions, 22 changer transitions 0/122 dead transitions. [2025-01-10 01:14:56,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 122 transitions, 1186 flow [2025-01-10 01:14:56,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2025-01-10 01:14:56,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.596875 [2025-01-10 01:14:56,894 INFO L175 Difference]: Start difference. First operand has 78 places, 83 transitions, 668 flow. Second operand 5 states and 191 transitions. [2025-01-10 01:14:56,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 122 transitions, 1186 flow [2025-01-10 01:14:56,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 122 transitions, 1154 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:56,904 INFO L231 Difference]: Finished difference. Result has 83 places, 85 transitions, 733 flow [2025-01-10 01:14:56,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=733, PETRI_PLACES=83, PETRI_TRANSITIONS=85} [2025-01-10 01:14:56,905 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 22 predicate places. [2025-01-10 01:14:56,905 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 85 transitions, 733 flow [2025-01-10 01:14:56,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:14:56,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:56,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:56,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:14:56,905 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:56,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:56,906 INFO L85 PathProgramCache]: Analyzing trace with hash 453348861, now seen corresponding path program 1 times [2025-01-10 01:14:56,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:56,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100085090] [2025-01-10 01:14:56,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:56,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:56,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:14:56,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:56,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:56,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:57,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:57,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100085090] [2025-01-10 01:14:57,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100085090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:57,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:57,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:14:57,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226592791] [2025-01-10 01:14:57,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:57,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:14:57,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:57,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:14:57,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:14:57,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:14:57,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 85 transitions, 733 flow. Second operand has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 states have internal predecessors, (178), 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:14:57,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:57,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:14:57,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:57,351 INFO L124 PetriNetUnfolderBase]: 1991/3303 cut-off events. [2025-01-10 01:14:57,352 INFO L125 PetriNetUnfolderBase]: For 9346/9346 co-relation queries the response was YES. [2025-01-10 01:14:57,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12274 conditions, 3303 events. 1991/3303 cut-off events. For 9346/9346 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 17214 event pairs, 720 based on Foata normal form. 40/3343 useless extension candidates. Maximal degree in co-relation 10687. Up to 1700 conditions per place. [2025-01-10 01:14:57,364 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 134 selfloop transitions, 26 changer transitions 0/161 dead transitions. [2025-01-10 01:14:57,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 161 transitions, 1539 flow [2025-01-10 01:14:57,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:57,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 271 transitions. [2025-01-10 01:14:57,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6049107142857143 [2025-01-10 01:14:57,365 INFO L175 Difference]: Start difference. First operand has 83 places, 85 transitions, 733 flow. Second operand 7 states and 271 transitions. [2025-01-10 01:14:57,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 161 transitions, 1539 flow [2025-01-10 01:14:57,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 161 transitions, 1501 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:57,381 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 891 flow [2025-01-10 01:14:57,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=891, PETRI_PLACES=90, PETRI_TRANSITIONS=93} [2025-01-10 01:14:57,382 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 29 predicate places. [2025-01-10 01:14:57,382 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 891 flow [2025-01-10 01:14:57,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 states have internal predecessors, (178), 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:14:57,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:57,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:57,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:14:57,382 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:57,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:57,383 INFO L85 PathProgramCache]: Analyzing trace with hash 836361157, now seen corresponding path program 2 times [2025-01-10 01:14:57,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:57,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165260087] [2025-01-10 01:14:57,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:57,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:57,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:57,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-01-10 01:14:57,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:57,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:57,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:57,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165260087] [2025-01-10 01:14:57,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165260087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:57,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:57,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:57,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980835706] [2025-01-10 01:14:57,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:57,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:57,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:57,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:57,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:14:57,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 891 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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:14:57,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:57,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:14:57,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:57,852 INFO L124 PetriNetUnfolderBase]: 1949/3201 cut-off events. [2025-01-10 01:14:57,852 INFO L125 PetriNetUnfolderBase]: For 11931/11931 co-relation queries the response was YES. [2025-01-10 01:14:57,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12737 conditions, 3201 events. 1949/3201 cut-off events. For 11931/11931 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 16854 event pairs, 724 based on Foata normal form. 6/3207 useless extension candidates. Maximal degree in co-relation 11463. Up to 1612 conditions per place. [2025-01-10 01:14:57,864 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 120 selfloop transitions, 28 changer transitions 0/149 dead transitions. [2025-01-10 01:14:57,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 149 transitions, 1547 flow [2025-01-10 01:14:57,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2025-01-10 01:14:57,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.659375 [2025-01-10 01:14:57,865 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 891 flow. Second operand 5 states and 211 transitions. [2025-01-10 01:14:57,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 149 transitions, 1547 flow [2025-01-10 01:14:57,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 149 transitions, 1497 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:57,886 INFO L231 Difference]: Finished difference. Result has 93 places, 96 transitions, 983 flow [2025-01-10 01:14:57,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=983, PETRI_PLACES=93, PETRI_TRANSITIONS=96} [2025-01-10 01:14:57,887 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 32 predicate places. [2025-01-10 01:14:57,888 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 96 transitions, 983 flow [2025-01-10 01:14:57,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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:14:57,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:57,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:57,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:14:57,888 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:57,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:57,889 INFO L85 PathProgramCache]: Analyzing trace with hash 317804581, now seen corresponding path program 3 times [2025-01-10 01:14:57,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:57,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605201677] [2025-01-10 01:14:57,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:14:57,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:57,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:57,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-01-10 01:14:57,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:14:57,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:57,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:57,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605201677] [2025-01-10 01:14:57,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605201677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:57,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:57,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:57,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467815631] [2025-01-10 01:14:57,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:57,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:57,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:57,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:57,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:58,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:14:58,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 96 transitions, 983 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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:14:58,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:58,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:14:58,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:58,260 INFO L124 PetriNetUnfolderBase]: 1943/3195 cut-off events. [2025-01-10 01:14:58,260 INFO L125 PetriNetUnfolderBase]: For 14835/14835 co-relation queries the response was YES. [2025-01-10 01:14:58,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13143 conditions, 3195 events. 1943/3195 cut-off events. For 14835/14835 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 16339 event pairs, 1094 based on Foata normal form. 6/3201 useless extension candidates. Maximal degree in co-relation 11952. Up to 2742 conditions per place. [2025-01-10 01:14:58,275 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 90 selfloop transitions, 35 changer transitions 0/126 dead transitions. [2025-01-10 01:14:58,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 126 transitions, 1506 flow [2025-01-10 01:14:58,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-01-10 01:14:58,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.603125 [2025-01-10 01:14:58,277 INFO L175 Difference]: Start difference. First operand has 93 places, 96 transitions, 983 flow. Second operand 5 states and 193 transitions. [2025-01-10 01:14:58,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 126 transitions, 1506 flow [2025-01-10 01:14:58,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 126 transitions, 1450 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:58,295 INFO L231 Difference]: Finished difference. Result has 98 places, 108 transitions, 1245 flow [2025-01-10 01:14:58,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1245, PETRI_PLACES=98, PETRI_TRANSITIONS=108} [2025-01-10 01:14:58,296 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 37 predicate places. [2025-01-10 01:14:58,296 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 1245 flow [2025-01-10 01:14:58,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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:14:58,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:58,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:58,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:14:58,296 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:58,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:58,297 INFO L85 PathProgramCache]: Analyzing trace with hash 387660017, now seen corresponding path program 4 times [2025-01-10 01:14:58,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:58,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081821218] [2025-01-10 01:14:58,297 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:14:58,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:58,302 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:14:58,316 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:14:58,316 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:14:58,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:58,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:58,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081821218] [2025-01-10 01:14:58,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081821218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:58,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:58,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:14:58,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176911888] [2025-01-10 01:14:58,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:58,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:14:58,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:58,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:14:58,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:14:58,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:14:58,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 108 transitions, 1245 flow. Second operand has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 7 states have internal predecessors, (204), 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:14:58,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:58,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:14:58,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:58,858 INFO L124 PetriNetUnfolderBase]: 1987/3347 cut-off events. [2025-01-10 01:14:58,858 INFO L125 PetriNetUnfolderBase]: For 16437/16437 co-relation queries the response was YES. [2025-01-10 01:14:58,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13910 conditions, 3347 events. 1987/3347 cut-off events. For 16437/16437 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17803 event pairs, 820 based on Foata normal form. 48/3395 useless extension candidates. Maximal degree in co-relation 12680. Up to 1944 conditions per place. [2025-01-10 01:14:58,871 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 149 selfloop transitions, 36 changer transitions 0/186 dead transitions. [2025-01-10 01:14:58,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 186 transitions, 2223 flow [2025-01-10 01:14:58,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:14:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:14:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 264 transitions. [2025-01-10 01:14:58,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-01-10 01:14:58,873 INFO L175 Difference]: Start difference. First operand has 98 places, 108 transitions, 1245 flow. Second operand 7 states and 264 transitions. [2025-01-10 01:14:58,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 186 transitions, 2223 flow [2025-01-10 01:14:58,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 186 transitions, 2153 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-01-10 01:14:58,896 INFO L231 Difference]: Finished difference. Result has 106 places, 114 transitions, 1333 flow [2025-01-10 01:14:58,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1333, PETRI_PLACES=106, PETRI_TRANSITIONS=114} [2025-01-10 01:14:58,897 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 45 predicate places. [2025-01-10 01:14:58,897 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 114 transitions, 1333 flow [2025-01-10 01:14:58,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 7 states have internal predecessors, (204), 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:14:58,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:58,897 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] [2025-01-10 01:14:58,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:14:58,897 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:58,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:58,898 INFO L85 PathProgramCache]: Analyzing trace with hash -624876930, now seen corresponding path program 1 times [2025-01-10 01:14:58,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:58,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511341177] [2025-01-10 01:14:58,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:58,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:58,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:14:58,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:14:58,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:58,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:58,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:58,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511341177] [2025-01-10 01:14:58,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511341177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:58,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:58,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:14:58,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117619510] [2025-01-10 01:14:58,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:58,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:14:58,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:58,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:14:58,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:14:58,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:14:58,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 114 transitions, 1333 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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:14:58,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:58,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:14:58,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:59,255 INFO L124 PetriNetUnfolderBase]: 1971/3319 cut-off events. [2025-01-10 01:14:59,255 INFO L125 PetriNetUnfolderBase]: For 16247/16247 co-relation queries the response was YES. [2025-01-10 01:14:59,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14019 conditions, 3319 events. 1971/3319 cut-off events. For 16247/16247 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17647 event pairs, 1186 based on Foata normal form. 8/3327 useless extension candidates. Maximal degree in co-relation 12730. Up to 2884 conditions per place. [2025-01-10 01:14:59,267 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 96 selfloop transitions, 35 changer transitions 0/132 dead transitions. [2025-01-10 01:14:59,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 132 transitions, 1676 flow [2025-01-10 01:14:59,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:14:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:14:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-01-10 01:14:59,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.603125 [2025-01-10 01:14:59,268 INFO L175 Difference]: Start difference. First operand has 106 places, 114 transitions, 1333 flow. Second operand 5 states and 193 transitions. [2025-01-10 01:14:59,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 132 transitions, 1676 flow [2025-01-10 01:14:59,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 132 transitions, 1626 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:59,292 INFO L231 Difference]: Finished difference. Result has 109 places, 115 transitions, 1388 flow [2025-01-10 01:14:59,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1245, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1388, PETRI_PLACES=109, PETRI_TRANSITIONS=115} [2025-01-10 01:14:59,294 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 48 predicate places. [2025-01-10 01:14:59,294 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 115 transitions, 1388 flow [2025-01-10 01:14:59,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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:14:59,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:59,294 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] [2025-01-10 01:14:59,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 01:14:59,295 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:59,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:59,295 INFO L85 PathProgramCache]: Analyzing trace with hash 126897246, now seen corresponding path program 2 times [2025-01-10 01:14:59,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:59,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692966597] [2025-01-10 01:14:59,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:14:59,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:59,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:14:59,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 24 statements. [2025-01-10 01:14:59,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:14:59,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:14:59,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:59,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692966597] [2025-01-10 01:14:59,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692966597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:59,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:59,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:14:59,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415975278] [2025-01-10 01:14:59,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:59,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:14:59,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:59,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:14:59,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:14:59,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:14:59,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 115 transitions, 1388 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:59,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:59,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:14:59,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:59,725 INFO L124 PetriNetUnfolderBase]: 1903/3179 cut-off events. [2025-01-10 01:14:59,726 INFO L125 PetriNetUnfolderBase]: For 16535/16535 co-relation queries the response was YES. [2025-01-10 01:14:59,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13468 conditions, 3179 events. 1903/3179 cut-off events. For 16535/16535 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 16517 event pairs, 1042 based on Foata normal form. 40/3219 useless extension candidates. Maximal degree in co-relation 12185. Up to 2588 conditions per place. [2025-01-10 01:14:59,736 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 112 selfloop transitions, 37 changer transitions 0/150 dead transitions. [2025-01-10 01:14:59,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 150 transitions, 1884 flow [2025-01-10 01:14:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:14:59,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:14:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 230 transitions. [2025-01-10 01:14:59,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2025-01-10 01:14:59,737 INFO L175 Difference]: Start difference. First operand has 109 places, 115 transitions, 1388 flow. Second operand 6 states and 230 transitions. [2025-01-10 01:14:59,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 150 transitions, 1884 flow [2025-01-10 01:14:59,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 150 transitions, 1820 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-01-10 01:14:59,762 INFO L231 Difference]: Finished difference. Result has 113 places, 117 transitions, 1434 flow [2025-01-10 01:14:59,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1434, PETRI_PLACES=113, PETRI_TRANSITIONS=117} [2025-01-10 01:14:59,763 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 52 predicate places. [2025-01-10 01:14:59,763 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 117 transitions, 1434 flow [2025-01-10 01:14:59,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:14:59,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:59,763 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] [2025-01-10 01:14:59,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 01:14:59,763 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:14:59,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:59,763 INFO L85 PathProgramCache]: Analyzing trace with hash -943080445, now seen corresponding path program 1 times [2025-01-10 01:14:59,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:59,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570110752] [2025-01-10 01:14:59,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:14:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:59,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:14:59,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:14:59,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:14:59,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:15:00,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:00,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570110752] [2025-01-10 01:15:00,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570110752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:00,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:00,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:15:00,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345833868] [2025-01-10 01:15:00,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:00,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:15:00,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:00,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:15:00,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:15:00,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:15:00,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 117 transitions, 1434 flow. Second operand has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 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:15:00,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:00,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:15:00,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:00,964 INFO L124 PetriNetUnfolderBase]: 3241/5485 cut-off events. [2025-01-10 01:15:00,964 INFO L125 PetriNetUnfolderBase]: For 23901/23901 co-relation queries the response was YES. [2025-01-10 01:15:00,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22630 conditions, 5485 events. 3241/5485 cut-off events. For 23901/23901 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 33426 event pairs, 844 based on Foata normal form. 116/5601 useless extension candidates. Maximal degree in co-relation 20812. Up to 1684 conditions per place. [2025-01-10 01:15:00,987 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 318 selfloop transitions, 66 changer transitions 0/385 dead transitions. [2025-01-10 01:15:00,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 385 transitions, 4332 flow [2025-01-10 01:15:00,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:15:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:15:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 529 transitions. [2025-01-10 01:15:00,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6358173076923077 [2025-01-10 01:15:00,992 INFO L175 Difference]: Start difference. First operand has 113 places, 117 transitions, 1434 flow. Second operand 13 states and 529 transitions. [2025-01-10 01:15:00,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 385 transitions, 4332 flow [2025-01-10 01:15:01,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 385 transitions, 4204 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:01,043 INFO L231 Difference]: Finished difference. Result has 132 places, 159 transitions, 2174 flow [2025-01-10 01:15:01,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2174, PETRI_PLACES=132, PETRI_TRANSITIONS=159} [2025-01-10 01:15:01,043 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 71 predicate places. [2025-01-10 01:15:01,043 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 159 transitions, 2174 flow [2025-01-10 01:15:01,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 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:15:01,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:01,044 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] [2025-01-10 01:15:01,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 01:15:01,044 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:15:01,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:01,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1475549575, now seen corresponding path program 2 times [2025-01-10 01:15:01,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:01,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101428370] [2025-01-10 01:15:01,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:15:01,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:01,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:15:01,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 26 statements. [2025-01-10 01:15:01,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:15:01,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:01,223 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:15:01,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:01,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101428370] [2025-01-10 01:15:01,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101428370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:01,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:01,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:15:01,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517677773] [2025-01-10 01:15:01,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:01,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:15:01,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:01,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:15:01,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:15:01,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:15:01,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 159 transitions, 2174 flow. Second operand has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 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:15:01,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:01,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:15:01,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:01,890 INFO L124 PetriNetUnfolderBase]: 3055/5137 cut-off events. [2025-01-10 01:15:01,890 INFO L125 PetriNetUnfolderBase]: For 36121/36121 co-relation queries the response was YES. [2025-01-10 01:15:01,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25054 conditions, 5137 events. 3055/5137 cut-off events. For 36121/36121 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 29713 event pairs, 1209 based on Foata normal form. 90/5227 useless extension candidates. Maximal degree in co-relation 23430. Up to 2888 conditions per place. [2025-01-10 01:15:01,918 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 245 selfloop transitions, 71 changer transitions 0/317 dead transitions. [2025-01-10 01:15:01,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 317 transitions, 4541 flow [2025-01-10 01:15:01,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:15:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:15:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 325 transitions. [2025-01-10 01:15:01,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5642361111111112 [2025-01-10 01:15:01,920 INFO L175 Difference]: Start difference. First operand has 132 places, 159 transitions, 2174 flow. Second operand 9 states and 325 transitions. [2025-01-10 01:15:01,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 317 transitions, 4541 flow [2025-01-10 01:15:01,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 317 transitions, 4397 flow, removed 72 selfloop flow, removed 0 redundant places. [2025-01-10 01:15:01,980 INFO L231 Difference]: Finished difference. Result has 144 places, 180 transitions, 2621 flow [2025-01-10 01:15:01,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2621, PETRI_PLACES=144, PETRI_TRANSITIONS=180} [2025-01-10 01:15:01,980 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 83 predicate places. [2025-01-10 01:15:01,981 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 180 transitions, 2621 flow [2025-01-10 01:15:01,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 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:15:01,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:01,981 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] [2025-01-10 01:15:01,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 01:15:01,981 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:15:01,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:01,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1171987033, now seen corresponding path program 1 times [2025-01-10 01:15:01,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:01,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129364684] [2025-01-10 01:15:01,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:01,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:01,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:15:01,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:15:01,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:01,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:15:02,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:02,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129364684] [2025-01-10 01:15:02,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129364684] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:02,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:02,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 01:15:02,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942198455] [2025-01-10 01:15:02,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:02,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:15:02,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:02,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:15:02,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:15:02,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:15:02,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 180 transitions, 2621 flow. Second operand has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 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:15:02,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:02,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:15:02,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:02,821 INFO L124 PetriNetUnfolderBase]: 3128/5277 cut-off events. [2025-01-10 01:15:02,821 INFO L125 PetriNetUnfolderBase]: For 41775/41775 co-relation queries the response was YES. [2025-01-10 01:15:02,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26997 conditions, 5277 events. 3128/5277 cut-off events. For 41775/41775 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 31007 event pairs, 1682 based on Foata normal form. 6/5283 useless extension candidates. Maximal degree in co-relation 25253. Up to 4166 conditions per place. [2025-01-10 01:15:02,850 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 199 selfloop transitions, 56 changer transitions 0/256 dead transitions. [2025-01-10 01:15:02,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 256 transitions, 3794 flow [2025-01-10 01:15:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:15:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:15:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 368 transitions. [2025-01-10 01:15:02,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-01-10 01:15:02,851 INFO L175 Difference]: Start difference. First operand has 144 places, 180 transitions, 2621 flow. Second operand 11 states and 368 transitions. [2025-01-10 01:15:02,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 256 transitions, 3794 flow [2025-01-10 01:15:02,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 256 transitions, 3685 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-01-10 01:15:02,926 INFO L231 Difference]: Finished difference. Result has 156 places, 193 transitions, 2816 flow [2025-01-10 01:15:02,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=2512, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2816, PETRI_PLACES=156, PETRI_TRANSITIONS=193} [2025-01-10 01:15:02,927 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 95 predicate places. [2025-01-10 01:15:02,927 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 193 transitions, 2816 flow [2025-01-10 01:15:02,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 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:15:02,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:02,927 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] [2025-01-10 01:15:02,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 01:15:02,927 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:15:02,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1384608953, now seen corresponding path program 1 times [2025-01-10 01:15:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:02,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544335932] [2025-01-10 01:15:02,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:02,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:02,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:15:02,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:15:02,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:02,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:15:03,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:03,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544335932] [2025-01-10 01:15:03,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544335932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:03,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:03,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:15:03,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567656417] [2025-01-10 01:15:03,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:03,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:15:03,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:03,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:15:03,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:15:03,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 64 [2025-01-10 01:15:03,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 193 transitions, 2816 flow. Second operand has 9 states, 9 states have (on average 29.88888888888889) internal successors, (269), 9 states have internal predecessors, (269), 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:15:03,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:03,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 64 [2025-01-10 01:15:03,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:04,182 INFO L124 PetriNetUnfolderBase]: 3240/5569 cut-off events. [2025-01-10 01:15:04,182 INFO L125 PetriNetUnfolderBase]: For 43497/43505 co-relation queries the response was YES. [2025-01-10 01:15:04,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28835 conditions, 5569 events. 3240/5569 cut-off events. For 43497/43505 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 34761 event pairs, 846 based on Foata normal form. 20/5589 useless extension candidates. Maximal degree in co-relation 27117. Up to 1806 conditions per place. [2025-01-10 01:15:04,218 INFO L140 encePairwiseOnDemand]: 49/64 looper letters, 364 selfloop transitions, 89 changer transitions 0/455 dead transitions. [2025-01-10 01:15:04,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 455 transitions, 5706 flow [2025-01-10 01:15:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:15:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:15:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 568 transitions. [2025-01-10 01:15:04,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6339285714285714 [2025-01-10 01:15:04,220 INFO L175 Difference]: Start difference. First operand has 156 places, 193 transitions, 2816 flow. Second operand 14 states and 568 transitions. [2025-01-10 01:15:04,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 455 transitions, 5706 flow [2025-01-10 01:15:04,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 455 transitions, 5676 flow, removed 15 selfloop flow, removed 0 redundant places. [2025-01-10 01:15:04,324 INFO L231 Difference]: Finished difference. Result has 179 places, 226 transitions, 3481 flow [2025-01-10 01:15:04,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=2786, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3481, PETRI_PLACES=179, PETRI_TRANSITIONS=226} [2025-01-10 01:15:04,325 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 118 predicate places. [2025-01-10 01:15:04,325 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 226 transitions, 3481 flow [2025-01-10 01:15:04,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.88888888888889) internal successors, (269), 9 states have internal predecessors, (269), 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:15:04,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:04,325 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] [2025-01-10 01:15:04,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 01:15:04,325 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:15:04,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:04,326 INFO L85 PathProgramCache]: Analyzing trace with hash 658571989, now seen corresponding path program 2 times [2025-01-10 01:15:04,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:04,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808035020] [2025-01-10 01:15:04,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:15:04,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:04,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-10 01:15:04,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:15:04,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:15:04,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:15:04,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:04,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808035020] [2025-01-10 01:15:04,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808035020] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:15:04,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071269444] [2025-01-10 01:15:04,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:15:04,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:04,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:04,461 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:15:04,465 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:15:04,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-10 01:15:04,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:15:04,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:15:04,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:04,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 01:15:04,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:04,554 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 19 treesize of output 1 [2025-01-10 01:15:04,788 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:15:04,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:05,390 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 140 treesize of output 124 [2025-01-10 01:15:05,481 INFO L349 Elim1Store]: treesize reduction 5, result has 94.8 percent of original size [2025-01-10 01:15:05,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 282 treesize of output 285 [2025-01-10 01:15:39,012 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:15:39,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071269444] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:39,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:15:39,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 26 [2025-01-10 01:15:39,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158761621] [2025-01-10 01:15:39,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:39,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:15:39,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:39,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:15:39,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:15:40,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:15:40,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 226 transitions, 3481 flow. Second operand has 26 states, 26 states have (on average 29.0) internal successors, (754), 26 states have internal predecessors, (754), 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:15:40,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:40,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:15:40,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:43,890 INFO L124 PetriNetUnfolderBase]: 4333/7392 cut-off events. [2025-01-10 01:15:43,891 INFO L125 PetriNetUnfolderBase]: For 69931/69931 co-relation queries the response was YES. [2025-01-10 01:15:43,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40730 conditions, 7392 events. 4333/7392 cut-off events. For 69931/69931 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 45529 event pairs, 470 based on Foata normal form. 26/7418 useless extension candidates. Maximal degree in co-relation 39287. Up to 1297 conditions per place. [2025-01-10 01:15:43,950 INFO L140 encePairwiseOnDemand]: 41/64 looper letters, 320 selfloop transitions, 162 changer transitions 323/806 dead transitions. [2025-01-10 01:15:43,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 806 transitions, 10240 flow [2025-01-10 01:15:43,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-01-10 01:15:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2025-01-10 01:15:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 1977 transitions. [2025-01-10 01:15:43,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5720486111111112 [2025-01-10 01:15:43,956 INFO L175 Difference]: Start difference. First operand has 179 places, 226 transitions, 3481 flow. Second operand 54 states and 1977 transitions. [2025-01-10 01:15:43,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 806 transitions, 10240 flow [2025-01-10 01:15:44,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 806 transitions, 10029 flow, removed 77 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:44,178 INFO L231 Difference]: Finished difference. Result has 248 places, 256 transitions, 3927 flow [2025-01-10 01:15:44,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=3334, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=3927, PETRI_PLACES=248, PETRI_TRANSITIONS=256} [2025-01-10 01:15:44,180 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 187 predicate places. [2025-01-10 01:15:44,180 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 256 transitions, 3927 flow [2025-01-10 01:15:44,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 29.0) internal successors, (754), 26 states have internal predecessors, (754), 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:15:44,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:44,181 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] [2025-01-10 01:15:44,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:15:44,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-10 01:15:44,382 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:15:44,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:44,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1774598247, now seen corresponding path program 3 times [2025-01-10 01:15:44,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:44,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700265486] [2025-01-10 01:15:44,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:15:44,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:44,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-01-10 01:15:44,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 29 statements. [2025-01-10 01:15:44,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:15:44,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:44,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:44,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700265486] [2025-01-10 01:15:44,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700265486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:44,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:44,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:15:44,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265678569] [2025-01-10 01:15:44,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:44,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:15:44,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:44,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:15:44,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:15:44,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:15:44,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 256 transitions, 3927 flow. Second operand has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:44,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:44,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:15:44,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:45,347 INFO L124 PetriNetUnfolderBase]: 2692/4657 cut-off events. [2025-01-10 01:15:45,347 INFO L125 PetriNetUnfolderBase]: For 49515/49515 co-relation queries the response was YES. [2025-01-10 01:15:45,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27270 conditions, 4657 events. 2692/4657 cut-off events. For 49515/49515 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 26173 event pairs, 1295 based on Foata normal form. 30/4687 useless extension candidates. Maximal degree in co-relation 27091. Up to 3332 conditions per place. [2025-01-10 01:15:45,382 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 306 selfloop transitions, 62 changer transitions 1/370 dead transitions. [2025-01-10 01:15:45,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 370 transitions, 5880 flow [2025-01-10 01:15:45,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:15:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:15:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 330 transitions. [2025-01-10 01:15:45,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64453125 [2025-01-10 01:15:45,384 INFO L175 Difference]: Start difference. First operand has 248 places, 256 transitions, 3927 flow. Second operand 8 states and 330 transitions. [2025-01-10 01:15:45,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 370 transitions, 5880 flow [2025-01-10 01:15:45,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 370 transitions, 5336 flow, removed 226 selfloop flow, removed 22 redundant places. [2025-01-10 01:15:45,536 INFO L231 Difference]: Finished difference. Result has 218 places, 267 transitions, 3775 flow [2025-01-10 01:15:45,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=3477, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3775, PETRI_PLACES=218, PETRI_TRANSITIONS=267} [2025-01-10 01:15:45,537 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 157 predicate places. [2025-01-10 01:15:45,537 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 267 transitions, 3775 flow [2025-01-10 01:15:45,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:45,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:45,538 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] [2025-01-10 01:15:45,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 01:15:45,538 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:15:45,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:45,538 INFO L85 PathProgramCache]: Analyzing trace with hash 722585171, now seen corresponding path program 2 times [2025-01-10 01:15:45,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:45,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267160296] [2025-01-10 01:15:45,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:15:45,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:45,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-10 01:15:45,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 29 statements. [2025-01-10 01:15:45,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:15:45,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:45,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:45,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267160296] [2025-01-10 01:15:45,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267160296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:45,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:45,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 01:15:45,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102440408] [2025-01-10 01:15:45,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:45,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:15:45,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:45,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:15:45,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:15:45,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:15:45,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 267 transitions, 3775 flow. Second operand has 12 states, 12 states have (on average 28.166666666666668) internal successors, (338), 12 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:45,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:45,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:15:45,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:47,159 INFO L124 PetriNetUnfolderBase]: 2972/5153 cut-off events. [2025-01-10 01:15:47,160 INFO L125 PetriNetUnfolderBase]: For 50245/50245 co-relation queries the response was YES. [2025-01-10 01:15:47,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28713 conditions, 5153 events. 2972/5153 cut-off events. For 50245/50245 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 29732 event pairs, 1535 based on Foata normal form. 12/5165 useless extension candidates. Maximal degree in co-relation 28297. Up to 4037 conditions per place. [2025-01-10 01:15:47,201 INFO L140 encePairwiseOnDemand]: 45/64 looper letters, 301 selfloop transitions, 124 changer transitions 0/426 dead transitions. [2025-01-10 01:15:47,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 426 transitions, 6287 flow [2025-01-10 01:15:47,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 01:15:47,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-01-10 01:15:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 779 transitions. [2025-01-10 01:15:47,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5292119565217391 [2025-01-10 01:15:47,207 INFO L175 Difference]: Start difference. First operand has 218 places, 267 transitions, 3775 flow. Second operand 23 states and 779 transitions. [2025-01-10 01:15:47,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 426 transitions, 6287 flow [2025-01-10 01:15:47,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 426 transitions, 6107 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-01-10 01:15:47,391 INFO L231 Difference]: Finished difference. Result has 243 places, 333 transitions, 5101 flow [2025-01-10 01:15:47,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=3659, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=5101, PETRI_PLACES=243, PETRI_TRANSITIONS=333} [2025-01-10 01:15:47,392 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 182 predicate places. [2025-01-10 01:15:47,392 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 333 transitions, 5101 flow [2025-01-10 01:15:47,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 28.166666666666668) internal successors, (338), 12 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:47,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:47,392 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] [2025-01-10 01:15:47,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 01:15:47,393 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:15:47,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:47,393 INFO L85 PathProgramCache]: Analyzing trace with hash 384891873, now seen corresponding path program 4 times [2025-01-10 01:15:47,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:47,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970232680] [2025-01-10 01:15:47,393 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:15:47,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:47,399 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-01-10 01:15:47,413 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:15:47,413 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:15:47,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:47,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:47,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970232680] [2025-01-10 01:15:47,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970232680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:47,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:47,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:15:47,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298601380] [2025-01-10 01:15:47,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:47,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:15:47,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:47,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:15:47,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:15:47,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 64 [2025-01-10 01:15:47,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 333 transitions, 5101 flow. Second operand has 9 states, 9 states have (on average 30.88888888888889) internal successors, (278), 9 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:47,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:47,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 64 [2025-01-10 01:15:47,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:48,525 INFO L124 PetriNetUnfolderBase]: 2923/5151 cut-off events. [2025-01-10 01:15:48,525 INFO L125 PetriNetUnfolderBase]: For 53674/53681 co-relation queries the response was YES. [2025-01-10 01:15:48,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29512 conditions, 5151 events. 2923/5151 cut-off events. For 53674/53681 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 30723 event pairs, 1369 based on Foata normal form. 3/5136 useless extension candidates. Maximal degree in co-relation 29267. Up to 3684 conditions per place. [2025-01-10 01:15:48,572 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 304 selfloop transitions, 95 changer transitions 4/406 dead transitions. [2025-01-10 01:15:48,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 406 transitions, 6700 flow [2025-01-10 01:15:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:15:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:15:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 398 transitions. [2025-01-10 01:15:48,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5653409090909091 [2025-01-10 01:15:48,574 INFO L175 Difference]: Start difference. First operand has 243 places, 333 transitions, 5101 flow. Second operand 11 states and 398 transitions. [2025-01-10 01:15:48,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 406 transitions, 6700 flow [2025-01-10 01:15:48,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 406 transitions, 6295 flow, removed 154 selfloop flow, removed 7 redundant places. [2025-01-10 01:15:48,805 INFO L231 Difference]: Finished difference. Result has 251 places, 353 transitions, 5348 flow [2025-01-10 01:15:48,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=4700, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5348, PETRI_PLACES=251, PETRI_TRANSITIONS=353} [2025-01-10 01:15:48,806 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 190 predicate places. [2025-01-10 01:15:48,806 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 353 transitions, 5348 flow [2025-01-10 01:15:48,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.88888888888889) internal successors, (278), 9 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:48,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:48,806 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] [2025-01-10 01:15:48,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-10 01:15:48,807 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:15:48,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:48,807 INFO L85 PathProgramCache]: Analyzing trace with hash 991469373, now seen corresponding path program 3 times [2025-01-10 01:15:48,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:48,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99810901] [2025-01-10 01:15:48,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:15:48,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:48,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-01-10 01:15:48,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 29 statements. [2025-01-10 01:15:48,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:15:48,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:49,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:49,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99810901] [2025-01-10 01:15:49,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99810901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:49,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:49,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 01:15:49,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913879159] [2025-01-10 01:15:49,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:49,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:15:49,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:49,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:15:49,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:15:49,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 64 [2025-01-10 01:15:49,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 353 transitions, 5348 flow. Second operand has 13 states, 13 states have (on average 29.0) internal successors, (377), 13 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:49,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:49,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 64 [2025-01-10 01:15:49,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:50,927 INFO L124 PetriNetUnfolderBase]: 3332/5841 cut-off events. [2025-01-10 01:15:50,928 INFO L125 PetriNetUnfolderBase]: For 67383/67390 co-relation queries the response was YES. [2025-01-10 01:15:50,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34137 conditions, 5841 events. 3332/5841 cut-off events. For 67383/67390 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 35318 event pairs, 955 based on Foata normal form. 44/5885 useless extension candidates. Maximal degree in co-relation 33632. Up to 2361 conditions per place. [2025-01-10 01:15:50,975 INFO L140 encePairwiseOnDemand]: 46/64 looper letters, 333 selfloop transitions, 257 changer transitions 0/592 dead transitions. [2025-01-10 01:15:50,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 592 transitions, 9252 flow [2025-01-10 01:15:50,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-10 01:15:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-01-10 01:15:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 939 transitions. [2025-01-10 01:15:50,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5434027777777778 [2025-01-10 01:15:50,977 INFO L175 Difference]: Start difference. First operand has 251 places, 353 transitions, 5348 flow. Second operand 27 states and 939 transitions. [2025-01-10 01:15:50,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 592 transitions, 9252 flow [2025-01-10 01:15:51,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 592 transitions, 9011 flow, removed 95 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:51,272 INFO L231 Difference]: Finished difference. Result has 287 places, 428 transitions, 7387 flow [2025-01-10 01:15:51,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=5127, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=7387, PETRI_PLACES=287, PETRI_TRANSITIONS=428} [2025-01-10 01:15:51,275 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 226 predicate places. [2025-01-10 01:15:51,275 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 428 transitions, 7387 flow [2025-01-10 01:15:51,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 29.0) internal successors, (377), 13 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:51,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:51,275 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] [2025-01-10 01:15:51,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-10 01:15:51,275 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-10 01:15:51,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:51,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1628920715, now seen corresponding path program 4 times [2025-01-10 01:15:51,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:51,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080899285] [2025-01-10 01:15:51,276 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:15:51,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:51,281 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-01-10 01:15:51,290 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:15:51,290 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:15:51,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:51,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:51,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080899285] [2025-01-10 01:15:51,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080899285] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:15:51,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712520366] [2025-01-10 01:15:51,484 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:15:51,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:51,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:51,488 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:15:51,491 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:15:51,529 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-01-10 01:15:51,576 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:15:51,577 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:15:51,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:51,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:15:51,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:51,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:15:51,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712520366] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:51,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:15:51,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-01-10 01:15:51,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780009354] [2025-01-10 01:15:51,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:51,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:15:51,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:51,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:15:51,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:15:52,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:15:52,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 428 transitions, 7387 flow. Second operand has 26 states, 26 states have (on average 27.884615384615383) internal successors, (725), 26 states have internal predecessors, (725), 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:15:52,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:52,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:15:52,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:09,624 WARN L286 SmtUtils]: Spent 15.78s on a formula simplification. DAG size of input: 26 DAG size of output: 22 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)