./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/bench-exp2x3.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/bench-exp2x3.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 f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:00:23,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:00:23,397 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:00:23,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:00:23,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:00:23,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:00:23,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:00:23,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:00:23,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:00:23,415 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:00:23,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:00:23,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:00:23,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:00:23,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:00:23,416 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:00:23,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:00:23,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:00:23,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:00:23,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:00:23,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:00:23,416 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:00:23,416 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:00:23,416 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:00:23,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:00:23,417 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:00:23,417 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:00:23,417 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:00:23,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:00:23,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:00:23,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:00:23,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:23,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:23,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:23,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:23,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:00:23,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:23,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:23,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:23,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:23,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:00:23,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:00:23,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:00:23,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:00:23,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:00:23,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:00:23,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:00:23,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:00:23,418 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 -> f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 [2025-01-10 01:00:23,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:00:23,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:00:23,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:00:23,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:00:23,601 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:00:23,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c [2025-01-10 01:00:24,981 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d27bfb394/91b7a187013e470fa61c426264d4cb72/FLAGe7b73eed6 [2025-01-10 01:00:25,208 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:00:25,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c [2025-01-10 01:00:25,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d27bfb394/91b7a187013e470fa61c426264d4cb72/FLAGe7b73eed6 [2025-01-10 01:00:25,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d27bfb394/91b7a187013e470fa61c426264d4cb72 [2025-01-10 01:00:25,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:00:25,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:00:25,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:25,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:00:25,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:00:25,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:25" (1/1) ... [2025-01-10 01:00:25,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4ab674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:25, skipping insertion in model container [2025-01-10 01:00:25,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:25" (1/1) ... [2025-01-10 01:00:25,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:00:25,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:25,383 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:00:25,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:25,407 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:00:25,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:25 WrapperNode [2025-01-10 01:00:25,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:25,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:00:25,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:00:25,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:00:25,413 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:00:25" (1/1) ... [2025-01-10 01:00:25,418 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:00:25" (1/1) ... [2025-01-10 01:00:25,428 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2025-01-10 01:00:25,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:00:25,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:00:25,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:00:25,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:00:25,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:25" (1/1) ... [2025-01-10 01:00:25,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:25" (1/1) ... [2025-01-10 01:00:25,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:25" (1/1) ... [2025-01-10 01:00:25,446 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:00:25,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:25" (1/1) ... [2025-01-10 01:00:25,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:25" (1/1) ... [2025-01-10 01:00:25,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:25" (1/1) ... [2025-01-10 01:00:25,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:25" (1/1) ... [2025-01-10 01:00:25,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:25" (1/1) ... [2025-01-10 01:00:25,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:25" (1/1) ... [2025-01-10 01:00:25,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:25" (1/1) ... [2025-01-10 01:00:25,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:00:25,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:00:25,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:00:25,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:00:25,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:25" (1/1) ... [2025-01-10 01:00:25,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:25,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:25,479 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:00:25,483 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:00:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:00:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:00:25,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:00:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:00:25,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:00:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:00:25,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:00:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 01:00:25,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 01:00:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:00:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:00:25,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:00:25,496 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:00:25,551 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:00:25,552 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:00:25,709 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:00:25,710 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:00:25,833 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:00:25,834 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:00:25,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:25 BoogieIcfgContainer [2025-01-10 01:00:25,836 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:00:25,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:00:25,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:00:25,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:00:25,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:00:25" (1/3) ... [2025-01-10 01:00:25,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464c9c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:25, skipping insertion in model container [2025-01-10 01:00:25,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:25" (2/3) ... [2025-01-10 01:00:25,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464c9c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:25, skipping insertion in model container [2025-01-10 01:00:25,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:25" (3/3) ... [2025-01-10 01:00:25,845 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2025-01-10 01:00:25,855 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:00:25,856 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x3.wvr.c that has 5 procedures, 31 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-01-10 01:00:25,857 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:00:25,911 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 01:00:25,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 96 flow [2025-01-10 01:00:25,981 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-01-10 01:00:25,983 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:00:25,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 30 events. 4/30 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-01-10 01:00:25,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 34 transitions, 96 flow [2025-01-10 01:00:25,989 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 29 transitions, 82 flow [2025-01-10 01:00:26,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:00:26,015 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;@2878d48c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:00:26,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:00:26,030 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:00:26,030 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-01-10 01:00:26,031 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:00:26,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:26,031 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:00:26,032 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:00:26,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1392945658, now seen corresponding path program 1 times [2025-01-10 01:00:26,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:26,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127376926] [2025-01-10 01:00:26,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:26,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:26,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:00:26,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:00:26,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:26,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:26,469 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:00:26,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:26,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127376926] [2025-01-10 01:00:26,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127376926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:26,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:26,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:00:26,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500957234] [2025-01-10 01:00:26,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:26,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:00:26,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:26,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:00:26,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:00:26,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:26,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:00:26,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:26,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:26,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:26,764 INFO L124 PetriNetUnfolderBase]: 1367/1732 cut-off events. [2025-01-10 01:00:26,764 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2025-01-10 01:00:26,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 1732 events. 1367/1732 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5590 event pairs, 123 based on Foata normal form. 2/996 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2025-01-10 01:00:26,780 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 35 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2025-01-10 01:00:26,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 219 flow [2025-01-10 01:00:26,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:00:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:00:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-01-10 01:00:26,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2025-01-10 01:00:26,793 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 82 flow. Second operand 3 states and 73 transitions. [2025-01-10 01:00:26,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 219 flow [2025-01-10 01:00:26,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 01:00:26,800 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 95 flow [2025-01-10 01:00:26,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2025-01-10 01:00:26,804 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -7 predicate places. [2025-01-10 01:00:26,804 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 95 flow [2025-01-10 01:00:26,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:00:26,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:26,804 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:00:26,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:00:26,805 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:00:26,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:26,805 INFO L85 PathProgramCache]: Analyzing trace with hash 269592759, now seen corresponding path program 1 times [2025-01-10 01:00:26,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:26,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755894969] [2025-01-10 01:00:26,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:26,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:26,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:00:26,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:26,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:26,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:26,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:26,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755894969] [2025-01-10 01:00:26,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755894969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:26,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:26,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:26,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724773509] [2025-01-10 01:00:26,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:26,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:26,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:26,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:26,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:26,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:26,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:00:26,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:26,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:26,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:27,180 INFO L124 PetriNetUnfolderBase]: 1581/2026 cut-off events. [2025-01-10 01:00:27,181 INFO L125 PetriNetUnfolderBase]: For 580/580 co-relation queries the response was YES. [2025-01-10 01:00:27,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5032 conditions, 2026 events. 1581/2026 cut-off events. For 580/580 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7011 event pairs, 95 based on Foata normal form. 46/2064 useless extension candidates. Maximal degree in co-relation 1272. Up to 830 conditions per place. [2025-01-10 01:00:27,191 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 65 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2025-01-10 01:00:27,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 80 transitions, 387 flow [2025-01-10 01:00:27,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-01-10 01:00:27,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-01-10 01:00:27,192 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 95 flow. Second operand 5 states and 119 transitions. [2025-01-10 01:00:27,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 80 transitions, 387 flow [2025-01-10 01:00:27,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 80 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:27,194 INFO L231 Difference]: Finished difference. Result has 36 places, 38 transitions, 155 flow [2025-01-10 01:00:27,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=36, PETRI_TRANSITIONS=38} [2025-01-10 01:00:27,195 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-01-10 01:00:27,195 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 38 transitions, 155 flow [2025-01-10 01:00:27,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:00:27,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:27,195 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:00:27,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:00:27,196 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:00:27,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:27,196 INFO L85 PathProgramCache]: Analyzing trace with hash 164789721, now seen corresponding path program 1 times [2025-01-10 01:00:27,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:27,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479866203] [2025-01-10 01:00:27,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:27,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:27,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:00:27,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:27,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:27,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:27,267 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:00:27,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:27,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479866203] [2025-01-10 01:00:27,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479866203] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:27,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345824724] [2025-01-10 01:00:27,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:27,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:27,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:27,275 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:00:27,280 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:00:27,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:00:27,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:27,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:27,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:27,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:00:27,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:27,482 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:00:27,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:27,545 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:00:27,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345824724] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:27,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:27,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:00:27,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953163937] [2025-01-10 01:00:27,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:27,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:00:27,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:27,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:00:27,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:00:27,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:27,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 38 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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:00:27,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:27,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:27,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:27,764 INFO L124 PetriNetUnfolderBase]: 1703/2234 cut-off events. [2025-01-10 01:00:27,764 INFO L125 PetriNetUnfolderBase]: For 1837/1837 co-relation queries the response was YES. [2025-01-10 01:00:27,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6723 conditions, 2234 events. 1703/2234 cut-off events. For 1837/1837 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8547 event pairs, 356 based on Foata normal form. 61/2274 useless extension candidates. Maximal degree in co-relation 2390. Up to 1023 conditions per place. [2025-01-10 01:00:27,777 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 69 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2025-01-10 01:00:27,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 84 transitions, 459 flow [2025-01-10 01:00:27,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-01-10 01:00:27,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7235294117647059 [2025-01-10 01:00:27,779 INFO L175 Difference]: Start difference. First operand has 36 places, 38 transitions, 155 flow. Second operand 5 states and 123 transitions. [2025-01-10 01:00:27,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 84 transitions, 459 flow [2025-01-10 01:00:27,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 84 transitions, 459 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:00:27,782 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 211 flow [2025-01-10 01:00:27,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2025-01-10 01:00:27,783 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2025-01-10 01:00:27,783 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 211 flow [2025-01-10 01:00:27,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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:00:27,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:27,784 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:00:27,792 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:00:27,988 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:00:27,989 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:00:27,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:27,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1755102488, now seen corresponding path program 1 times [2025-01-10 01:00:27,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:27,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630246341] [2025-01-10 01:00:27,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:27,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:28,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:00:28,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:28,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:28,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:28,127 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:00:28,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:28,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630246341] [2025-01-10 01:00:28,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630246341] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:28,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053574723] [2025-01-10 01:00:28,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:28,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:28,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:28,131 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:00:28,134 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:00:28,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:00:28,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:28,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:28,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:28,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:00:28,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:28,341 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:00:28,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:28,403 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:00:28,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053574723] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:28,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:28,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:00:28,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967502674] [2025-01-10 01:00:28,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:28,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:00:28,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:28,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:00:28,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:00:28,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:28,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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:00:28,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:28,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:28,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:28,710 INFO L124 PetriNetUnfolderBase]: 2058/2808 cut-off events. [2025-01-10 01:00:28,710 INFO L125 PetriNetUnfolderBase]: For 6209/6209 co-relation queries the response was YES. [2025-01-10 01:00:28,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9605 conditions, 2808 events. 2058/2808 cut-off events. For 6209/6209 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 11955 event pairs, 334 based on Foata normal form. 77/2863 useless extension candidates. Maximal degree in co-relation 5846. Up to 1193 conditions per place. [2025-01-10 01:00:28,726 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2025-01-10 01:00:28,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 104 transitions, 781 flow [2025-01-10 01:00:28,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-01-10 01:00:28,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6647058823529411 [2025-01-10 01:00:28,729 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 211 flow. Second operand 5 states and 113 transitions. [2025-01-10 01:00:28,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 104 transitions, 781 flow [2025-01-10 01:00:28,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 104 transitions, 752 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:28,738 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 255 flow [2025-01-10 01:00:28,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=255, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2025-01-10 01:00:28,739 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2025-01-10 01:00:28,739 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 255 flow [2025-01-10 01:00:28,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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:00:28,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:28,740 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:00:28,750 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:00:28,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:28,945 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:00:28,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:28,945 INFO L85 PathProgramCache]: Analyzing trace with hash -406480310, now seen corresponding path program 2 times [2025-01-10 01:00:28,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:28,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258924902] [2025-01-10 01:00:28,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:28,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:28,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:00:28,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:28,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:28,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:29,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:29,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258924902] [2025-01-10 01:00:29,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258924902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:29,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:29,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:29,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114797878] [2025-01-10 01:00:29,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:29,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:29,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:29,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:29,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:29,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:29,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:00:29,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:29,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:29,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:29,233 INFO L124 PetriNetUnfolderBase]: 1859/2509 cut-off events. [2025-01-10 01:00:29,233 INFO L125 PetriNetUnfolderBase]: For 6180/6180 co-relation queries the response was YES. [2025-01-10 01:00:29,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10032 conditions, 2509 events. 1859/2509 cut-off events. For 6180/6180 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 9987 event pairs, 108 based on Foata normal form. 37/2524 useless extension candidates. Maximal degree in co-relation 6148. Up to 1056 conditions per place. [2025-01-10 01:00:29,247 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 92 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2025-01-10 01:00:29,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 108 transitions, 830 flow [2025-01-10 01:00:29,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2025-01-10 01:00:29,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2025-01-10 01:00:29,248 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 255 flow. Second operand 5 states and 112 transitions. [2025-01-10 01:00:29,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 108 transitions, 830 flow [2025-01-10 01:00:29,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 830 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:00:29,254 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 316 flow [2025-01-10 01:00:29,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2025-01-10 01:00:29,255 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-01-10 01:00:29,255 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 316 flow [2025-01-10 01:00:29,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:00:29,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:29,255 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:00:29,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:00:29,256 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:00:29,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:29,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1789237731, now seen corresponding path program 1 times [2025-01-10 01:00:29,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:29,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71777322] [2025-01-10 01:00:29,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:29,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:00:29,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:29,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:29,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:29,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:29,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71777322] [2025-01-10 01:00:29,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71777322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:29,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:29,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:29,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624415728] [2025-01-10 01:00:29,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:29,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:29,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:29,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:29,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:29,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:29,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 316 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:00:29,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:29,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:29,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:29,505 INFO L124 PetriNetUnfolderBase]: 1819/2469 cut-off events. [2025-01-10 01:00:29,505 INFO L125 PetriNetUnfolderBase]: For 7197/7197 co-relation queries the response was YES. [2025-01-10 01:00:29,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10647 conditions, 2469 events. 1819/2469 cut-off events. For 7197/7197 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 9982 event pairs, 82 based on Foata normal form. 40/2487 useless extension candidates. Maximal degree in co-relation 6522. Up to 1147 conditions per place. [2025-01-10 01:00:29,519 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 90 selfloop transitions, 8 changer transitions 2/105 dead transitions. [2025-01-10 01:00:29,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 105 transitions, 839 flow [2025-01-10 01:00:29,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:29,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-01-10 01:00:29,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2025-01-10 01:00:29,520 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 316 flow. Second operand 5 states and 110 transitions. [2025-01-10 01:00:29,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 105 transitions, 839 flow [2025-01-10 01:00:29,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 828 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:29,526 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 319 flow [2025-01-10 01:00:29,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-01-10 01:00:29,527 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2025-01-10 01:00:29,527 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 319 flow [2025-01-10 01:00:29,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:00:29,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:29,527 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:00:29,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:00:29,527 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:00:29,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:29,528 INFO L85 PathProgramCache]: Analyzing trace with hash 82029655, now seen corresponding path program 2 times [2025-01-10 01:00:29,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:29,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805967310] [2025-01-10 01:00:29,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:29,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:29,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:00:29,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:29,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:29,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:29,579 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:00:29,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:29,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805967310] [2025-01-10 01:00:29,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805967310] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:29,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285711359] [2025-01-10 01:00:29,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:29,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:29,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:29,582 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:00:29,583 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:00:29,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:00:29,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:29,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:29,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:29,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:00:29,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:29,773 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:00:29,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:29,827 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:00:29,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285711359] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:29,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:29,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:00:29,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502746968] [2025-01-10 01:00:29,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:29,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:00:29,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:29,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:00:29,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:00:29,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:29,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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:00:29,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:29,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:29,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:30,102 INFO L124 PetriNetUnfolderBase]: 1745/2409 cut-off events. [2025-01-10 01:00:30,103 INFO L125 PetriNetUnfolderBase]: For 7536/7536 co-relation queries the response was YES. [2025-01-10 01:00:30,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10700 conditions, 2409 events. 1745/2409 cut-off events. For 7536/7536 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10192 event pairs, 303 based on Foata normal form. 74/2461 useless extension candidates. Maximal degree in co-relation 6553. Up to 1314 conditions per place. [2025-01-10 01:00:30,116 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2025-01-10 01:00:30,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 104 transitions, 859 flow [2025-01-10 01:00:30,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-01-10 01:00:30,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2025-01-10 01:00:30,118 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 319 flow. Second operand 5 states and 108 transitions. [2025-01-10 01:00:30,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 104 transitions, 859 flow [2025-01-10 01:00:30,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 104 transitions, 846 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:30,125 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 359 flow [2025-01-10 01:00:30,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=359, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2025-01-10 01:00:30,125 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2025-01-10 01:00:30,126 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 359 flow [2025-01-10 01:00:30,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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:00:30,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:30,126 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:00:30,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:00:30,330 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:00:30,331 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:00:30,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:30,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1025749279, now seen corresponding path program 2 times [2025-01-10 01:00:30,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:30,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175158546] [2025-01-10 01:00:30,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:30,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:30,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:00:30,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:30,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:30,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:00:30,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:30,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175158546] [2025-01-10 01:00:30,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175158546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:30,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:30,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:30,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059974961] [2025-01-10 01:00:30,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:30,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:00:30,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:30,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:00:30,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:00:30,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:30,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 359 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:00:30,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:30,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:30,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:30,577 INFO L124 PetriNetUnfolderBase]: 1515/2042 cut-off events. [2025-01-10 01:00:30,577 INFO L125 PetriNetUnfolderBase]: For 7244/7244 co-relation queries the response was YES. [2025-01-10 01:00:30,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9624 conditions, 2042 events. 1515/2042 cut-off events. For 7244/7244 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8016 event pairs, 89 based on Foata normal form. 34/2070 useless extension candidates. Maximal degree in co-relation 8506. Up to 864 conditions per place. [2025-01-10 01:00:30,589 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 108 selfloop transitions, 9 changer transitions 4/126 dead transitions. [2025-01-10 01:00:30,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 126 transitions, 1072 flow [2025-01-10 01:00:30,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-01-10 01:00:30,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-01-10 01:00:30,591 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 359 flow. Second operand 5 states and 119 transitions. [2025-01-10 01:00:30,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 126 transitions, 1072 flow [2025-01-10 01:00:30,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 126 transitions, 1014 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-01-10 01:00:30,603 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 354 flow [2025-01-10 01:00:30,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=354, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2025-01-10 01:00:30,604 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 27 predicate places. [2025-01-10 01:00:30,607 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 354 flow [2025-01-10 01:00:30,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:00:30,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:30,607 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:00:30,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:00:30,607 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:00:30,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:30,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1806045759, now seen corresponding path program 2 times [2025-01-10 01:00:30,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:30,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542549542] [2025-01-10 01:00:30,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:30,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:30,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:00:30,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:30,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:30,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:30,673 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:00:30,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:30,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542549542] [2025-01-10 01:00:30,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542549542] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:30,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532454726] [2025-01-10 01:00:30,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:00:30,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:30,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:30,677 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:00:30,679 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:00:30,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 01:00:30,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:00:30,730 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:00:30,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:30,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:00:30,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:00:30,838 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:00:30,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:00:30,894 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:00:30,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532454726] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:00:30,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:00:30,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:00:30,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279347696] [2025-01-10 01:00:30,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:00:30,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:00:30,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:30,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:00:30,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:00:30,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-01-10 01:00:30,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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:00:30,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:30,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-01-10 01:00:30,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:31,100 INFO L124 PetriNetUnfolderBase]: 1447/1987 cut-off events. [2025-01-10 01:00:31,101 INFO L125 PetriNetUnfolderBase]: For 6858/6858 co-relation queries the response was YES. [2025-01-10 01:00:31,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9421 conditions, 1987 events. 1447/1987 cut-off events. For 6858/6858 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8162 event pairs, 375 based on Foata normal form. 68/2042 useless extension candidates. Maximal degree in co-relation 8390. Up to 1150 conditions per place. [2025-01-10 01:00:31,110 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 111 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2025-01-10 01:00:31,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 124 transitions, 1043 flow [2025-01-10 01:00:31,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:00:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:00:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-01-10 01:00:31,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6823529411764706 [2025-01-10 01:00:31,111 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 354 flow. Second operand 5 states and 116 transitions. [2025-01-10 01:00:31,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 124 transitions, 1043 flow [2025-01-10 01:00:31,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 1036 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:00:31,117 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 401 flow [2025-01-10 01:00:31,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=401, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2025-01-10 01:00:31,117 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 32 predicate places. [2025-01-10 01:00:31,118 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 401 flow [2025-01-10 01:00:31,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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:00:31,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:31,118 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] [2025-01-10 01:00:31,125 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:00:31,322 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,SelfDestructingSolverStorable8 [2025-01-10 01:00:31,322 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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:00:31,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:31,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2124332741, now seen corresponding path program 1 times [2025-01-10 01:00:31,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:31,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931775926] [2025-01-10 01:00:31,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:31,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:31,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:00:31,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:00:31,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:31,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:31,787 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:00:31,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:31,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931775926] [2025-01-10 01:00:31,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931775926] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:00:31,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679697478] [2025-01-10 01:00:31,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:31,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:00:31,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:31,789 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:00:31,796 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:00:31,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:00:31,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:00:31,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:31,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:31,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:00:31,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:02:03,347 WARN L286 SmtUtils]: Spent 10.14s on a formula simplification. DAG size of input: 34 DAG size of output: 33 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)