./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/test-easy10.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/test-easy10.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 24421fae56d27ddfd314bb85e4431c40a1e6738a845aa97472d8668d2b4dde52 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:13:32,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:13:32,874 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:13:32,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:13:32,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:13:32,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:13:32,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:13:32,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:13:32,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:13:32,901 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:13:32,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:13:32,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:13:32,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:13:32,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:13:32,901 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:13:32,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:13:32,902 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:13:32,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:13:32,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:13:32,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:13:32,902 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:13:32,902 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:13:32,902 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:13:32,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:13:32,902 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:13:32,902 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:13:32,903 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:13:32,903 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:13:32,903 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:13:32,903 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:13:32,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:13:32,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:13:32,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:13:32,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:32,903 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:13:32,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:13:32,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:13:32,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:13:32,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:32,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:13:32,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:13:32,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:13:32,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:13:32,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:13:32,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:13:32,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:13:32,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:13:32,905 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 -> 24421fae56d27ddfd314bb85e4431c40a1e6738a845aa97472d8668d2b4dde52 [2025-01-10 01:13:33,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:13:33,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:13:33,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:13:33,088 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:13:33,088 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:13:33,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-easy10.wvr.c [2025-01-10 01:13:34,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3caf45dde/b4ce650d998048f8a4ced0b1d9632fd0/FLAGa7f6f3857 [2025-01-10 01:13:34,437 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:13:34,438 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/test-easy10.wvr.c [2025-01-10 01:13:34,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3caf45dde/b4ce650d998048f8a4ced0b1d9632fd0/FLAGa7f6f3857 [2025-01-10 01:13:34,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3caf45dde/b4ce650d998048f8a4ced0b1d9632fd0 [2025-01-10 01:13:34,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:13:34,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:13:34,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:13:34,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:13:34,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:13:34,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:13:34" (1/1) ... [2025-01-10 01:13:34,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@383f43eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:34, skipping insertion in model container [2025-01-10 01:13:34,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:13:34" (1/1) ... [2025-01-10 01:13:34,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:13:34,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:13:34,907 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:13:34,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:13:34,939 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:13:34,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:34 WrapperNode [2025-01-10 01:13:34,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:13:34,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:13:34,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:13:34,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:13:34,946 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:13:34" (1/1) ... [2025-01-10 01:13:34,950 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:13:34" (1/1) ... [2025-01-10 01:13:34,970 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 149 [2025-01-10 01:13:34,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:13:34,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:13:34,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:13:34,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:13:34,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:34" (1/1) ... [2025-01-10 01:13:34,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:34" (1/1) ... [2025-01-10 01:13:34,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:34" (1/1) ... [2025-01-10 01:13:34,997 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:13:34,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:34" (1/1) ... [2025-01-10 01:13:34,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:34" (1/1) ... [2025-01-10 01:13:35,003 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:34" (1/1) ... [2025-01-10 01:13:35,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:34" (1/1) ... [2025-01-10 01:13:35,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:34" (1/1) ... [2025-01-10 01:13:35,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:34" (1/1) ... [2025-01-10 01:13:35,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:34" (1/1) ... [2025-01-10 01:13:35,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:13:35,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:13:35,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:13:35,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:13:35,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:34" (1/1) ... [2025-01-10 01:13:35,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:13:35,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:13:35,049 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:13:35,056 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:13:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:13:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:13:35,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:13:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:13:35,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:13:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:13:35,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:13:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 01:13:35,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 01:13:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:13:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:13:35,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:13:35,071 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:13:35,138 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:13:35,139 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:13:35,282 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:13:35,282 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:13:35,381 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:13:35,382 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:13:35,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:13:35 BoogieIcfgContainer [2025-01-10 01:13:35,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:13:35,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:13:35,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:13:35,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:13:35,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:13:34" (1/3) ... [2025-01-10 01:13:35,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39668d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:13:35, skipping insertion in model container [2025-01-10 01:13:35,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:13:34" (2/3) ... [2025-01-10 01:13:35,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39668d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:13:35, skipping insertion in model container [2025-01-10 01:13:35,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:13:35" (3/3) ... [2025-01-10 01:13:35,389 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy10.wvr.c [2025-01-10 01:13:35,399 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:13:35,400 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy10.wvr.c that has 5 procedures, 63 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-10 01:13:35,400 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:13:35,469 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 01:13:35,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 62 transitions, 152 flow [2025-01-10 01:13:35,555 INFO L124 PetriNetUnfolderBase]: 0/58 cut-off events. [2025-01-10 01:13:35,559 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:13:35,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 0/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-01-10 01:13:35,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 62 transitions, 152 flow [2025-01-10 01:13:35,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 57 transitions, 138 flow [2025-01-10 01:13:35,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:13:35,597 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;@3070a675, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:13:35,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:13:35,624 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:13:35,624 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-01-10 01:13:35,624 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:13:35,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:35,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:35,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:13:35,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:35,633 INFO L85 PathProgramCache]: Analyzing trace with hash 18254776, now seen corresponding path program 1 times [2025-01-10 01:13:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:35,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100667892] [2025-01-10 01:13:35,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:13:35,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:35,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 01:13:35,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:13:35,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:35,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:36,172 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:13:36,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:36,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100667892] [2025-01-10 01:13:36,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100667892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:36,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:36,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:36,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001851855] [2025-01-10 01:13:36,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:36,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:36,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:36,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:36,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:36,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 62 [2025-01-10 01:13:36,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have 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:13:36,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:36,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 62 [2025-01-10 01:13:36,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:36,475 INFO L124 PetriNetUnfolderBase]: 597/1169 cut-off events. [2025-01-10 01:13:36,475 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-01-10 01:13:36,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 1169 events. 597/1169 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7091 event pairs, 424 based on Foata normal form. 26/1149 useless extension candidates. Maximal degree in co-relation 2104. Up to 853 conditions per place. [2025-01-10 01:13:36,492 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 34 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-01-10 01:13:36,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 230 flow [2025-01-10 01:13:36,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-01-10 01:13:36,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7365591397849462 [2025-01-10 01:13:36,504 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 138 flow. Second operand 3 states and 137 transitions. [2025-01-10 01:13:36,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 230 flow [2025-01-10 01:13:36,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 210 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 01:13:36,514 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 126 flow [2025-01-10 01:13:36,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2025-01-10 01:13:36,521 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2025-01-10 01:13:36,521 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 126 flow [2025-01-10 01:13:36,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have 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:13:36,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:36,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:36,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:13:36,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:13:36,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:36,524 INFO L85 PathProgramCache]: Analyzing trace with hash -380765308, now seen corresponding path program 2 times [2025-01-10 01:13:36,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:36,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211034406] [2025-01-10 01:13:36,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:36,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:36,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-01-10 01:13:36,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:13:36,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:13:36,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:36,788 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:13:36,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:36,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211034406] [2025-01-10 01:13:36,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211034406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:36,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:36,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:36,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366286677] [2025-01-10 01:13:36,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:36,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:36,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:36,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:36,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:36,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 62 [2025-01-10 01:13:36,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have 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:13:36,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:36,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 62 [2025-01-10 01:13:36,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:36,958 INFO L124 PetriNetUnfolderBase]: 633/1239 cut-off events. [2025-01-10 01:13:36,959 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-01-10 01:13:36,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2338 conditions, 1239 events. 633/1239 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7515 event pairs, 156 based on Foata normal form. 9/1203 useless extension candidates. Maximal degree in co-relation 2305. Up to 825 conditions per place. [2025-01-10 01:13:36,969 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 34 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-01-10 01:13:36,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 221 flow [2025-01-10 01:13:36,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:36,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2025-01-10 01:13:36,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7311827956989247 [2025-01-10 01:13:36,971 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 126 flow. Second operand 3 states and 136 transitions. [2025-01-10 01:13:36,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 221 flow [2025-01-10 01:13:36,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:36,972 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 130 flow [2025-01-10 01:13:36,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-01-10 01:13:36,975 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -6 predicate places. [2025-01-10 01:13:36,975 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 130 flow [2025-01-10 01:13:36,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have 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:13:36,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:36,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:36,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:13:36,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:13:36,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:36,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1891291960, now seen corresponding path program 3 times [2025-01-10 01:13:36,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:36,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951512462] [2025-01-10 01:13:36,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:13:36,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:36,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 1 equivalence classes. [2025-01-10 01:13:37,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:13:37,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:13:37,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:37,155 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:13:37,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:37,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951512462] [2025-01-10 01:13:37,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951512462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:37,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:37,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:37,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121841968] [2025-01-10 01:13:37,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:37,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:37,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:37,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:37,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:37,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 62 [2025-01-10 01:13:37,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have 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:13:37,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:37,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 62 [2025-01-10 01:13:37,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:37,276 INFO L124 PetriNetUnfolderBase]: 507/1023 cut-off events. [2025-01-10 01:13:37,276 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2025-01-10 01:13:37,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 1023 events. 507/1023 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5933 event pairs, 156 based on Foata normal form. 19/993 useless extension candidates. Maximal degree in co-relation 1284. Up to 645 conditions per place. [2025-01-10 01:13:37,282 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-01-10 01:13:37,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 216 flow [2025-01-10 01:13:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2025-01-10 01:13:37,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7204301075268817 [2025-01-10 01:13:37,283 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 130 flow. Second operand 3 states and 134 transitions. [2025-01-10 01:13:37,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 216 flow [2025-01-10 01:13:37,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:37,284 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 134 flow [2025-01-10 01:13:37,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2025-01-10 01:13:37,285 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -5 predicate places. [2025-01-10 01:13:37,285 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 134 flow [2025-01-10 01:13:37,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have 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:13:37,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:37,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:37,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:13:37,285 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:13:37,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:37,286 INFO L85 PathProgramCache]: Analyzing trace with hash 20009784, now seen corresponding path program 4 times [2025-01-10 01:13:37,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:37,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569880224] [2025-01-10 01:13:37,286 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:13:37,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:37,297 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-01-10 01:13:37,422 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:13:37,422 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:13:37,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:38,868 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:13:38,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:38,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569880224] [2025-01-10 01:13:38,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569880224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:38,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:38,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 01:13:38,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85126153] [2025-01-10 01:13:38,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:38,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:13:38,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:38,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:13:38,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:13:38,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2025-01-10 01:13:38,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 134 flow. Second operand has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:13:38,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:38,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2025-01-10 01:13:38,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:41,600 INFO L124 PetriNetUnfolderBase]: 17463/25226 cut-off events. [2025-01-10 01:13:41,600 INFO L125 PetriNetUnfolderBase]: For 3089/3089 co-relation queries the response was YES. [2025-01-10 01:13:41,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53130 conditions, 25226 events. 17463/25226 cut-off events. For 3089/3089 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 154496 event pairs, 2373 based on Foata normal form. 1/25209 useless extension candidates. Maximal degree in co-relation 15519. Up to 6001 conditions per place. [2025-01-10 01:13:41,700 INFO L140 encePairwiseOnDemand]: 46/62 looper letters, 246 selfloop transitions, 18 changer transitions 19/292 dead transitions. [2025-01-10 01:13:41,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 292 transitions, 1263 flow [2025-01-10 01:13:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:13:41,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:13:41,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 508 transitions. [2025-01-10 01:13:41,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5120967741935484 [2025-01-10 01:13:41,702 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 134 flow. Second operand 16 states and 508 transitions. [2025-01-10 01:13:41,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 292 transitions, 1263 flow [2025-01-10 01:13:41,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 292 transitions, 1259 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:41,708 INFO L231 Difference]: Finished difference. Result has 89 places, 70 transitions, 255 flow [2025-01-10 01:13:41,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=255, PETRI_PLACES=89, PETRI_TRANSITIONS=70} [2025-01-10 01:13:41,708 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 19 predicate places. [2025-01-10 01:13:41,708 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 70 transitions, 255 flow [2025-01-10 01:13:41,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:13:41,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:41,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:41,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:13:41,709 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:13:41,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:41,709 INFO L85 PathProgramCache]: Analyzing trace with hash -799322164, now seen corresponding path program 5 times [2025-01-10 01:13:41,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:41,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328310997] [2025-01-10 01:13:41,709 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:13:41,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:41,717 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-01-10 01:13:41,726 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:13:41,726 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:13:41,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:41,790 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:13:41,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:41,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328310997] [2025-01-10 01:13:41,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328310997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:41,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:41,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:13:41,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252332926] [2025-01-10 01:13:41,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:41,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:13:41,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:41,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:13:41,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:13:41,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 62 [2025-01-10 01:13:41,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 70 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have 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:13:41,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:41,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 62 [2025-01-10 01:13:41,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:41,996 INFO L124 PetriNetUnfolderBase]: 1634/3072 cut-off events. [2025-01-10 01:13:41,996 INFO L125 PetriNetUnfolderBase]: For 894/918 co-relation queries the response was YES. [2025-01-10 01:13:42,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7114 conditions, 3072 events. 1634/3072 cut-off events. For 894/918 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 21770 event pairs, 581 based on Foata normal form. 21/2840 useless extension candidates. Maximal degree in co-relation 7074. Up to 2444 conditions per place. [2025-01-10 01:13:42,012 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 36 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2025-01-10 01:13:42,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 340 flow [2025-01-10 01:13:42,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:13:42,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:13:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-01-10 01:13:42,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2025-01-10 01:13:42,016 INFO L175 Difference]: Start difference. First operand has 89 places, 70 transitions, 255 flow. Second operand 3 states and 138 transitions. [2025-01-10 01:13:42,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 340 flow [2025-01-10 01:13:42,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 77 transitions, 326 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 01:13:42,025 INFO L231 Difference]: Finished difference. Result has 84 places, 66 transitions, 229 flow [2025-01-10 01:13:42,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=84, PETRI_TRANSITIONS=66} [2025-01-10 01:13:42,025 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 14 predicate places. [2025-01-10 01:13:42,026 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 66 transitions, 229 flow [2025-01-10 01:13:42,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have 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:13:42,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:42,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:42,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:13:42,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:13:42,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:42,026 INFO L85 PathProgramCache]: Analyzing trace with hash -641955878, now seen corresponding path program 6 times [2025-01-10 01:13:42,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:42,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824290443] [2025-01-10 01:13:42,027 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:13:42,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:42,034 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 1 equivalence classes. [2025-01-10 01:13:42,067 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:13:42,068 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 01:13:42,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:43,156 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:13:43,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:43,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824290443] [2025-01-10 01:13:43,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824290443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:43,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:43,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 01:13:43,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105454906] [2025-01-10 01:13:43,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:43,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:13:43,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:43,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:13:43,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:13:43,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2025-01-10 01:13:43,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 66 transitions, 229 flow. Second operand has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:13:43,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:43,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2025-01-10 01:13:43,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:46,714 INFO L124 PetriNetUnfolderBase]: 27980/40616 cut-off events. [2025-01-10 01:13:46,715 INFO L125 PetriNetUnfolderBase]: For 23753/23753 co-relation queries the response was YES. [2025-01-10 01:13:46,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106324 conditions, 40616 events. 27980/40616 cut-off events. For 23753/23753 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 259672 event pairs, 4845 based on Foata normal form. 1/40614 useless extension candidates. Maximal degree in co-relation 61505. Up to 11479 conditions per place. [2025-01-10 01:13:46,895 INFO L140 encePairwiseOnDemand]: 46/62 looper letters, 255 selfloop transitions, 28 changer transitions 10/302 dead transitions. [2025-01-10 01:13:46,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 302 transitions, 1651 flow [2025-01-10 01:13:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:13:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 01:13:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 452 transitions. [2025-01-10 01:13:46,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4860215053763441 [2025-01-10 01:13:46,899 INFO L175 Difference]: Start difference. First operand has 84 places, 66 transitions, 229 flow. Second operand 15 states and 452 transitions. [2025-01-10 01:13:46,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 302 transitions, 1651 flow [2025-01-10 01:13:47,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 302 transitions, 1647 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:13:47,039 INFO L231 Difference]: Finished difference. Result has 107 places, 86 transitions, 464 flow [2025-01-10 01:13:47,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=464, PETRI_PLACES=107, PETRI_TRANSITIONS=86} [2025-01-10 01:13:47,041 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 37 predicate places. [2025-01-10 01:13:47,042 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 86 transitions, 464 flow [2025-01-10 01:13:47,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:13:47,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:47,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:47,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:13:47,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:13:47,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:47,043 INFO L85 PathProgramCache]: Analyzing trace with hash 555369944, now seen corresponding path program 7 times [2025-01-10 01:13:47,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:47,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952699653] [2025-01-10 01:13:47,043 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:13:47,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:47,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 01:13:47,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:13:47,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:13:47,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:48,541 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:13:48,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:48,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952699653] [2025-01-10 01:13:48,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952699653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:48,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:48,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 01:13:48,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900948306] [2025-01-10 01:13:48,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:48,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:13:48,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:48,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:13:48,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:13:48,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2025-01-10 01:13:48,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 86 transitions, 464 flow. Second operand has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:13:48,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:48,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2025-01-10 01:13:48,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:13:54,408 INFO L124 PetriNetUnfolderBase]: 54434/78826 cut-off events. [2025-01-10 01:13:54,409 INFO L125 PetriNetUnfolderBase]: For 125182/125182 co-relation queries the response was YES. [2025-01-10 01:13:54,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242380 conditions, 78826 events. 54434/78826 cut-off events. For 125182/125182 co-relation queries the response was YES. Maximal size of possible extension queue 2392. Compared 563279 event pairs, 7979 based on Foata normal form. 1/78820 useless extension candidates. Maximal degree in co-relation 242122. Up to 22972 conditions per place. [2025-01-10 01:13:54,975 INFO L140 encePairwiseOnDemand]: 46/62 looper letters, 286 selfloop transitions, 34 changer transitions 11/340 dead transitions. [2025-01-10 01:13:54,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 340 transitions, 2346 flow [2025-01-10 01:13:54,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:13:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 01:13:54,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 463 transitions. [2025-01-10 01:13:54,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4978494623655914 [2025-01-10 01:13:54,977 INFO L175 Difference]: Start difference. First operand has 107 places, 86 transitions, 464 flow. Second operand 15 states and 463 transitions. [2025-01-10 01:13:54,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 340 transitions, 2346 flow [2025-01-10 01:13:56,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 340 transitions, 2315 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-01-10 01:13:56,785 INFO L231 Difference]: Finished difference. Result has 129 places, 108 transitions, 789 flow [2025-01-10 01:13:56,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=789, PETRI_PLACES=129, PETRI_TRANSITIONS=108} [2025-01-10 01:13:56,786 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 59 predicate places. [2025-01-10 01:13:56,786 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 108 transitions, 789 flow [2025-01-10 01:13:56,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:13:56,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:13:56,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:13:56,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:13:56,788 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:13:56,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:13:56,789 INFO L85 PathProgramCache]: Analyzing trace with hash 401941916, now seen corresponding path program 8 times [2025-01-10 01:13:56,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:13:56,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950817967] [2025-01-10 01:13:56,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:13:56,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:13:56,794 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-01-10 01:13:56,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:13:56,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:13:56,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:13:57,757 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:13:57,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:13:57,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950817967] [2025-01-10 01:13:57,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950817967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:13:57,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:13:57,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 01:13:57,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160378500] [2025-01-10 01:13:57,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:13:57,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:13:57,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:13:57,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:13:57,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:13:57,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2025-01-10 01:13:57,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 108 transitions, 789 flow. Second operand has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:13:57,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:13:57,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2025-01-10 01:13:57,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:14:09,030 INFO L124 PetriNetUnfolderBase]: 91340/133957 cut-off events. [2025-01-10 01:14:09,031 INFO L125 PetriNetUnfolderBase]: For 407402/407402 co-relation queries the response was YES. [2025-01-10 01:14:09,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461698 conditions, 133957 events. 91340/133957 cut-off events. For 407402/407402 co-relation queries the response was YES. Maximal size of possible extension queue 4334. Compared 1041286 event pairs, 14992 based on Foata normal form. 1/133950 useless extension candidates. Maximal degree in co-relation 461037. Up to 32616 conditions per place. [2025-01-10 01:14:10,278 INFO L140 encePairwiseOnDemand]: 47/62 looper letters, 337 selfloop transitions, 51 changer transitions 10/407 dead transitions. [2025-01-10 01:14:10,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 407 transitions, 3510 flow [2025-01-10 01:14:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:14:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 01:14:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 468 transitions. [2025-01-10 01:14:10,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5032258064516129 [2025-01-10 01:14:10,281 INFO L175 Difference]: Start difference. First operand has 129 places, 108 transitions, 789 flow. Second operand 15 states and 468 transitions. [2025-01-10 01:14:10,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 407 transitions, 3510 flow [2025-01-10 01:14:20,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 407 transitions, 3365 flow, removed 66 selfloop flow, removed 3 redundant places. [2025-01-10 01:14:20,758 INFO L231 Difference]: Finished difference. Result has 151 places, 140 transitions, 1309 flow [2025-01-10 01:14:20,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1309, PETRI_PLACES=151, PETRI_TRANSITIONS=140} [2025-01-10 01:14:20,760 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 81 predicate places. [2025-01-10 01:14:20,760 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 140 transitions, 1309 flow [2025-01-10 01:14:20,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:20,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:14:20,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:14:20,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:14:20,761 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:14:20,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:14:20,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1660644852, now seen corresponding path program 9 times [2025-01-10 01:14:20,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:14:20,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724560958] [2025-01-10 01:14:20,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:14:20,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:14:20,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 1 equivalence classes. [2025-01-10 01:14:20,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:14:20,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:14:20,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:14:21,607 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:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:14:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724560958] [2025-01-10 01:14:21,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724560958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:14:21,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:14:21,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 01:14:21,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395429159] [2025-01-10 01:14:21,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:14:21,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:14:21,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:14:21,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:14:21,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:14:21,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2025-01-10 01:14:21,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 140 transitions, 1309 flow. Second operand has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:21,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:14:21,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2025-01-10 01:14:21,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand