./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.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 6b30bad195dde021066febd52c7985271e0448c265b66e6efcbd9c3306420e73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:07:03,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:07:03,682 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:07:03,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:07:03,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:07:03,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:07:03,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:07:03,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:07:03,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:07:03,701 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:07:03,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:07:03,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:07:03,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:07:03,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:07:03,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:07:03,702 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:07:03,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:07:03,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:07:03,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:07:03,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:07:03,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:07:03,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:07:03,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:07:03,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:07:03,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:07:03,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:07:03,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:07:03,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:07:03,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:07:03,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:07:03,703 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 -> 6b30bad195dde021066febd52c7985271e0448c265b66e6efcbd9c3306420e73 [2025-01-10 01:07:03,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:07:03,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:07:03,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:07:03,920 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:07:03,920 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:07:03,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-01-10 01:07:05,288 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7924b7172/c9ab55830d01447996fd40057caa3ac5/FLAG7f8975d08 [2025-01-10 01:07:05,546 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:07:05,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-01-10 01:07:05,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7924b7172/c9ab55830d01447996fd40057caa3ac5/FLAG7f8975d08 [2025-01-10 01:07:05,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7924b7172/c9ab55830d01447996fd40057caa3ac5 [2025-01-10 01:07:05,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:07:05,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:07:05,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:07:05,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:07:05,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:07:05,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:07:05" (1/1) ... [2025-01-10 01:07:05,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2617b3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:05, skipping insertion in model container [2025-01-10 01:07:05,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:07:05" (1/1) ... [2025-01-10 01:07:05,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:07:05,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:07:05,816 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:07:05,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:07:05,855 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:07:05,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:05 WrapperNode [2025-01-10 01:07:05,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:07:05,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:07:05,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:07:05,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:07:05,869 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:07:05" (1/1) ... [2025-01-10 01:07:05,878 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:07:05" (1/1) ... [2025-01-10 01:07:05,895 INFO L138 Inliner]: procedures = 20, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 50 [2025-01-10 01:07:05,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:07:05,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:07:05,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:07:05,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:07:05,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:05" (1/1) ... [2025-01-10 01:07:05,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:05" (1/1) ... [2025-01-10 01:07:05,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:05" (1/1) ... [2025-01-10 01:07:05,913 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:07:05,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:05" (1/1) ... [2025-01-10 01:07:05,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:05" (1/1) ... [2025-01-10 01:07:05,916 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:05" (1/1) ... [2025-01-10 01:07:05,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:05" (1/1) ... [2025-01-10 01:07:05,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:05" (1/1) ... [2025-01-10 01:07:05,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:05" (1/1) ... [2025-01-10 01:07:05,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:05" (1/1) ... [2025-01-10 01:07:05,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:07:05,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:07:05,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:07:05,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:07:05,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:05" (1/1) ... [2025-01-10 01:07:05,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:07:05,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:05,953 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:07:05,955 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:07:05,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:07:05,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:07:05,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:07:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:07:05,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:07:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:07:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:07:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:07:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:07:05,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:07:05,974 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:07:06,037 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:07:06,038 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:07:06,194 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:07:06,196 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:07:06,299 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:07:06,299 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:07:06,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:07:06 BoogieIcfgContainer [2025-01-10 01:07:06,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:07:06,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:07:06,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:07:06,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:07:06,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:07:05" (1/3) ... [2025-01-10 01:07:06,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d86744e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:07:06, skipping insertion in model container [2025-01-10 01:07:06,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:05" (2/3) ... [2025-01-10 01:07:06,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d86744e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:07:06, skipping insertion in model container [2025-01-10 01:07:06,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:07:06" (3/3) ... [2025-01-10 01:07:06,306 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2025-01-10 01:07:06,320 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:07:06,321 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-threaded-sum-2.wvr.c that has 3 procedures, 26 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-10 01:07:06,321 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:07:06,377 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:07:06,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 68 flow [2025-01-10 01:07:06,443 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-01-10 01:07:06,447 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:07:06,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 2/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-01-10 01:07:06,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 27 transitions, 68 flow [2025-01-10 01:07:06,454 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 24 transitions, 60 flow [2025-01-10 01:07:06,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:07:06,471 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;@1a5eff81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:07:06,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:07:06,482 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:07:06,483 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-01-10 01:07:06,483 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:07:06,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:06,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:06,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:07:06,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:06,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1426678743, now seen corresponding path program 1 times [2025-01-10 01:07:06,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:06,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145229395] [2025-01-10 01:07:06,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:06,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:06,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:07:06,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:07:06,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:06,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:06,908 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:07:06,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:06,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145229395] [2025-01-10 01:07:06,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145229395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:06,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:06,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:06,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902557056] [2025-01-10 01:07:06,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:06,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:06,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:06,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:06,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:06,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2025-01-10 01:07:06,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:06,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:06,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2025-01-10 01:07:06,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:07,036 INFO L124 PetriNetUnfolderBase]: 91/184 cut-off events. [2025-01-10 01:07:07,037 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:07:07,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 184 events. 91/184 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 659 event pairs, 20 based on Foata normal form. 15/194 useless extension candidates. Maximal degree in co-relation 326. Up to 77 conditions per place. [2025-01-10 01:07:07,039 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 27 selfloop transitions, 5 changer transitions 2/41 dead transitions. [2025-01-10 01:07:07,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 41 transitions, 165 flow [2025-01-10 01:07:07,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-01-10 01:07:07,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2025-01-10 01:07:07,055 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 60 flow. Second operand 5 states and 87 transitions. [2025-01-10 01:07:07,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 41 transitions, 165 flow [2025-01-10 01:07:07,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 41 transitions, 155 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:07:07,060 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 85 flow [2025-01-10 01:07:07,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2025-01-10 01:07:07,065 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2025-01-10 01:07:07,065 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 85 flow [2025-01-10 01:07:07,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:07,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:07,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:07,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:07:07,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:07:07,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:07,066 INFO L85 PathProgramCache]: Analyzing trace with hash -399741994, now seen corresponding path program 1 times [2025-01-10 01:07:07,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:07,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358959927] [2025-01-10 01:07:07,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:07,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:07,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:07:07,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:07:07,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:07,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:07,877 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:07:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358959927] [2025-01-10 01:07:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358959927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:07,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:07,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:07:07,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039592443] [2025-01-10 01:07:07,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:07,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:07:07,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:07,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:07:07,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:07:07,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-01-10 01:07:07,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 85 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:07,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:07,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-01-10 01:07:07,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:08,423 INFO L124 PetriNetUnfolderBase]: 206/401 cut-off events. [2025-01-10 01:07:08,423 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-01-10 01:07:08,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 401 events. 206/401 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1593 event pairs, 17 based on Foata normal form. 6/407 useless extension candidates. Maximal degree in co-relation 355. Up to 217 conditions per place. [2025-01-10 01:07:08,428 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 39 selfloop transitions, 22 changer transitions 16/82 dead transitions. [2025-01-10 01:07:08,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 82 transitions, 397 flow [2025-01-10 01:07:08,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:07:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 01:07:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 199 transitions. [2025-01-10 01:07:08,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49135802469135803 [2025-01-10 01:07:08,430 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 85 flow. Second operand 15 states and 199 transitions. [2025-01-10 01:07:08,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 82 transitions, 397 flow [2025-01-10 01:07:08,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 82 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:08,434 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 240 flow [2025-01-10 01:07:08,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=240, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2025-01-10 01:07:08,436 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 23 predicate places. [2025-01-10 01:07:08,436 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 240 flow [2025-01-10 01:07:08,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:08,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:08,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:08,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:07:08,436 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:07:08,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:08,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1698187186, now seen corresponding path program 1 times [2025-01-10 01:07:08,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:08,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421521392] [2025-01-10 01:07:08,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:08,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:08,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:07:08,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:08,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:08,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:08,587 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:07:08,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:08,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421521392] [2025-01-10 01:07:08,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421521392] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:08,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044127218] [2025-01-10 01:07:08,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:08,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:08,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:08,590 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:07:08,593 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:07:08,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:07:08,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:08,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:08,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:08,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:07:08,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:08,756 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:07:08,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:08,850 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:07:08,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044127218] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:08,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:08,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 5] total 9 [2025-01-10 01:07:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747398515] [2025-01-10 01:07:08,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:08,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:07:08,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:08,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:07:08,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:07:08,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-01-10 01:07:08,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 240 flow. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:08,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:08,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-01-10 01:07:08,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:09,157 INFO L124 PetriNetUnfolderBase]: 544/1064 cut-off events. [2025-01-10 01:07:09,158 INFO L125 PetriNetUnfolderBase]: For 1700/1708 co-relation queries the response was YES. [2025-01-10 01:07:09,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3336 conditions, 1064 events. 544/1064 cut-off events. For 1700/1708 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5604 event pairs, 35 based on Foata normal form. 16/1065 useless extension candidates. Maximal degree in co-relation 2487. Up to 214 conditions per place. [2025-01-10 01:07:09,168 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 82 selfloop transitions, 38 changer transitions 0/130 dead transitions. [2025-01-10 01:07:09,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 130 transitions, 878 flow [2025-01-10 01:07:09,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:07:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:07:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 194 transitions. [2025-01-10 01:07:09,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5987654320987654 [2025-01-10 01:07:09,172 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 240 flow. Second operand 12 states and 194 transitions. [2025-01-10 01:07:09,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 130 transitions, 878 flow [2025-01-10 01:07:09,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 130 transitions, 837 flow, removed 18 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:09,186 INFO L231 Difference]: Finished difference. Result has 63 places, 75 transitions, 466 flow [2025-01-10 01:07:09,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=466, PETRI_PLACES=63, PETRI_TRANSITIONS=75} [2025-01-10 01:07:09,187 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 34 predicate places. [2025-01-10 01:07:09,188 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 75 transitions, 466 flow [2025-01-10 01:07:09,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:09,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:09,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:09,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:07:09,390 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:07:09,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:07:09,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:09,392 INFO L85 PathProgramCache]: Analyzing trace with hash 129417804, now seen corresponding path program 2 times [2025-01-10 01:07:09,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:09,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261983613] [2025-01-10 01:07:09,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:09,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:09,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:07:09,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:09,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:09,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:10,020 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:07:10,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:10,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261983613] [2025-01-10 01:07:10,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261983613] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:10,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768422594] [2025-01-10 01:07:10,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:10,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:10,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:10,023 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:07:10,026 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:07:10,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 01:07:10,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:10,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:10,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:10,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:07:10,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:10,609 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:07:10,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:11,301 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:07:11,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768422594] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:11,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:11,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2025-01-10 01:07:11,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562514031] [2025-01-10 01:07:11,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:11,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:07:11,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:11,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:07:11,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:07:11,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-01-10 01:07:11,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 75 transitions, 466 flow. Second operand has 21 states, 21 states have (on average 11.047619047619047) internal successors, (232), 21 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:11,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:11,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-01-10 01:07:11,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:14,390 INFO L124 PetriNetUnfolderBase]: 1316/2680 cut-off events. [2025-01-10 01:07:14,391 INFO L125 PetriNetUnfolderBase]: For 6657/6747 co-relation queries the response was YES. [2025-01-10 01:07:14,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9722 conditions, 2680 events. 1316/2680 cut-off events. For 6657/6747 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 18245 event pairs, 36 based on Foata normal form. 47/2698 useless extension candidates. Maximal degree in co-relation 6571. Up to 588 conditions per place. [2025-01-10 01:07:14,407 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 154 selfloop transitions, 138 changer transitions 69/371 dead transitions. [2025-01-10 01:07:14,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 371 transitions, 2864 flow [2025-01-10 01:07:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-10 01:07:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-01-10 01:07:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 642 transitions. [2025-01-10 01:07:14,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5404040404040404 [2025-01-10 01:07:14,410 INFO L175 Difference]: Start difference. First operand has 63 places, 75 transitions, 466 flow. Second operand 44 states and 642 transitions. [2025-01-10 01:07:14,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 371 transitions, 2864 flow [2025-01-10 01:07:14,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 371 transitions, 2787 flow, removed 34 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:14,427 INFO L231 Difference]: Finished difference. Result has 122 places, 194 transitions, 1746 flow [2025-01-10 01:07:14,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=1746, PETRI_PLACES=122, PETRI_TRANSITIONS=194} [2025-01-10 01:07:14,428 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 93 predicate places. [2025-01-10 01:07:14,428 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 194 transitions, 1746 flow [2025-01-10 01:07:14,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.047619047619047) internal successors, (232), 21 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:14,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:14,428 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:14,438 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:07:14,633 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:07:14,635 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:07:14,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:14,638 INFO L85 PathProgramCache]: Analyzing trace with hash -778985107, now seen corresponding path program 2 times [2025-01-10 01:07:14,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:14,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306383190] [2025-01-10 01:07:14,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:14,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:14,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:07:14,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-01-10 01:07:14,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:07:14,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:14,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:14,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306383190] [2025-01-10 01:07:14,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306383190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:14,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:14,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:07:14,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872848167] [2025-01-10 01:07:14,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:14,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:07:14,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:14,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:07:14,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:07:14,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-01-10 01:07:14,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 194 transitions, 1746 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:14,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:14,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-01-10 01:07:14,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:15,199 INFO L124 PetriNetUnfolderBase]: 1636/3193 cut-off events. [2025-01-10 01:07:15,200 INFO L125 PetriNetUnfolderBase]: For 13232/13322 co-relation queries the response was YES. [2025-01-10 01:07:15,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13694 conditions, 3193 events. 1636/3193 cut-off events. For 13232/13322 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 21612 event pairs, 228 based on Foata normal form. 20/3173 useless extension candidates. Maximal degree in co-relation 13504. Up to 896 conditions per place. [2025-01-10 01:07:15,223 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 241 selfloop transitions, 135 changer transitions 0/392 dead transitions. [2025-01-10 01:07:15,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 392 transitions, 4275 flow [2025-01-10 01:07:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:07:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:07:15,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2025-01-10 01:07:15,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-01-10 01:07:15,225 INFO L175 Difference]: Start difference. First operand has 122 places, 194 transitions, 1746 flow. Second operand 7 states and 114 transitions. [2025-01-10 01:07:15,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 392 transitions, 4275 flow [2025-01-10 01:07:15,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 392 transitions, 3932 flow, removed 139 selfloop flow, removed 17 redundant places. [2025-01-10 01:07:15,272 INFO L231 Difference]: Finished difference. Result has 104 places, 283 transitions, 2866 flow [2025-01-10 01:07:15,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2866, PETRI_PLACES=104, PETRI_TRANSITIONS=283} [2025-01-10 01:07:15,272 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 75 predicate places. [2025-01-10 01:07:15,272 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 283 transitions, 2866 flow [2025-01-10 01:07:15,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:15,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:15,273 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:15,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:07:15,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:07:15,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:15,274 INFO L85 PathProgramCache]: Analyzing trace with hash -541225225, now seen corresponding path program 3 times [2025-01-10 01:07:15,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:15,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264558955] [2025-01-10 01:07:15,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:07:15,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:15,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:07:15,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-01-10 01:07:15,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:07:15,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:15,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:07:15,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:15,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264558955] [2025-01-10 01:07:15,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264558955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:15,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:15,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:07:15,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180435232] [2025-01-10 01:07:15,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:15,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:07:15,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:15,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:07:15,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:07:15,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-01-10 01:07:15,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 283 transitions, 2866 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:15,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:15,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-01-10 01:07:15,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:15,822 INFO L124 PetriNetUnfolderBase]: 1645/3195 cut-off events. [2025-01-10 01:07:15,822 INFO L125 PetriNetUnfolderBase]: For 14553/14643 co-relation queries the response was YES. [2025-01-10 01:07:15,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15066 conditions, 3195 events. 1645/3195 cut-off events. For 14553/14643 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 21306 event pairs, 535 based on Foata normal form. 24/3196 useless extension candidates. Maximal degree in co-relation 14367. Up to 1829 conditions per place. [2025-01-10 01:07:15,842 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 189 selfloop transitions, 130 changer transitions 0/335 dead transitions. [2025-01-10 01:07:15,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 335 transitions, 3898 flow [2025-01-10 01:07:15,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:07:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:07:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2025-01-10 01:07:15,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.544973544973545 [2025-01-10 01:07:15,845 INFO L175 Difference]: Start difference. First operand has 104 places, 283 transitions, 2866 flow. Second operand 7 states and 103 transitions. [2025-01-10 01:07:15,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 335 transitions, 3898 flow [2025-01-10 01:07:15,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 335 transitions, 3868 flow, removed 15 selfloop flow, removed 0 redundant places. [2025-01-10 01:07:15,894 INFO L231 Difference]: Finished difference. Result has 114 places, 288 transitions, 3299 flow [2025-01-10 01:07:15,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=2844, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3299, PETRI_PLACES=114, PETRI_TRANSITIONS=288} [2025-01-10 01:07:15,896 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 85 predicate places. [2025-01-10 01:07:15,896 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 288 transitions, 3299 flow [2025-01-10 01:07:15,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:15,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:15,897 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:15,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:07:15,897 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:07:15,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:15,898 INFO L85 PathProgramCache]: Analyzing trace with hash 142239015, now seen corresponding path program 4 times [2025-01-10 01:07:15,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:15,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121857989] [2025-01-10 01:07:15,898 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:07:15,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:15,904 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:07:15,908 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:07:15,908 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:07:15,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:07:16,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:16,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121857989] [2025-01-10 01:07:16,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121857989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:16,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:16,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:07:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816686482] [2025-01-10 01:07:16,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:16,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:07:16,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:16,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:07:16,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:07:16,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-01-10 01:07:16,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 288 transitions, 3299 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:16,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:16,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-01-10 01:07:16,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:16,513 INFO L124 PetriNetUnfolderBase]: 1652/3214 cut-off events. [2025-01-10 01:07:16,514 INFO L125 PetriNetUnfolderBase]: For 19102/19192 co-relation queries the response was YES. [2025-01-10 01:07:16,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15647 conditions, 3214 events. 1652/3214 cut-off events. For 19102/19192 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 21725 event pairs, 236 based on Foata normal form. 24/3201 useless extension candidates. Maximal degree in co-relation 14894. Up to 896 conditions per place. [2025-01-10 01:07:16,540 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 246 selfloop transitions, 144 changer transitions 0/406 dead transitions. [2025-01-10 01:07:16,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 406 transitions, 5012 flow [2025-01-10 01:07:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:07:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:07:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2025-01-10 01:07:16,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5637860082304527 [2025-01-10 01:07:16,541 INFO L175 Difference]: Start difference. First operand has 114 places, 288 transitions, 3299 flow. Second operand 9 states and 137 transitions. [2025-01-10 01:07:16,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 406 transitions, 5012 flow [2025-01-10 01:07:16,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 406 transitions, 5002 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-01-10 01:07:16,596 INFO L231 Difference]: Finished difference. Result has 124 places, 293 transitions, 3724 flow [2025-01-10 01:07:16,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=3289, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3724, PETRI_PLACES=124, PETRI_TRANSITIONS=293} [2025-01-10 01:07:16,598 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 95 predicate places. [2025-01-10 01:07:16,598 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 293 transitions, 3724 flow [2025-01-10 01:07:16,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:16,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:16,598 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:16,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:07:16,599 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:07:16,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1147980827, now seen corresponding path program 5 times [2025-01-10 01:07:16,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:16,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99153252] [2025-01-10 01:07:16,599 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:07:16,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:16,603 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:07:16,608 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:07:16,608 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:07:16,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:16,729 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:07:16,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:16,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99153252] [2025-01-10 01:07:16,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99153252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:16,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:16,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:07:16,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249056712] [2025-01-10 01:07:16,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:16,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:07:16,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:16,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:07:16,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:07:16,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-01-10 01:07:16,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 293 transitions, 3724 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:16,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:16,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-01-10 01:07:16,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:17,284 INFO L124 PetriNetUnfolderBase]: 2534/4523 cut-off events. [2025-01-10 01:07:17,285 INFO L125 PetriNetUnfolderBase]: For 35090/35256 co-relation queries the response was YES. [2025-01-10 01:07:17,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23898 conditions, 4523 events. 2534/4523 cut-off events. For 35090/35256 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 28898 event pairs, 31 based on Foata normal form. 92/4611 useless extension candidates. Maximal degree in co-relation 22765. Up to 1203 conditions per place. [2025-01-10 01:07:17,314 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 380 selfloop transitions, 204 changer transitions 0/599 dead transitions. [2025-01-10 01:07:17,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 599 transitions, 8592 flow [2025-01-10 01:07:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:07:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:07:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2025-01-10 01:07:17,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49794238683127573 [2025-01-10 01:07:17,316 INFO L175 Difference]: Start difference. First operand has 124 places, 293 transitions, 3724 flow. Second operand 9 states and 121 transitions. [2025-01-10 01:07:17,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 599 transitions, 8592 flow [2025-01-10 01:07:17,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 599 transitions, 8006 flow, removed 26 selfloop flow, removed 7 redundant places. [2025-01-10 01:07:17,400 INFO L231 Difference]: Finished difference. Result has 128 places, 408 transitions, 6017 flow [2025-01-10 01:07:17,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=3343, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6017, PETRI_PLACES=128, PETRI_TRANSITIONS=408} [2025-01-10 01:07:17,401 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 99 predicate places. [2025-01-10 01:07:17,401 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 408 transitions, 6017 flow [2025-01-10 01:07:17,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:17,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:17,402 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:17,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:07:17,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:07:17,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:17,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1484543462, now seen corresponding path program 3 times [2025-01-10 01:07:17,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:17,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498212143] [2025-01-10 01:07:17,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:07:17,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:17,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:07:17,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:07:17,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:07:17,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:18,030 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:07:18,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:18,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498212143] [2025-01-10 01:07:18,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498212143] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:18,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951512462] [2025-01-10 01:07:18,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:07:18,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:18,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:18,033 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:07:18,034 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:07:18,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:07:18,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:07:18,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:07:18,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:18,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:07:18,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:22,555 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:07:22,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:23,244 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:07:23,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951512462] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:23,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:23,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2025-01-10 01:07:23,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081539051] [2025-01-10 01:07:23,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:23,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:07:23,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:23,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:07:23,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=514, Unknown=1, NotChecked=0, Total=650 [2025-01-10 01:07:27,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:07:27,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-01-10 01:07:27,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 408 transitions, 6017 flow. Second operand has 26 states, 26 states have (on average 8.423076923076923) internal successors, (219), 26 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:27,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:27,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-01-10 01:07:27,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:38,392 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 45 DAG size of output: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-10 01:07:41,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:07:46,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:08:00,783 WARN L286 SmtUtils]: Spent 9.29s on a formula simplification. DAG size of input: 54 DAG size of output: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-10 01:08:04,450 INFO L124 PetriNetUnfolderBase]: 5693/9671 cut-off events. [2025-01-10 01:08:04,450 INFO L125 PetriNetUnfolderBase]: For 74942/74942 co-relation queries the response was YES. [2025-01-10 01:08:04,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54890 conditions, 9671 events. 5693/9671 cut-off events. For 74942/74942 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 64928 event pairs, 94 based on Foata normal form. 11/9682 useless extension candidates. Maximal degree in co-relation 49702. Up to 3586 conditions per place. [2025-01-10 01:08:04,503 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 649 selfloop transitions, 442 changer transitions 104/1198 dead transitions. [2025-01-10 01:08:04,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 1198 transitions, 17010 flow [2025-01-10 01:08:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-01-10 01:08:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2025-01-10 01:08:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 842 transitions. [2025-01-10 01:08:04,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4331275720164609 [2025-01-10 01:08:04,506 INFO L175 Difference]: Start difference. First operand has 128 places, 408 transitions, 6017 flow. Second operand 72 states and 842 transitions. [2025-01-10 01:08:04,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 1198 transitions, 17010 flow [2025-01-10 01:08:04,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 1198 transitions, 16881 flow, removed 61 selfloop flow, removed 2 redundant places. [2025-01-10 01:08:04,823 INFO L231 Difference]: Finished difference. Result has 233 places, 783 transitions, 12682 flow [2025-01-10 01:08:04,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=5996, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=12682, PETRI_PLACES=233, PETRI_TRANSITIONS=783} [2025-01-10 01:08:04,824 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 204 predicate places. [2025-01-10 01:08:04,824 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 783 transitions, 12682 flow [2025-01-10 01:08:04,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.423076923076923) internal successors, (219), 26 states have internal predecessors, (219), 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:08:04,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:04,825 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:04,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:08:05,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:05,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 01:08:05,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:05,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1729312354, now seen corresponding path program 4 times [2025-01-10 01:08:05,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:05,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569110457] [2025-01-10 01:08:05,027 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:08:05,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:05,030 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:08:05,059 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:08:05,062 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:08:05,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:05,847 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:08:05,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:05,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569110457] [2025-01-10 01:08:05,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569110457] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:05,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332382278] [2025-01-10 01:08:05,847 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:08:05,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:05,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:05,852 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:08:05,853 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:08:05,883 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:08:05,902 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:08:05,902 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:08:05,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:05,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:08:05,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:10,681 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:08:10,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:11,879 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:08:11,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332382278] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:11,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:11,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2025-01-10 01:08:11,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249768415] [2025-01-10 01:08:11,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:11,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:08:11,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:11,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:08:11,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=435, Unknown=1, NotChecked=0, Total=552 [2025-01-10 01:08:16,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:08:20,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:08:20,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-01-10 01:08:20,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 783 transitions, 12682 flow. Second operand has 24 states, 24 states have (on average 9.5) internal successors, (228), 24 states have internal predecessors, (228), 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:08:20,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:20,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-01-10 01:08:20,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:37,013 WARN L286 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 42 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)