./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/bigshot_s.i --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/pthread/bigshot_s.i -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 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:34:34,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:34:34,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:34:34,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:34:34,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:34:34,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:34:34,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:34:34,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:34:34,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:34:34,864 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:34:34,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:34:34,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:34:34,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:34:34,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:34:34,865 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:34:34,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:34:34,865 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:34:34,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:34:34,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:34:34,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:34:34,866 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:34:34,866 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:34:34,866 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:34:34,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:34:34,866 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:34:34,866 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:34:34,866 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:34:34,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:34:34,866 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:34:34,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:34:34,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:34:34,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:34:34,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:34:34,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:34:34,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:34:34,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:34:34,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:34:34,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:34:34,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:34:34,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:34:34,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:34:34,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:34:34,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:34:34,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:34:34,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:34:34,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:34:34,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:34:34,867 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 -> 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe [2025-01-10 00:34:35,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:34:35,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:34:35,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:34:35,082 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:34:35,082 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:34:35,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/bigshot_s.i [2025-01-10 00:34:36,295 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41ed07f10/600452c9cc0348a0823802cd060398ea/FLAG3f98d80da [2025-01-10 00:34:36,653 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:34:36,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/bigshot_s.i [2025-01-10 00:34:36,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41ed07f10/600452c9cc0348a0823802cd060398ea/FLAG3f98d80da [2025-01-10 00:34:36,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41ed07f10/600452c9cc0348a0823802cd060398ea [2025-01-10 00:34:36,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:34:36,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:34:36,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:34:36,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:34:36,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:34:36,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:34:36" (1/1) ... [2025-01-10 00:34:36,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b915e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:36, skipping insertion in model container [2025-01-10 00:34:36,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:34:36" (1/1) ... [2025-01-10 00:34:36,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:34:37,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:34:37,445 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:34:37,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:34:37,550 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:34:37,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:37 WrapperNode [2025-01-10 00:34:37,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:34:37,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:34:37,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:34:37,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:34:37,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:37" (1/1) ... [2025-01-10 00:34:37,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:37" (1/1) ... [2025-01-10 00:34:37,595 INFO L138 Inliner]: procedures = 322, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2025-01-10 00:34:37,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:34:37,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:34:37,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:34:37,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:34:37,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:37" (1/1) ... [2025-01-10 00:34:37,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:37" (1/1) ... [2025-01-10 00:34:37,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:37" (1/1) ... [2025-01-10 00:34:37,627 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 9, 2]. 69 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 1 writes are split as follows [0, 0, 1]. [2025-01-10 00:34:37,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:37" (1/1) ... [2025-01-10 00:34:37,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:37" (1/1) ... [2025-01-10 00:34:37,633 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:37" (1/1) ... [2025-01-10 00:34:37,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:37" (1/1) ... [2025-01-10 00:34:37,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:37" (1/1) ... [2025-01-10 00:34:37,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:37" (1/1) ... [2025-01-10 00:34:37,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:37" (1/1) ... [2025-01-10 00:34:37,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:34:37,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:34:37,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:34:37,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:34:37,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:37" (1/1) ... [2025-01-10 00:34:37,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:34:37,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:34:37,678 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 00:34:37,680 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 00:34:37,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-10 00:34:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-10 00:34:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-10 00:34:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:34:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:34:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:34:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 00:34:37,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 00:34:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 00:34:37,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 00:34:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:34:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:34:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:34:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:34:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:34:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:34:37,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:34:37,702 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 00:34:37,804 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:34:37,805 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:34:37,945 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:34:37,945 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:34:38,002 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:34:38,003 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 00:34:38,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:34:38 BoogieIcfgContainer [2025-01-10 00:34:38,003 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:34:38,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:34:38,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:34:38,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:34:38,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:34:36" (1/3) ... [2025-01-10 00:34:38,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a505624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:34:38, skipping insertion in model container [2025-01-10 00:34:38,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:34:37" (2/3) ... [2025-01-10 00:34:38,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a505624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:34:38, skipping insertion in model container [2025-01-10 00:34:38,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:34:38" (3/3) ... [2025-01-10 00:34:38,013 INFO L128 eAbstractionObserver]: Analyzing ICFG bigshot_s.i [2025-01-10 00:34:38,027 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:34:38,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bigshot_s.i that has 3 procedures, 42 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-01-10 00:34:38,035 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:34:38,108 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:34:38,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 108 flow [2025-01-10 00:34:38,204 INFO L124 PetriNetUnfolderBase]: 6/45 cut-off events. [2025-01-10 00:34:38,205 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:34:38,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 45 events. 6/45 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 72 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-01-10 00:34:38,211 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 47 transitions, 108 flow [2025-01-10 00:34:38,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 44 transitions, 100 flow [2025-01-10 00:34:38,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:34:38,233 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;@32ca0339, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:34:38,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-10 00:34:38,239 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:34:38,241 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2025-01-10 00:34:38,241 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:34:38,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:38,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:38,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:38,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:38,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1745696950, now seen corresponding path program 1 times [2025-01-10 00:34:38,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:38,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333731679] [2025-01-10 00:34:38,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:34:38,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:38,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:34:38,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:34:38,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:38,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:38,573 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 00:34:38,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:38,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333731679] [2025-01-10 00:34:38,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333731679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:34:38,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:34:38,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:34:38,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917873478] [2025-01-10 00:34:38,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:34:38,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:34:38,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:38,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:34:38,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:34:38,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2025-01-10 00:34:38,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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 00:34:38,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:38,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2025-01-10 00:34:38,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:38,772 INFO L124 PetriNetUnfolderBase]: 11/60 cut-off events. [2025-01-10 00:34:38,772 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:34:38,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 60 events. 11/60 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 143 event pairs, 3 based on Foata normal form. 2/51 useless extension candidates. Maximal degree in co-relation 84. Up to 24 conditions per place. [2025-01-10 00:34:38,773 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 19 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2025-01-10 00:34:38,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 134 flow [2025-01-10 00:34:38,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:34:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:34:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-01-10 00:34:38,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5478723404255319 [2025-01-10 00:34:38,801 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 100 flow. Second operand 4 states and 103 transitions. [2025-01-10 00:34:38,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 134 flow [2025-01-10 00:34:38,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:34:38,810 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 86 flow [2025-01-10 00:34:38,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-01-10 00:34:38,817 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2025-01-10 00:34:38,818 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 86 flow [2025-01-10 00:34:38,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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 00:34:38,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:38,818 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:38,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:34:38,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:38,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:38,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1717969130, now seen corresponding path program 1 times [2025-01-10 00:34:38,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:38,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801239560] [2025-01-10 00:34:38,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:34:38,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:38,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:34:38,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:34:38,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:38,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:38,984 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 00:34:38,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:38,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801239560] [2025-01-10 00:34:38,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801239560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:34:38,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:34:38,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:34:38,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126158349] [2025-01-10 00:34:38,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:34:38,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:34:38,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:38,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:34:38,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:34:39,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-01-10 00:34:39,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:34:39,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:39,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-01-10 00:34:39,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:39,149 INFO L124 PetriNetUnfolderBase]: 16/76 cut-off events. [2025-01-10 00:34:39,149 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 00:34:39,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 76 events. 16/76 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 178 event pairs, 7 based on Foata normal form. 2/63 useless extension candidates. Maximal degree in co-relation 53. Up to 40 conditions per place. [2025-01-10 00:34:39,150 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 22 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2025-01-10 00:34:39,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 148 flow [2025-01-10 00:34:39,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:34:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:34:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-01-10 00:34:39,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2025-01-10 00:34:39,151 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 86 flow. Second operand 4 states and 108 transitions. [2025-01-10 00:34:39,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 148 flow [2025-01-10 00:34:39,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:34:39,153 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 103 flow [2025-01-10 00:34:39,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2025-01-10 00:34:39,154 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2025-01-10 00:34:39,154 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 103 flow [2025-01-10 00:34:39,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:34:39,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:39,154 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:39,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:34:39,155 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:39,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:39,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1717435208, now seen corresponding path program 1 times [2025-01-10 00:34:39,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:39,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297022322] [2025-01-10 00:34:39,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:34:39,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:39,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:34:39,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:34:39,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:39,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:39,202 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 00:34:39,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:39,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297022322] [2025-01-10 00:34:39,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297022322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:34:39,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:34:39,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:34:39,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876793490] [2025-01-10 00:34:39,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:34:39,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:34:39,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:39,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:34:39,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:34:39,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2025-01-10 00:34:39,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:34:39,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:39,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2025-01-10 00:34:39,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:39,266 INFO L124 PetriNetUnfolderBase]: 15/77 cut-off events. [2025-01-10 00:34:39,266 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 00:34:39,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 77 events. 15/77 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 176 event pairs, 1 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 49. Up to 20 conditions per place. [2025-01-10 00:34:39,267 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 19 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-01-10 00:34:39,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 149 flow [2025-01-10 00:34:39,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:34:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:34:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-01-10 00:34:39,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5691489361702128 [2025-01-10 00:34:39,269 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 103 flow. Second operand 4 states and 107 transitions. [2025-01-10 00:34:39,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 149 flow [2025-01-10 00:34:39,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:34:39,270 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 102 flow [2025-01-10 00:34:39,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-01-10 00:34:39,270 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2025-01-10 00:34:39,270 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 102 flow [2025-01-10 00:34:39,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:34:39,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:39,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:39,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:34:39,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:39,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash -850989204, now seen corresponding path program 1 times [2025-01-10 00:34:39,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:39,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410719583] [2025-01-10 00:34:39,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:34:39,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:39,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:34:39,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:34:39,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:39,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:39,385 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 00:34:39,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:39,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410719583] [2025-01-10 00:34:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410719583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:34:39,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:34:39,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:34:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029494010] [2025-01-10 00:34:39,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:34:39,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:34:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:39,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:34:39,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:34:39,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2025-01-10 00:34:39,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 00:34:39,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:39,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2025-01-10 00:34:39,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:39,480 INFO L124 PetriNetUnfolderBase]: 14/66 cut-off events. [2025-01-10 00:34:39,480 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-10 00:34:39,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 66 events. 14/66 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 133 event pairs, 4 based on Foata normal form. 2/62 useless extension candidates. Maximal degree in co-relation 49. Up to 31 conditions per place. [2025-01-10 00:34:39,481 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 20 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-01-10 00:34:39,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 154 flow [2025-01-10 00:34:39,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:34:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:34:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-01-10 00:34:39,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6063829787234043 [2025-01-10 00:34:39,482 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 102 flow. Second operand 4 states and 114 transitions. [2025-01-10 00:34:39,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 154 flow [2025-01-10 00:34:39,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:34:39,483 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 105 flow [2025-01-10 00:34:39,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-01-10 00:34:39,484 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2025-01-10 00:34:39,484 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 105 flow [2025-01-10 00:34:39,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 00:34:39,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:39,484 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:39,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:34:39,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:39,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:39,485 INFO L85 PathProgramCache]: Analyzing trace with hash -391476111, now seen corresponding path program 1 times [2025-01-10 00:34:39,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:39,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625851692] [2025-01-10 00:34:39,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:34:39,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:39,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:34:39,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:34:39,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:39,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:39,654 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 00:34:39,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:39,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625851692] [2025-01-10 00:34:39,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625851692] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:34:39,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915729356] [2025-01-10 00:34:39,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:34:39,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:39,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:34:39,661 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 00:34:39,661 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 00:34:39,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:34:39,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:34:39,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:39,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:39,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 00:34:39,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:34:39,792 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:34:39,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-10 00:34:39,820 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:34:39,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:34:39,968 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 00:34:39,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:34:40,089 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 00:34:40,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915729356] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:34:40,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:34:40,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-01-10 00:34:40,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012709646] [2025-01-10 00:34:40,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:34:40,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:34:40,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:40,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:34:40,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:34:40,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2025-01-10 00:34:40,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 105 flow. Second operand has 14 states, 14 states have (on average 21.0) internal successors, (294), 14 states have internal predecessors, (294), 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 00:34:40,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:40,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2025-01-10 00:34:40,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:40,717 INFO L124 PetriNetUnfolderBase]: 33/126 cut-off events. [2025-01-10 00:34:40,718 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-01-10 00:34:40,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 126 events. 33/126 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 221 event pairs, 6 based on Foata normal form. 12/135 useless extension candidates. Maximal degree in co-relation 95. Up to 38 conditions per place. [2025-01-10 00:34:40,719 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 32 selfloop transitions, 11 changer transitions 0/55 dead transitions. [2025-01-10 00:34:40,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 233 flow [2025-01-10 00:34:40,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:34:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:34:40,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2025-01-10 00:34:40,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2025-01-10 00:34:40,720 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 105 flow. Second operand 7 states and 175 transitions. [2025-01-10 00:34:40,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 233 flow [2025-01-10 00:34:40,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 225 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:34:40,721 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 159 flow [2025-01-10 00:34:40,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2025-01-10 00:34:40,722 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-01-10 00:34:40,722 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 159 flow [2025-01-10 00:34:40,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.0) internal successors, (294), 14 states have internal predecessors, (294), 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 00:34:40,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:40,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:40,729 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 00:34:40,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:40,927 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:40,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1646348453, now seen corresponding path program 1 times [2025-01-10 00:34:40,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:40,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817649294] [2025-01-10 00:34:40,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:34:40,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:40,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:34:40,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:34:40,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:40,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:40,954 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 00:34:40,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:40,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817649294] [2025-01-10 00:34:40,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817649294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:34:40,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:34:40,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:34:40,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871588213] [2025-01-10 00:34:40,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:34:40,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:34:40,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:40,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:34:40,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:34:40,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 47 [2025-01-10 00:34:40,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 00:34:40,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:40,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 47 [2025-01-10 00:34:40,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:40,993 INFO L124 PetriNetUnfolderBase]: 21/109 cut-off events. [2025-01-10 00:34:40,993 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-01-10 00:34:40,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 109 events. 21/109 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 206 event pairs, 11 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 171. Up to 51 conditions per place. [2025-01-10 00:34:40,994 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 24 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2025-01-10 00:34:40,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 209 flow [2025-01-10 00:34:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:34:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:34:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-01-10 00:34:40,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6312056737588653 [2025-01-10 00:34:40,995 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 159 flow. Second operand 3 states and 89 transitions. [2025-01-10 00:34:40,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 209 flow [2025-01-10 00:34:40,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 193 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-01-10 00:34:40,997 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 143 flow [2025-01-10 00:34:40,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2025-01-10 00:34:40,998 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-01-10 00:34:40,998 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 143 flow [2025-01-10 00:34:40,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 00:34:40,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:40,998 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:40,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:34:40,998 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:40,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:40,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1748588019, now seen corresponding path program 1 times [2025-01-10 00:34:40,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:40,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929379679] [2025-01-10 00:34:40,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:34:40,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:41,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:34:41,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:34:41,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:41,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:34:41,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:41,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929379679] [2025-01-10 00:34:41,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929379679] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:34:41,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338992181] [2025-01-10 00:34:41,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:34:41,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:41,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:34:41,116 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 00:34:41,119 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 00:34:41,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:34:41,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:34:41,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:41,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:41,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 00:34:41,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:34:41,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:34:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:34:41,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:34:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:34:41,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338992181] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:34:41,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:34:41,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 00:34:41,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085747450] [2025-01-10 00:34:41,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:34:41,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:34:41,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:41,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:34:41,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:34:41,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2025-01-10 00:34:41,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 143 flow. Second operand has 11 states, 11 states have (on average 23.727272727272727) internal successors, (261), 11 states have internal predecessors, (261), 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 00:34:41,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:41,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2025-01-10 00:34:41,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:41,643 INFO L124 PetriNetUnfolderBase]: 26/115 cut-off events. [2025-01-10 00:34:41,644 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-01-10 00:34:41,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 115 events. 26/115 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 190 event pairs, 4 based on Foata normal form. 6/117 useless extension candidates. Maximal degree in co-relation 231. Up to 30 conditions per place. [2025-01-10 00:34:41,645 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 27 selfloop transitions, 11 changer transitions 0/52 dead transitions. [2025-01-10 00:34:41,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 243 flow [2025-01-10 00:34:41,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:34:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:34:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2025-01-10 00:34:41,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-10 00:34:41,647 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 143 flow. Second operand 7 states and 188 transitions. [2025-01-10 00:34:41,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 243 flow [2025-01-10 00:34:41,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:34:41,649 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 192 flow [2025-01-10 00:34:41,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2025-01-10 00:34:41,649 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2025-01-10 00:34:41,649 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 192 flow [2025-01-10 00:34:41,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.727272727272727) internal successors, (261), 11 states have internal predecessors, (261), 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 00:34:41,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:41,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:41,657 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 00:34:41,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:41,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:41,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:41,856 INFO L85 PathProgramCache]: Analyzing trace with hash 177837018, now seen corresponding path program 1 times [2025-01-10 00:34:41,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:41,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209779595] [2025-01-10 00:34:41,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:34:41,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:41,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 00:34:41,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 00:34:41,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:41,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:41,902 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 00:34:41,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:41,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209779595] [2025-01-10 00:34:41,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209779595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:34:41,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:34:41,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:34:41,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867270580] [2025-01-10 00:34:41,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:34:41,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:34:41,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:41,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:34:41,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:34:41,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-01-10 00:34:41,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 00:34:41,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:41,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-01-10 00:34:41,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:41,959 INFO L124 PetriNetUnfolderBase]: 20/108 cut-off events. [2025-01-10 00:34:41,960 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-01-10 00:34:41,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 108 events. 20/108 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 183 event pairs, 11 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 263. Up to 51 conditions per place. [2025-01-10 00:34:41,961 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 24 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2025-01-10 00:34:41,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 41 transitions, 246 flow [2025-01-10 00:34:41,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:34:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:34:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-01-10 00:34:41,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5425531914893617 [2025-01-10 00:34:41,963 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 192 flow. Second operand 4 states and 102 transitions. [2025-01-10 00:34:41,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 41 transitions, 246 flow [2025-01-10 00:34:41,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 41 transitions, 232 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 00:34:41,965 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 182 flow [2025-01-10 00:34:41,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-01-10 00:34:41,965 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2025-01-10 00:34:41,965 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 182 flow [2025-01-10 00:34:41,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 00:34:41,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:41,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:41,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:34:41,966 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:41,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:41,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1253845180, now seen corresponding path program 1 times [2025-01-10 00:34:41,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:41,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222389990] [2025-01-10 00:34:41,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:34:41,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:41,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:34:41,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:34:41,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:41,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:42,187 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 00:34:42,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:42,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222389990] [2025-01-10 00:34:42,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222389990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:34:42,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:34:42,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:34:42,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544469656] [2025-01-10 00:34:42,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:34:42,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:34:42,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:42,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:34:42,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:34:42,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2025-01-10 00:34:42,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 182 flow. Second operand has 9 states, 9 states have (on average 20.22222222222222) internal successors, (182), 9 states have internal predecessors, (182), 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 00:34:42,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:42,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2025-01-10 00:34:42,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:42,412 INFO L124 PetriNetUnfolderBase]: 24/129 cut-off events. [2025-01-10 00:34:42,412 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-01-10 00:34:42,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 129 events. 24/129 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 263 event pairs, 12 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 303. Up to 53 conditions per place. [2025-01-10 00:34:42,413 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 31 selfloop transitions, 12 changer transitions 0/55 dead transitions. [2025-01-10 00:34:42,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 55 transitions, 303 flow [2025-01-10 00:34:42,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:34:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:34:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 256 transitions. [2025-01-10 00:34:42,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45390070921985815 [2025-01-10 00:34:42,416 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 182 flow. Second operand 12 states and 256 transitions. [2025-01-10 00:34:42,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 55 transitions, 303 flow [2025-01-10 00:34:42,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 55 transitions, 293 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:34:42,419 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 240 flow [2025-01-10 00:34:42,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=240, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2025-01-10 00:34:42,420 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2025-01-10 00:34:42,421 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 240 flow [2025-01-10 00:34:42,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.22222222222222) internal successors, (182), 9 states have internal predecessors, (182), 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 00:34:42,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:42,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:42,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:34:42,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:42,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:42,422 INFO L85 PathProgramCache]: Analyzing trace with hash 391753353, now seen corresponding path program 1 times [2025-01-10 00:34:42,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:42,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149932432] [2025-01-10 00:34:42,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:34:42,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:42,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:34:42,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:34:42,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:42,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:42,613 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 00:34:42,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:42,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149932432] [2025-01-10 00:34:42,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149932432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:34:42,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:34:42,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:34:42,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187782576] [2025-01-10 00:34:42,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:34:42,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:34:42,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:42,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:34:42,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:34:42,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2025-01-10 00:34:42,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 240 flow. Second operand has 9 states, 9 states have (on average 21.0) internal successors, (189), 9 states have internal predecessors, (189), 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 00:34:42,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:42,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2025-01-10 00:34:42,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:42,884 INFO L124 PetriNetUnfolderBase]: 20/121 cut-off events. [2025-01-10 00:34:42,887 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2025-01-10 00:34:42,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 121 events. 20/121 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 238 event pairs, 9 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 326. Up to 45 conditions per place. [2025-01-10 00:34:42,888 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 24 selfloop transitions, 7 changer transitions 8/53 dead transitions. [2025-01-10 00:34:42,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 53 transitions, 329 flow [2025-01-10 00:34:42,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:34:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:34:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2025-01-10 00:34:42,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4808510638297872 [2025-01-10 00:34:42,897 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 240 flow. Second operand 10 states and 226 transitions. [2025-01-10 00:34:42,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 53 transitions, 329 flow [2025-01-10 00:34:42,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 53 transitions, 319 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:34:42,900 INFO L231 Difference]: Finished difference. Result has 73 places, 42 transitions, 215 flow [2025-01-10 00:34:42,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=215, PETRI_PLACES=73, PETRI_TRANSITIONS=42} [2025-01-10 00:34:42,904 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2025-01-10 00:34:42,904 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 42 transitions, 215 flow [2025-01-10 00:34:42,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.0) internal successors, (189), 9 states have internal predecessors, (189), 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 00:34:42,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:42,905 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:42,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:34:42,905 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:42,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:42,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2058489303, now seen corresponding path program 1 times [2025-01-10 00:34:42,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:42,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110134949] [2025-01-10 00:34:42,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:34:42,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:42,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 00:34:42,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 00:34:42,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:42,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:34:43,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:43,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110134949] [2025-01-10 00:34:43,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110134949] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:34:43,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317972761] [2025-01-10 00:34:43,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:34:43,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:43,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:34:43,191 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 00:34:43,194 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 00:34:43,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 00:34:43,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 00:34:43,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:43,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:43,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:34:43,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:34:43,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 00:34:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:34:43,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:34:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:34:43,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317972761] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:34:43,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:34:43,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 00:34:43,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052053650] [2025-01-10 00:34:43,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:34:43,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:34:43,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:43,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:34:43,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:34:43,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 47 [2025-01-10 00:34:43,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 42 transitions, 215 flow. Second operand has 14 states, 14 states have (on average 26.071428571428573) internal successors, (365), 14 states have internal predecessors, (365), 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 00:34:43,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:43,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 47 [2025-01-10 00:34:43,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:43,735 INFO L124 PetriNetUnfolderBase]: 19/110 cut-off events. [2025-01-10 00:34:43,735 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-01-10 00:34:43,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 110 events. 19/110 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 182 event pairs, 9 based on Foata normal form. 2/111 useless extension candidates. Maximal degree in co-relation 293. Up to 41 conditions per place. [2025-01-10 00:34:43,736 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 24 selfloop transitions, 6 changer transitions 1/46 dead transitions. [2025-01-10 00:34:43,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 46 transitions, 280 flow [2025-01-10 00:34:43,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:34:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:34:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions. [2025-01-10 00:34:43,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5805471124620061 [2025-01-10 00:34:43,738 INFO L175 Difference]: Start difference. First operand has 73 places, 42 transitions, 215 flow. Second operand 7 states and 191 transitions. [2025-01-10 00:34:43,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 46 transitions, 280 flow [2025-01-10 00:34:43,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 46 transitions, 258 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-01-10 00:34:43,740 INFO L231 Difference]: Finished difference. Result has 65 places, 41 transitions, 203 flow [2025-01-10 00:34:43,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=65, PETRI_TRANSITIONS=41} [2025-01-10 00:34:43,740 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places. [2025-01-10 00:34:43,740 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 203 flow [2025-01-10 00:34:43,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 26.071428571428573) internal successors, (365), 14 states have internal predecessors, (365), 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 00:34:43,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:43,741 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:43,750 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 00:34:43,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:43,942 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:43,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:43,942 INFO L85 PathProgramCache]: Analyzing trace with hash -485710670, now seen corresponding path program 2 times [2025-01-10 00:34:43,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:43,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033908612] [2025-01-10 00:34:43,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:34:43,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:43,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 00:34:43,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 00:34:43,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:34:43,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:34:44,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:44,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033908612] [2025-01-10 00:34:44,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033908612] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:34:44,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502105502] [2025-01-10 00:34:44,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:34:44,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:44,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:34:44,139 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 00:34:44,143 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 00:34:44,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 00:34:44,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 00:34:44,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:34:44,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:44,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 00:34:44,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:34:44,234 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:34:44,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:34:44,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:34:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:34:44,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:34:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:34:44,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502105502] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:34:44,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:34:44,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-01-10 00:34:44,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942008755] [2025-01-10 00:34:44,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:34:44,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 00:34:44,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:44,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 00:34:44,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-01-10 00:34:45,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2025-01-10 00:34:45,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 41 transitions, 203 flow. Second operand has 23 states, 23 states have (on average 21.391304347826086) internal successors, (492), 23 states have internal predecessors, (492), 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 00:34:45,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:45,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2025-01-10 00:34:45,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:45,671 INFO L124 PetriNetUnfolderBase]: 50/197 cut-off events. [2025-01-10 00:34:45,672 INFO L125 PetriNetUnfolderBase]: For 361/361 co-relation queries the response was YES. [2025-01-10 00:34:45,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 197 events. 50/197 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 313 event pairs, 6 based on Foata normal form. 8/204 useless extension candidates. Maximal degree in co-relation 590. Up to 40 conditions per place. [2025-01-10 00:34:45,673 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 47 selfloop transitions, 17 changer transitions 0/76 dead transitions. [2025-01-10 00:34:45,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 491 flow [2025-01-10 00:34:45,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:34:45,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 00:34:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 266 transitions. [2025-01-10 00:34:45,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5145067698259188 [2025-01-10 00:34:45,675 INFO L175 Difference]: Start difference. First operand has 65 places, 41 transitions, 203 flow. Second operand 11 states and 266 transitions. [2025-01-10 00:34:45,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 491 flow [2025-01-10 00:34:45,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 76 transitions, 479 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 00:34:45,678 INFO L231 Difference]: Finished difference. Result has 74 places, 50 transitions, 335 flow [2025-01-10 00:34:45,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=335, PETRI_PLACES=74, PETRI_TRANSITIONS=50} [2025-01-10 00:34:45,679 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2025-01-10 00:34:45,679 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 50 transitions, 335 flow [2025-01-10 00:34:45,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 21.391304347826086) internal successors, (492), 23 states have internal predecessors, (492), 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 00:34:45,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:45,679 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:45,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:34:45,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 00:34:45,880 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:45,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:45,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1383490036, now seen corresponding path program 2 times [2025-01-10 00:34:45,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:45,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216408757] [2025-01-10 00:34:45,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:34:45,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:45,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 00:34:45,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 37 statements. [2025-01-10 00:34:45,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:34:45,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-10 00:34:45,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:45,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216408757] [2025-01-10 00:34:45,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216408757] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:34:45,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444707101] [2025-01-10 00:34:45,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:34:45,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:45,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:34:45,993 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:34:45,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:34:46,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 00:34:46,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 37 statements. [2025-01-10 00:34:46,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:34:46,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:46,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 00:34:46,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:34:46,070 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:34:46,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:34:46,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:34:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-10 00:34:46,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:34:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-10 00:34:46,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444707101] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:34:46,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:34:46,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-01-10 00:34:46,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398334878] [2025-01-10 00:34:46,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:34:46,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:34:46,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:46,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:34:46,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:34:47,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2025-01-10 00:34:47,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 50 transitions, 335 flow. Second operand has 14 states, 14 states have (on average 22.214285714285715) internal successors, (311), 14 states have internal predecessors, (311), 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 00:34:47,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:47,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2025-01-10 00:34:47,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:47,149 INFO L124 PetriNetUnfolderBase]: 57/196 cut-off events. [2025-01-10 00:34:47,149 INFO L125 PetriNetUnfolderBase]: For 583/583 co-relation queries the response was YES. [2025-01-10 00:34:47,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 196 events. 57/196 cut-off events. For 583/583 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 279 event pairs, 2 based on Foata normal form. 8/203 useless extension candidates. Maximal degree in co-relation 634. Up to 80 conditions per place. [2025-01-10 00:34:47,150 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 24 selfloop transitions, 20 changer transitions 0/54 dead transitions. [2025-01-10 00:34:47,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 54 transitions, 425 flow [2025-01-10 00:34:47,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:34:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:34:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2025-01-10 00:34:47,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 00:34:47,152 INFO L175 Difference]: Start difference. First operand has 74 places, 50 transitions, 335 flow. Second operand 6 states and 141 transitions. [2025-01-10 00:34:47,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 54 transitions, 425 flow [2025-01-10 00:34:47,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 54 transitions, 398 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 00:34:47,155 INFO L231 Difference]: Finished difference. Result has 71 places, 50 transitions, 355 flow [2025-01-10 00:34:47,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=71, PETRI_TRANSITIONS=50} [2025-01-10 00:34:47,156 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2025-01-10 00:34:47,157 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 50 transitions, 355 flow [2025-01-10 00:34:47,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 22.214285714285715) internal successors, (311), 14 states have internal predecessors, (311), 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 00:34:47,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:47,157 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:47,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 00:34:47,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 00:34:47,361 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:47,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1894038446, now seen corresponding path program 2 times [2025-01-10 00:34:47,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:47,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575622887] [2025-01-10 00:34:47,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:34:47,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:47,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-10 00:34:47,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:34:47,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:34:47,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:34:47,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:47,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575622887] [2025-01-10 00:34:47,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575622887] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:34:47,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277833539] [2025-01-10 00:34:47,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:34:47,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:47,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:34:47,510 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:34:47,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:34:47,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-10 00:34:47,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:34:47,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:34:47,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:47,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 00:34:47,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:34:47,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 00:34:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:34:47,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:34:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:34:47,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277833539] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:34:47,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:34:47,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-01-10 00:34:47,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383216289] [2025-01-10 00:34:47,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:34:47,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 00:34:47,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:47,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 00:34:47,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:34:47,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 47 [2025-01-10 00:34:47,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 50 transitions, 355 flow. Second operand has 17 states, 17 states have (on average 25.88235294117647) internal successors, (440), 17 states have internal predecessors, (440), 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 00:34:47,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:47,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 47 [2025-01-10 00:34:47,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:48,141 INFO L124 PetriNetUnfolderBase]: 35/172 cut-off events. [2025-01-10 00:34:48,142 INFO L125 PetriNetUnfolderBase]: For 633/633 co-relation queries the response was YES. [2025-01-10 00:34:48,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 172 events. 35/172 cut-off events. For 633/633 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 251 event pairs, 18 based on Foata normal form. 2/173 useless extension candidates. Maximal degree in co-relation 562. Up to 74 conditions per place. [2025-01-10 00:34:48,143 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 32 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2025-01-10 00:34:48,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 55 transitions, 437 flow [2025-01-10 00:34:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:34:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:34:48,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions. [2025-01-10 00:34:48,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2025-01-10 00:34:48,146 INFO L175 Difference]: Start difference. First operand has 71 places, 50 transitions, 355 flow. Second operand 8 states and 216 transitions. [2025-01-10 00:34:48,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 55 transitions, 437 flow [2025-01-10 00:34:48,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 55 transitions, 410 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:34:48,148 INFO L231 Difference]: Finished difference. Result has 76 places, 50 transitions, 344 flow [2025-01-10 00:34:48,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=344, PETRI_PLACES=76, PETRI_TRANSITIONS=50} [2025-01-10 00:34:48,148 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2025-01-10 00:34:48,148 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 50 transitions, 344 flow [2025-01-10 00:34:48,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 25.88235294117647) internal successors, (440), 17 states have internal predecessors, (440), 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 00:34:48,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:48,150 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:48,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 00:34:48,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 00:34:48,354 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:48,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:48,355 INFO L85 PathProgramCache]: Analyzing trace with hash 784914715, now seen corresponding path program 3 times [2025-01-10 00:34:48,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:48,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024377855] [2025-01-10 00:34:48,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:34:48,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:48,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 5 equivalence classes. [2025-01-10 00:34:48,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:34:48,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-10 00:34:48,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:34:49,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:49,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024377855] [2025-01-10 00:34:49,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024377855] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:34:49,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500119680] [2025-01-10 00:34:49,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:34:49,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:49,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:34:49,011 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:34:49,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:34:49,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 5 equivalence classes. [2025-01-10 00:34:49,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:34:49,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-10 00:34:49,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:49,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 00:34:49,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:34:49,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 00:34:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:34:49,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:34:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:34:49,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500119680] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:34:49,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:34:49,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2025-01-10 00:34:49,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320479170] [2025-01-10 00:34:49,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:34:49,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 00:34:49,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:49,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 00:34:49,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2025-01-10 00:34:50,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2025-01-10 00:34:50,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 50 transitions, 344 flow. Second operand has 26 states, 26 states have (on average 19.53846153846154) internal successors, (508), 26 states have internal predecessors, (508), 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 00:34:50,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:50,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2025-01-10 00:34:50,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:50,726 INFO L124 PetriNetUnfolderBase]: 48/183 cut-off events. [2025-01-10 00:34:50,726 INFO L125 PetriNetUnfolderBase]: For 588/588 co-relation queries the response was YES. [2025-01-10 00:34:50,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 183 events. 48/183 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 257 event pairs, 21 based on Foata normal form. 2/184 useless extension candidates. Maximal degree in co-relation 615. Up to 84 conditions per place. [2025-01-10 00:34:50,728 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 45 selfloop transitions, 13 changer transitions 0/65 dead transitions. [2025-01-10 00:34:50,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 65 transitions, 511 flow [2025-01-10 00:34:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:34:50,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:34:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 260 transitions. [2025-01-10 00:34:50,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2025-01-10 00:34:50,729 INFO L175 Difference]: Start difference. First operand has 76 places, 50 transitions, 344 flow. Second operand 13 states and 260 transitions. [2025-01-10 00:34:50,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 65 transitions, 511 flow [2025-01-10 00:34:50,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 65 transitions, 495 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-01-10 00:34:50,733 INFO L231 Difference]: Finished difference. Result has 84 places, 50 transitions, 359 flow [2025-01-10 00:34:50,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=359, PETRI_PLACES=84, PETRI_TRANSITIONS=50} [2025-01-10 00:34:50,735 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2025-01-10 00:34:50,735 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 50 transitions, 359 flow [2025-01-10 00:34:50,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 19.53846153846154) internal successors, (508), 26 states have internal predecessors, (508), 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 00:34:50,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:50,735 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:50,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 00:34:50,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:50,938 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:50,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:50,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1620704952, now seen corresponding path program 4 times [2025-01-10 00:34:50,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:50,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832091864] [2025-01-10 00:34:50,939 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:34:50,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:50,947 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-01-10 00:34:50,958 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:34:50,959 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:34:50,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:34:51,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:51,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832091864] [2025-01-10 00:34:51,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832091864] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:34:51,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917794592] [2025-01-10 00:34:51,110 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:34:51,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:51,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:34:51,112 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:34:51,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:34:51,155 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-01-10 00:34:51,181 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:34:51,181 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:34:51,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:51,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 00:34:51,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:34:51,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 00:34:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:34:51,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:34:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:34:51,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917794592] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:34:51,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:34:51,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-01-10 00:34:51,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920521202] [2025-01-10 00:34:51,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:34:51,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 00:34:51,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:51,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 00:34:51,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-01-10 00:34:51,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 47 [2025-01-10 00:34:51,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 50 transitions, 359 flow. Second operand has 23 states, 23 states have (on average 25.73913043478261) internal successors, (592), 23 states have internal predecessors, (592), 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 00:34:51,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:51,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 47 [2025-01-10 00:34:51,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:52,145 INFO L124 PetriNetUnfolderBase]: 29/162 cut-off events. [2025-01-10 00:34:52,145 INFO L125 PetriNetUnfolderBase]: For 599/599 co-relation queries the response was YES. [2025-01-10 00:34:52,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 162 events. 29/162 cut-off events. For 599/599 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 231 event pairs, 12 based on Foata normal form. 2/163 useless extension candidates. Maximal degree in co-relation 543. Up to 52 conditions per place. [2025-01-10 00:34:52,146 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 32 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2025-01-10 00:34:52,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 57 transitions, 453 flow [2025-01-10 00:34:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:34:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:34:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 268 transitions. [2025-01-10 00:34:52,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5702127659574469 [2025-01-10 00:34:52,147 INFO L175 Difference]: Start difference. First operand has 84 places, 50 transitions, 359 flow. Second operand 10 states and 268 transitions. [2025-01-10 00:34:52,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 57 transitions, 453 flow [2025-01-10 00:34:52,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 57 transitions, 424 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-01-10 00:34:52,150 INFO L231 Difference]: Finished difference. Result has 85 places, 50 transitions, 354 flow [2025-01-10 00:34:52,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=354, PETRI_PLACES=85, PETRI_TRANSITIONS=50} [2025-01-10 00:34:52,150 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2025-01-10 00:34:52,150 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 50 transitions, 354 flow [2025-01-10 00:34:52,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 25.73913043478261) internal successors, (592), 23 states have internal predecessors, (592), 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 00:34:52,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:52,150 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:52,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 00:34:52,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 00:34:52,355 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:52,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash -854395871, now seen corresponding path program 5 times [2025-01-10 00:34:52,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:52,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861580555] [2025-01-10 00:34:52,360 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:34:52,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:52,370 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 7 equivalence classes. [2025-01-10 00:34:52,379 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 54 of 56 statements. [2025-01-10 00:34:52,381 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-10 00:34:52,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:34:52,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:52,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861580555] [2025-01-10 00:34:52,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861580555] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:34:52,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625739746] [2025-01-10 00:34:52,668 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:34:52,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:52,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:34:52,670 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:34:52,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 00:34:52,714 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 7 equivalence classes. [2025-01-10 00:34:52,742 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 54 of 56 statements. [2025-01-10 00:34:52,742 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-10 00:34:52,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:52,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 00:34:52,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:34:53,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 00:34:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:34:53,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:34:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:34:53,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625739746] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:34:53,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:34:53,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-01-10 00:34:53,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953195669] [2025-01-10 00:34:53,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:34:53,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 00:34:53,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:53,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 00:34:53,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-01-10 00:34:53,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 47 [2025-01-10 00:34:53,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 50 transitions, 354 flow. Second operand has 26 states, 26 states have (on average 25.653846153846153) internal successors, (667), 26 states have internal predecessors, (667), 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 00:34:53,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:53,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 47 [2025-01-10 00:34:53,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:54,126 INFO L124 PetriNetUnfolderBase]: 26/157 cut-off events. [2025-01-10 00:34:54,126 INFO L125 PetriNetUnfolderBase]: For 616/616 co-relation queries the response was YES. [2025-01-10 00:34:54,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 157 events. 26/157 cut-off events. For 616/616 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 199 event pairs, 9 based on Foata normal form. 2/158 useless extension candidates. Maximal degree in co-relation 519. Up to 41 conditions per place. [2025-01-10 00:34:54,127 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 32 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2025-01-10 00:34:54,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 58 transitions, 454 flow [2025-01-10 00:34:54,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:34:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 00:34:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 294 transitions. [2025-01-10 00:34:54,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5686653771760155 [2025-01-10 00:34:54,128 INFO L175 Difference]: Start difference. First operand has 85 places, 50 transitions, 354 flow. Second operand 11 states and 294 transitions. [2025-01-10 00:34:54,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 58 transitions, 454 flow [2025-01-10 00:34:54,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 58 transitions, 430 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-01-10 00:34:54,131 INFO L231 Difference]: Finished difference. Result has 89 places, 50 transitions, 358 flow [2025-01-10 00:34:54,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=358, PETRI_PLACES=89, PETRI_TRANSITIONS=50} [2025-01-10 00:34:54,131 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 44 predicate places. [2025-01-10 00:34:54,131 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 50 transitions, 358 flow [2025-01-10 00:34:54,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 25.653846153846153) internal successors, (667), 26 states have internal predecessors, (667), 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 00:34:54,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:54,132 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:54,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 00:34:54,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:54,332 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:54,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash 791631438, now seen corresponding path program 3 times [2025-01-10 00:34:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:54,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734796358] [2025-01-10 00:34:54,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:34:54,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:54,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 9 equivalence classes. [2025-01-10 00:34:54,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 59 statements. [2025-01-10 00:34:54,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 00:34:54,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:54,475 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-10 00:34:54,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:54,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734796358] [2025-01-10 00:34:54,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734796358] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:34:54,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873308240] [2025-01-10 00:34:54,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:34:54,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:54,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:34:54,480 INFO L229 MonitoredProcess]: Starting monitored process 11 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 00:34:54,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 00:34:54,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 9 equivalence classes. [2025-01-10 00:34:54,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 59 statements. [2025-01-10 00:34:54,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 00:34:54,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:54,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 00:34:54,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:34:54,567 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:34:54,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-10 00:34:54,575 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:34:54,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:34:54,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:34:54,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-01-10 00:34:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-10 00:34:54,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:34:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-10 00:34:55,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873308240] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:34:55,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:34:55,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2025-01-10 00:34:55,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814558820] [2025-01-10 00:34:55,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:34:55,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:34:55,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:55,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:34:55,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-01-10 00:34:55,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2025-01-10 00:34:55,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 50 transitions, 358 flow. Second operand has 19 states, 19 states have (on average 20.68421052631579) internal successors, (393), 19 states have internal predecessors, (393), 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 00:34:55,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:55,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2025-01-10 00:34:55,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:55,679 INFO L124 PetriNetUnfolderBase]: 43/172 cut-off events. [2025-01-10 00:34:55,679 INFO L125 PetriNetUnfolderBase]: For 617/617 co-relation queries the response was YES. [2025-01-10 00:34:55,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 172 events. 43/172 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 209 event pairs, 3 based on Foata normal form. 2/173 useless extension candidates. Maximal degree in co-relation 577. Up to 71 conditions per place. [2025-01-10 00:34:55,680 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 24 selfloop transitions, 19 changer transitions 0/53 dead transitions. [2025-01-10 00:34:55,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 53 transitions, 434 flow [2025-01-10 00:34:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:34:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:34:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2025-01-10 00:34:55,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4858156028368794 [2025-01-10 00:34:55,682 INFO L175 Difference]: Start difference. First operand has 89 places, 50 transitions, 358 flow. Second operand 6 states and 137 transitions. [2025-01-10 00:34:55,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 53 transitions, 434 flow [2025-01-10 00:34:55,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 53 transitions, 379 flow, removed 5 selfloop flow, removed 17 redundant places. [2025-01-10 00:34:55,684 INFO L231 Difference]: Finished difference. Result has 76 places, 49 transitions, 323 flow [2025-01-10 00:34:55,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=323, PETRI_PLACES=76, PETRI_TRANSITIONS=49} [2025-01-10 00:34:55,684 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2025-01-10 00:34:55,684 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 49 transitions, 323 flow [2025-01-10 00:34:55,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 20.68421052631579) internal successors, (393), 19 states have internal predecessors, (393), 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 00:34:55,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:55,685 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:55,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 00:34:55,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 00:34:55,885 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:55,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:55,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1861373402, now seen corresponding path program 6 times [2025-01-10 00:34:55,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:55,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661145719] [2025-01-10 00:34:55,886 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 00:34:55,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:55,894 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 62 statements into 8 equivalence classes. [2025-01-10 00:34:55,914 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 00:34:55,914 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-01-10 00:34:55,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 2 proven. 126 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:34:56,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:34:56,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661145719] [2025-01-10 00:34:56,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661145719] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:34:56,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724173041] [2025-01-10 00:34:56,756 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 00:34:56,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:56,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:34:56,759 INFO L229 MonitoredProcess]: Starting monitored process 12 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 00:34:56,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 00:34:56,803 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 62 statements into 8 equivalence classes. [2025-01-10 00:34:56,841 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 00:34:56,842 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-01-10 00:34:56,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:34:56,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 00:34:56,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:34:57,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 00:34:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 2 proven. 126 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:34:57,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:34:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 2 proven. 126 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:34:57,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724173041] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:34:57,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:34:57,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-01-10 00:34:57,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761424372] [2025-01-10 00:34:57,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:34:57,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 00:34:57,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:34:57,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 00:34:57,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2025-01-10 00:34:57,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2025-01-10 00:34:57,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 49 transitions, 323 flow. Second operand has 30 states, 30 states have (on average 25.133333333333333) internal successors, (754), 30 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:34:57,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:34:57,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2025-01-10 00:34:57,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:34:58,718 INFO L124 PetriNetUnfolderBase]: 32/165 cut-off events. [2025-01-10 00:34:58,718 INFO L125 PetriNetUnfolderBase]: For 524/524 co-relation queries the response was YES. [2025-01-10 00:34:58,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 165 events. 32/165 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 182 event pairs, 7 based on Foata normal form. 2/166 useless extension candidates. Maximal degree in co-relation 517. Up to 35 conditions per place. [2025-01-10 00:34:58,720 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 41 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2025-01-10 00:34:58,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 64 transitions, 489 flow [2025-01-10 00:34:58,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:34:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:34:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 340 transitions. [2025-01-10 00:34:58,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5564648117839607 [2025-01-10 00:34:58,721 INFO L175 Difference]: Start difference. First operand has 76 places, 49 transitions, 323 flow. Second operand 13 states and 340 transitions. [2025-01-10 00:34:58,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 64 transitions, 489 flow [2025-01-10 00:34:58,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 64 transitions, 483 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:34:58,724 INFO L231 Difference]: Finished difference. Result has 87 places, 49 transitions, 353 flow [2025-01-10 00:34:58,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=353, PETRI_PLACES=87, PETRI_TRANSITIONS=49} [2025-01-10 00:34:58,725 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 42 predicate places. [2025-01-10 00:34:58,725 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 49 transitions, 353 flow [2025-01-10 00:34:58,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 25.133333333333333) internal successors, (754), 30 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:34:58,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:34:58,726 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:58,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 00:34:58,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:34:58,930 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:34:58,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:34:58,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1714612845, now seen corresponding path program 7 times [2025-01-10 00:34:58,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:34:58,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695037309] [2025-01-10 00:34:58,930 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 00:34:58,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:34:58,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 00:34:58,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:34:58,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:58,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:34:58,957 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:34:58,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 00:34:58,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:34:58,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:34:58,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:34:59,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:34:59,014 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:34:59,014 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2025-01-10 00:34:59,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 18 remaining) [2025-01-10 00:34:59,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (15 of 18 remaining) [2025-01-10 00:34:59,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2025-01-10 00:34:59,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2025-01-10 00:34:59,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2025-01-10 00:34:59,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2025-01-10 00:34:59,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2025-01-10 00:34:59,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2025-01-10 00:34:59,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (8 of 18 remaining) [2025-01-10 00:34:59,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2025-01-10 00:34:59,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 18 remaining) [2025-01-10 00:34:59,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2025-01-10 00:34:59,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2025-01-10 00:34:59,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2025-01-10 00:34:59,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2025-01-10 00:34:59,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 18 remaining) [2025-01-10 00:34:59,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 18 remaining) [2025-01-10 00:34:59,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:34:59,017 INFO L422 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:34:59,071 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:34:59,071 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:34:59,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:34:59 BasicIcfg [2025-01-10 00:34:59,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:34:59,076 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:34:59,077 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:34:59,077 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:34:59,077 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:34:38" (3/4) ... [2025-01-10 00:34:59,078 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:34:59,079 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:34:59,079 INFO L158 Benchmark]: Toolchain (without parser) took 22189.27ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 108.7MB in the beginning and 150.6MB in the end (delta: -41.9MB). Peak memory consumption was 241.4MB. Max. memory is 16.1GB. [2025-01-10 00:34:59,079 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:34:59,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 661.15ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 76.6MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-10 00:34:59,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.33ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 74.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:34:59,080 INFO L158 Benchmark]: Boogie Preprocessor took 45.47ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 73.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:34:59,080 INFO L158 Benchmark]: RCFGBuilder took 360.29ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 49.4MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:34:59,080 INFO L158 Benchmark]: TraceAbstraction took 21071.66ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 48.4MB in the beginning and 150.7MB in the end (delta: -102.3MB). Peak memory consumption was 174.3MB. Max. memory is 16.1GB. [2025-01-10 00:34:59,080 INFO L158 Benchmark]: Witness Printer took 2.21ms. Allocated memory is still 419.4MB. Free memory was 150.7MB in the beginning and 150.6MB in the end (delta: 87.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:34:59,081 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 661.15ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 76.6MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.33ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 74.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.47ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 73.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 360.29ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 49.4MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 21071.66ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 48.4MB in the beginning and 150.7MB in the end (delta: -102.3MB). Peak memory consumption was 174.3MB. Max. memory is 16.1GB. * Witness Printer took 2.21ms. Allocated memory is still 419.4MB. Free memory was 150.7MB in the beginning and 150.6MB in the end (delta: 87.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1119]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1119. Possible FailurePath: [L1108] 0 char *v; [L1121] 0 pthread_t t1, t2; [L1122] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, t1=-1, v={0:0}] [L1111] 1 v = malloc(sizeof(char) * 8) [L1112] 1 return 0; [L1123] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, t1=-1, v={-1:0}] [L1124] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, t1=-1, t2=0, v={-1:0}] [L1116] COND TRUE 2 \read(*v) [L1116] CALL 2 strcpy(v, "Bigshot") [L1116] RET 2 strcpy(v, "Bigshot") [L1117] 2 return 0; [L1125] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, t1=-1, t2=0, v={-1:0}] [L1126] EXPR 0 !v || v[0] == 'B' VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, t1=-1, t2=0, v={-1:0}] [L1126] EXPR 0 !v || v[0] == 'B' VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, v={-1:0}] [L1126] EXPR 0 v[0] [L1126] EXPR 0 !v || v[0] == 'B' VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, t1=-1, t2=0, v={-1:0}] [L1126] CALL 0 __VERIFIER_assert(!v || v[0] == 'B') [L1107] COND FALSE 0 !(!expression) VAL [\old(arg)={0:0}, \old(expression)=1, \result={0:0}, arg={0:0}, expression=1, v={-1:0}] [L1126] RET 0 __VERIFIER_assert(!v || v[0] == 'B') [L1127] 0 return 0; VAL [\old(arg)={0:0}, \result=0, \result={0:0}, arg={0:0}, t1=-1, t2=0, v={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1124]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1122]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 63 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.9s, OverallIterations: 20, TraceHistogramMax: 9, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3189 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2839 mSDsluCounter, 3510 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3417 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13703 IncrementalHoareTripleChecker+Invalid, 13804 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 93 mSDtfsCounter, 13703 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1074 GetRequests, 767 SyntacticMatches, 0 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1533 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=359occurred in iteration=15, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 1107 NumberOfCodeBlocks, 971 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 1447 ConstructedInterpolants, 9 QuantifiedInterpolants, 21269 SizeOfPredicates, 42 NumberOfNonLiveVariables, 2176 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 41 InterpolantComputations, 8 PerfectInterpolantSequences, 618/1911 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 00:34:59,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/pthread/bigshot_s.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:35:01,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:35:01,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-10 00:35:01,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:35:01,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:35:01,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:35:01,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:35:01,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:35:01,383 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:35:01,383 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:35:01,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:35:01,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:35:01,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:35:01,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:35:01,385 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:35:01,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:35:01,385 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:35:01,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:35:01,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:35:01,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:35:01,385 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:35:01,385 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:35:01,386 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:35:01,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:35:01,386 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:35:01,386 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:35:01,386 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:35:01,386 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:35:01,386 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:35:01,386 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:35:01,386 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:35:01,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:35:01,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:35:01,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:35:01,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:35:01,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:35:01,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:35:01,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:35:01,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:35:01,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:35:01,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:35:01,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:35:01,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:35:01,388 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:35:01,388 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:35:01,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:35:01,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:35:01,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:35:01,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:35:01,389 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 -> 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe [2025-01-10 00:35:01,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:35:01,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:35:01,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:35:01,623 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:35:01,624 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:35:01,624 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/bigshot_s.i [2025-01-10 00:35:02,829 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/349ef3245/dff6cf3dc45445fdab9f9e0ea421a3b2/FLAGdc68a0ba2 [2025-01-10 00:35:03,086 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:35:03,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/bigshot_s.i [2025-01-10 00:35:03,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/349ef3245/dff6cf3dc45445fdab9f9e0ea421a3b2/FLAGdc68a0ba2 [2025-01-10 00:35:03,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/349ef3245/dff6cf3dc45445fdab9f9e0ea421a3b2 [2025-01-10 00:35:03,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:35:03,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:35:03,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:35:03,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:35:03,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:35:03,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:35:03" (1/1) ... [2025-01-10 00:35:03,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5c720e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03, skipping insertion in model container [2025-01-10 00:35:03,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:35:03" (1/1) ... [2025-01-10 00:35:03,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:35:03,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:35:03,760 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:35:03,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:35:03,867 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:35:03,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03 WrapperNode [2025-01-10 00:35:03,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:35:03,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:35:03,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:35:03,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:35:03,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03" (1/1) ... [2025-01-10 00:35:03,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03" (1/1) ... [2025-01-10 00:35:03,912 INFO L138 Inliner]: procedures = 323, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 68 [2025-01-10 00:35:03,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:35:03,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:35:03,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:35:03,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:35:03,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03" (1/1) ... [2025-01-10 00:35:03,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03" (1/1) ... [2025-01-10 00:35:03,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03" (1/1) ... [2025-01-10 00:35:03,942 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 9, 2]. 69 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 1 writes are split as follows [0, 0, 1]. [2025-01-10 00:35:03,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03" (1/1) ... [2025-01-10 00:35:03,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03" (1/1) ... [2025-01-10 00:35:03,950 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03" (1/1) ... [2025-01-10 00:35:03,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03" (1/1) ... [2025-01-10 00:35:03,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03" (1/1) ... [2025-01-10 00:35:03,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03" (1/1) ... [2025-01-10 00:35:03,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03" (1/1) ... [2025-01-10 00:35:03,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:35:03,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:35:03,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:35:03,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:35:03,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03" (1/1) ... [2025-01-10 00:35:03,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:35:04,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:04,024 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 00:35:04,027 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 00:35:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-10 00:35:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-10 00:35:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-10 00:35:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 00:35:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-10 00:35:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-10 00:35:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 00:35:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 00:35:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 00:35:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 00:35:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-10 00:35:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-10 00:35:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#2 [2025-01-10 00:35:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:35:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:35:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:35:04,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:35:04,054 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 00:35:04,151 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:35:04,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:35:04,285 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:35:04,285 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:35:04,376 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:35:04,376 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 00:35:04,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:35:04 BoogieIcfgContainer [2025-01-10 00:35:04,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:35:04,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:35:04,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:35:04,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:35:04,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:35:03" (1/3) ... [2025-01-10 00:35:04,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c460906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:35:04, skipping insertion in model container [2025-01-10 00:35:04,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:03" (2/3) ... [2025-01-10 00:35:04,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c460906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:35:04, skipping insertion in model container [2025-01-10 00:35:04,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:35:04" (3/3) ... [2025-01-10 00:35:04,405 INFO L128 eAbstractionObserver]: Analyzing ICFG bigshot_s.i [2025-01-10 00:35:04,420 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:35:04,425 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bigshot_s.i that has 3 procedures, 42 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-01-10 00:35:04,426 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:35:04,459 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:35:04,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 108 flow [2025-01-10 00:35:04,513 INFO L124 PetriNetUnfolderBase]: 6/45 cut-off events. [2025-01-10 00:35:04,515 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:35:04,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 45 events. 6/45 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-01-10 00:35:04,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 47 transitions, 108 flow [2025-01-10 00:35:04,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 44 transitions, 100 flow [2025-01-10 00:35:04,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:35:04,537 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;@10a84ec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:35:04,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-10 00:35:04,542 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:35:04,543 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2025-01-10 00:35:04,544 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:35:04,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:04,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:04,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:04,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:04,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2100677542, now seen corresponding path program 1 times [2025-01-10 00:35:04,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:04,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1205928881] [2025-01-10 00:35:04,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:35:04,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:04,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:04,559 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 00:35:04,562 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 00:35:04,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:35:04,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:35:04,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:35:04,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:04,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:35:04,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:04,715 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-01-10 00:35:04,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-01-10 00:35:04,742 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 00:35:04,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:35:04,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:04,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205928881] [2025-01-10 00:35:04,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205928881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:35:04,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:35:04,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:35:04,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341922623] [2025-01-10 00:35:04,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:35:04,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:35:04,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:04,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:35:04,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:35:04,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2025-01-10 00:35:04,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 00:35:04,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:04,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2025-01-10 00:35:04,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:04,903 INFO L124 PetriNetUnfolderBase]: 9/58 cut-off events. [2025-01-10 00:35:04,903 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:35:04,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 58 events. 9/58 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 140 event pairs, 2 based on Foata normal form. 4/52 useless extension candidates. Maximal degree in co-relation 76. Up to 21 conditions per place. [2025-01-10 00:35:04,904 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 16 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2025-01-10 00:35:04,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 128 flow [2025-01-10 00:35:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:35:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:35:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-01-10 00:35:04,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2025-01-10 00:35:04,914 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 100 flow. Second operand 4 states and 112 transitions. [2025-01-10 00:35:04,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 128 flow [2025-01-10 00:35:04,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:35:04,918 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 86 flow [2025-01-10 00:35:04,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-01-10 00:35:04,922 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2025-01-10 00:35:04,925 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 86 flow [2025-01-10 00:35:04,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 00:35:04,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:04,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:04,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:35:05,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:05,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:05,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash 696494632, now seen corresponding path program 1 times [2025-01-10 00:35:05,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:05,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1850136887] [2025-01-10 00:35:05,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:35:05,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:05,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:05,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:35:05,132 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 00:35:05,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:35:05,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:35:05,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:35:05,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:05,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 00:35:05,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:05,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:35:05,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:35:05,295 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 00:35:05,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:35:05,297 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:05,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850136887] [2025-01-10 00:35:05,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850136887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:35:05,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:35:05,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:35:05,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004703775] [2025-01-10 00:35:05,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:35:05,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:35:05,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:05,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:35:05,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:35:05,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2025-01-10 00:35:05,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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 00:35:05,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:05,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2025-01-10 00:35:05,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:05,450 INFO L124 PetriNetUnfolderBase]: 17/84 cut-off events. [2025-01-10 00:35:05,450 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 00:35:05,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 84 events. 17/84 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 208 event pairs, 7 based on Foata normal form. 2/72 useless extension candidates. Maximal degree in co-relation 60. Up to 40 conditions per place. [2025-01-10 00:35:05,451 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 22 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2025-01-10 00:35:05,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 150 flow [2025-01-10 00:35:05,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:35:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:35:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-01-10 00:35:05,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2025-01-10 00:35:05,455 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 86 flow. Second operand 4 states and 112 transitions. [2025-01-10 00:35:05,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 150 flow [2025-01-10 00:35:05,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 142 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:35:05,457 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 103 flow [2025-01-10 00:35:05,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2025-01-10 00:35:05,459 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2025-01-10 00:35:05,460 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 103 flow [2025-01-10 00:35:05,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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 00:35:05,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:05,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:05,467 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 00:35:05,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:05,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:05,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash 116497384, now seen corresponding path program 1 times [2025-01-10 00:35:05,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:05,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2060856268] [2025-01-10 00:35:05,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:35:05,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:05,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:05,667 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 00:35:05,668 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 00:35:05,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:35:05,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:35:05,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:35:05,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:05,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:35:05,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:05,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-01-10 00:35:05,748 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 00:35:05,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:35:05,748 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:05,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060856268] [2025-01-10 00:35:05,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060856268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:35:05,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:35:05,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:35:05,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109998813] [2025-01-10 00:35:05,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:35:05,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:35:05,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:05,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:35:05,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:35:05,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2025-01-10 00:35:05,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:35:05,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:05,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2025-01-10 00:35:05,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:05,854 INFO L124 PetriNetUnfolderBase]: 15/77 cut-off events. [2025-01-10 00:35:05,854 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 00:35:05,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 77 events. 15/77 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 177 event pairs, 1 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 49. Up to 20 conditions per place. [2025-01-10 00:35:05,859 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 19 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-01-10 00:35:05,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 149 flow [2025-01-10 00:35:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:35:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:35:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-01-10 00:35:05,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5691489361702128 [2025-01-10 00:35:05,860 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 103 flow. Second operand 4 states and 107 transitions. [2025-01-10 00:35:05,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 149 flow [2025-01-10 00:35:05,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:35:05,861 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 102 flow [2025-01-10 00:35:05,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-01-10 00:35:05,862 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2025-01-10 00:35:05,862 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 102 flow [2025-01-10 00:35:05,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:35:05,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:05,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:05,874 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 00:35:06,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:06,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:06,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:06,064 INFO L85 PathProgramCache]: Analyzing trace with hash -683548118, now seen corresponding path program 1 times [2025-01-10 00:35:06,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:06,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158000927] [2025-01-10 00:35:06,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:35:06,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:06,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:06,070 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 00:35:06,071 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 00:35:06,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:35:06,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:35:06,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:35:06,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:06,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 00:35:06,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:06,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:35:06,219 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 00:35:06,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:35:06,219 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:06,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158000927] [2025-01-10 00:35:06,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158000927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:35:06,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:35:06,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:35:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703889736] [2025-01-10 00:35:06,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:35:06,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:35:06,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:06,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:35:06,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:35:06,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2025-01-10 00:35:06,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 00:35:06,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:06,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2025-01-10 00:35:06,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:06,327 INFO L124 PetriNetUnfolderBase]: 14/66 cut-off events. [2025-01-10 00:35:06,328 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-10 00:35:06,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 66 events. 14/66 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 136 event pairs, 4 based on Foata normal form. 2/62 useless extension candidates. Maximal degree in co-relation 49. Up to 31 conditions per place. [2025-01-10 00:35:06,328 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 20 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-01-10 00:35:06,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 154 flow [2025-01-10 00:35:06,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:35:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:35:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-01-10 00:35:06,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6063829787234043 [2025-01-10 00:35:06,330 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 102 flow. Second operand 4 states and 114 transitions. [2025-01-10 00:35:06,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 154 flow [2025-01-10 00:35:06,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:35:06,331 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 105 flow [2025-01-10 00:35:06,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-01-10 00:35:06,331 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2025-01-10 00:35:06,331 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 105 flow [2025-01-10 00:35:06,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 00:35:06,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:06,332 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:06,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:35:06,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:06,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:06,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:06,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1034755921, now seen corresponding path program 1 times [2025-01-10 00:35:06,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:06,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1858817264] [2025-01-10 00:35:06,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:35:06,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:06,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:06,539 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:35:06,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:35:06,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:35:06,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:35:06,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:35:06,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:06,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 00:35:06,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:06,662 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-10 00:35:06,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-10 00:35:06,942 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 00:35:06,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:35:07,107 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 00:35:07,108 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:07,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858817264] [2025-01-10 00:35:07,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858817264] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:35:07,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:35:07,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-01-10 00:35:07,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840520434] [2025-01-10 00:35:07,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:35:07,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:35:07,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:07,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:35:07,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:35:07,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2025-01-10 00:35:07,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 105 flow. Second operand has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:35:07,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:07,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2025-01-10 00:35:07,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:07,845 INFO L124 PetriNetUnfolderBase]: 27/119 cut-off events. [2025-01-10 00:35:07,845 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-10 00:35:07,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 119 events. 27/119 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 214 event pairs, 2 based on Foata normal form. 12/126 useless extension candidates. Maximal degree in co-relation 81. Up to 27 conditions per place. [2025-01-10 00:35:07,846 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 26 selfloop transitions, 13 changer transitions 0/53 dead transitions. [2025-01-10 00:35:07,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 221 flow [2025-01-10 00:35:07,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:35:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:35:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 234 transitions. [2025-01-10 00:35:07,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5531914893617021 [2025-01-10 00:35:07,847 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 105 flow. Second operand 9 states and 234 transitions. [2025-01-10 00:35:07,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 221 flow [2025-01-10 00:35:07,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 213 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:35:07,849 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 148 flow [2025-01-10 00:35:07,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=148, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-01-10 00:35:07,849 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2025-01-10 00:35:07,849 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 148 flow [2025-01-10 00:35:07,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:35:07,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:07,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:07,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 00:35:08,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:08,050 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:08,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:08,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2004768693, now seen corresponding path program 1 times [2025-01-10 00:35:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:08,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17337433] [2025-01-10 00:35:08,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:35:08,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:08,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:08,053 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:35:08,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:35:08,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:35:08,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:35:08,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:35:08,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:08,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:35:08,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:08,111 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 00:35:08,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:35:08,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:08,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17337433] [2025-01-10 00:35:08,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17337433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:35:08,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:35:08,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:35:08,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645372623] [2025-01-10 00:35:08,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:35:08,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:35:08,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:08,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:35:08,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:35:08,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 47 [2025-01-10 00:35:08,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 00:35:08,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:08,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 47 [2025-01-10 00:35:08,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:08,152 INFO L124 PetriNetUnfolderBase]: 21/109 cut-off events. [2025-01-10 00:35:08,152 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-01-10 00:35:08,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 109 events. 21/109 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 207 event pairs, 11 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 88. Up to 51 conditions per place. [2025-01-10 00:35:08,153 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 24 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2025-01-10 00:35:08,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 198 flow [2025-01-10 00:35:08,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:35:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:35:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-01-10 00:35:08,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6312056737588653 [2025-01-10 00:35:08,153 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 148 flow. Second operand 3 states and 89 transitions. [2025-01-10 00:35:08,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 198 flow [2025-01-10 00:35:08,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 175 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-01-10 00:35:08,155 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 125 flow [2025-01-10 00:35:08,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2025-01-10 00:35:08,155 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2025-01-10 00:35:08,155 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 125 flow [2025-01-10 00:35:08,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 00:35:08,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:08,155 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:08,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 00:35:08,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:08,356 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:08,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:08,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2031981297, now seen corresponding path program 1 times [2025-01-10 00:35:08,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:08,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1810452863] [2025-01-10 00:35:08,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:35:08,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:08,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:08,359 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:35:08,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:35:08,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:35:08,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:35:08,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:35:08,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:08,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 00:35:08,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:08,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:35:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:08,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:35:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:08,604 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:08,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810452863] [2025-01-10 00:35:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810452863] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:35:08,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:35:08,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-01-10 00:35:08,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914054549] [2025-01-10 00:35:08,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:35:08,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:35:08,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:08,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:35:08,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:35:08,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2025-01-10 00:35:08,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 125 flow. Second operand has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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 00:35:08,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:08,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2025-01-10 00:35:08,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:08,991 INFO L124 PetriNetUnfolderBase]: 26/115 cut-off events. [2025-01-10 00:35:08,991 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-01-10 00:35:08,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 115 events. 26/115 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 190 event pairs, 4 based on Foata normal form. 6/116 useless extension candidates. Maximal degree in co-relation 213. Up to 30 conditions per place. [2025-01-10 00:35:08,992 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 27 selfloop transitions, 11 changer transitions 0/52 dead transitions. [2025-01-10 00:35:08,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 225 flow [2025-01-10 00:35:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:35:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:35:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2025-01-10 00:35:08,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-10 00:35:08,993 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 125 flow. Second operand 7 states and 188 transitions. [2025-01-10 00:35:08,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 225 flow [2025-01-10 00:35:08,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:35:08,995 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 174 flow [2025-01-10 00:35:08,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-01-10 00:35:08,995 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2025-01-10 00:35:08,995 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 174 flow [2025-01-10 00:35:08,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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 00:35:08,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:08,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:09,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 00:35:09,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:09,200 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:09,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:09,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1448504088, now seen corresponding path program 1 times [2025-01-10 00:35:09,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:09,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420163473] [2025-01-10 00:35:09,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:35:09,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:09,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:09,203 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:35:09,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:35:09,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 00:35:09,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 00:35:09,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:35:09,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:09,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:35:09,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:09,275 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 00:35:09,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:35:09,275 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:09,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420163473] [2025-01-10 00:35:09,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420163473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:35:09,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:35:09,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:35:09,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647833678] [2025-01-10 00:35:09,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:35:09,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:35:09,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:09,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:35:09,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:35:09,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-01-10 00:35:09,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 00:35:09,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:09,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-01-10 00:35:09,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:09,328 INFO L124 PetriNetUnfolderBase]: 20/108 cut-off events. [2025-01-10 00:35:09,328 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-01-10 00:35:09,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 108 events. 20/108 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 182 event pairs, 11 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 243. Up to 51 conditions per place. [2025-01-10 00:35:09,328 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 24 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2025-01-10 00:35:09,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 228 flow [2025-01-10 00:35:09,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:35:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:35:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-01-10 00:35:09,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5425531914893617 [2025-01-10 00:35:09,329 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 174 flow. Second operand 4 states and 102 transitions. [2025-01-10 00:35:09,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 228 flow [2025-01-10 00:35:09,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 214 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 00:35:09,331 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 164 flow [2025-01-10 00:35:09,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-01-10 00:35:09,331 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2025-01-10 00:35:09,331 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 164 flow [2025-01-10 00:35:09,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 00:35:09,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:09,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:09,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 00:35:09,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:09,532 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:09,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:09,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1989818688, now seen corresponding path program 1 times [2025-01-10 00:35:09,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:09,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [447813791] [2025-01-10 00:35:09,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:35:09,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:09,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:09,535 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:35:09,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 00:35:09,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:35:09,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:35:09,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:35:09,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:09,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:35:09,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:09,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 00:35:09,677 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 00:35:09,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:35:09,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:09,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447813791] [2025-01-10 00:35:09,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447813791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:35:09,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:35:09,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:35:09,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906801548] [2025-01-10 00:35:09,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:35:09,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:35:09,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:09,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:35:09,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:35:09,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 47 [2025-01-10 00:35:09,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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 00:35:09,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:09,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 47 [2025-01-10 00:35:09,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:09,789 INFO L124 PetriNetUnfolderBase]: 21/112 cut-off events. [2025-01-10 00:35:09,789 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-10 00:35:09,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 112 events. 21/112 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs, 12 based on Foata normal form. 2/111 useless extension candidates. Maximal degree in co-relation 240. Up to 52 conditions per place. [2025-01-10 00:35:09,790 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 24 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2025-01-10 00:35:09,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 224 flow [2025-01-10 00:35:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:35:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:35:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2025-01-10 00:35:09,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5815602836879432 [2025-01-10 00:35:09,791 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 164 flow. Second operand 6 states and 164 transitions. [2025-01-10 00:35:09,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 224 flow [2025-01-10 00:35:09,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 218 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:35:09,795 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 170 flow [2025-01-10 00:35:09,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2025-01-10 00:35:09,795 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2025-01-10 00:35:09,795 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 170 flow [2025-01-10 00:35:09,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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 00:35:09,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:09,795 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:09,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 00:35:09,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:09,996 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:09,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash -226414099, now seen corresponding path program 1 times [2025-01-10 00:35:09,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:09,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1043853998] [2025-01-10 00:35:09,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:35:09,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:09,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:10,000 INFO L229 MonitoredProcess]: Starting monitored process 11 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 00:35:10,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 00:35:10,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 00:35:10,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 00:35:10,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:35:10,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:10,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 00:35:10,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:10,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:35:10,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 00:35:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:10,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:35:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:10,546 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:10,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043853998] [2025-01-10 00:35:10,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043853998] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:35:10,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:35:10,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-01-10 00:35:10,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848351431] [2025-01-10 00:35:10,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:35:10,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:35:10,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:10,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:35:10,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:35:10,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-01-10 00:35:10,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 170 flow. Second operand has 14 states, 14 states have (on average 22.571428571428573) internal successors, (316), 14 states have internal predecessors, (316), 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 00:35:10,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:10,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-01-10 00:35:10,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:11,154 INFO L124 PetriNetUnfolderBase]: 23/112 cut-off events. [2025-01-10 00:35:11,155 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-01-10 00:35:11,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 112 events. 23/112 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 180 event pairs, 6 based on Foata normal form. 2/111 useless extension candidates. Maximal degree in co-relation 262. Up to 32 conditions per place. [2025-01-10 00:35:11,156 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 28 selfloop transitions, 11 changer transitions 0/51 dead transitions. [2025-01-10 00:35:11,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 51 transitions, 270 flow [2025-01-10 00:35:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:35:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:35:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2025-01-10 00:35:11,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5042553191489362 [2025-01-10 00:35:11,167 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 170 flow. Second operand 10 states and 237 transitions. [2025-01-10 00:35:11,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 51 transitions, 270 flow [2025-01-10 00:35:11,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 51 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:35:11,169 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 189 flow [2025-01-10 00:35:11,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=189, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2025-01-10 00:35:11,170 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2025-01-10 00:35:11,170 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 189 flow [2025-01-10 00:35:11,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 22.571428571428573) internal successors, (316), 14 states have internal predecessors, (316), 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 00:35:11,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:11,170 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:11,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 00:35:11,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:11,371 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:11,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:11,372 INFO L85 PathProgramCache]: Analyzing trace with hash 119061700, now seen corresponding path program 2 times [2025-01-10 00:35:11,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:11,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023859714] [2025-01-10 00:35:11,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:35:11,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:11,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:11,375 INFO L229 MonitoredProcess]: Starting monitored process 12 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 00:35:11,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 00:35:11,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 00:35:11,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 00:35:11,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:35:11,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:11,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 00:35:11,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:11,495 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-10 00:35:11,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-10 00:35:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:12,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:35:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:12,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:12,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023859714] [2025-01-10 00:35:12,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023859714] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:35:12,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:35:12,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 17 [2025-01-10 00:35:12,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71576727] [2025-01-10 00:35:12,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:35:12,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:35:12,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:12,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:35:12,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2025-01-10 00:35:13,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2025-01-10 00:35:13,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 189 flow. Second operand has 19 states, 19 states have (on average 20.63157894736842) internal successors, (392), 19 states have internal predecessors, (392), 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 00:35:13,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:13,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2025-01-10 00:35:13,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:15,858 INFO L124 PetriNetUnfolderBase]: 70/246 cut-off events. [2025-01-10 00:35:15,858 INFO L125 PetriNetUnfolderBase]: For 469/469 co-relation queries the response was YES. [2025-01-10 00:35:15,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 246 events. 70/246 cut-off events. For 469/469 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 375 event pairs, 3 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 745. Up to 50 conditions per place. [2025-01-10 00:35:15,859 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 59 selfloop transitions, 28 changer transitions 0/97 dead transitions. [2025-01-10 00:35:15,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 97 transitions, 680 flow [2025-01-10 00:35:15,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 00:35:15,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 00:35:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 416 transitions. [2025-01-10 00:35:15,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.491725768321513 [2025-01-10 00:35:15,861 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 189 flow. Second operand 18 states and 416 transitions. [2025-01-10 00:35:15,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 97 transitions, 680 flow [2025-01-10 00:35:15,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 97 transitions, 609 flow, removed 26 selfloop flow, removed 9 redundant places. [2025-01-10 00:35:15,864 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 421 flow [2025-01-10 00:35:15,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=421, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2025-01-10 00:35:15,864 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2025-01-10 00:35:15,864 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 421 flow [2025-01-10 00:35:15,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 20.63157894736842) internal successors, (392), 19 states have internal predecessors, (392), 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 00:35:15,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:15,864 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:15,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 00:35:16,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:16,065 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:16,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1545814586, now seen corresponding path program 2 times [2025-01-10 00:35:16,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:16,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [667945186] [2025-01-10 00:35:16,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:35:16,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:16,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:16,069 INFO L229 MonitoredProcess]: Starting monitored process 13 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 00:35:16,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 00:35:16,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 00:35:16,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 37 statements. [2025-01-10 00:35:16,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:35:16,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:16,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 00:35:16,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:16,154 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-10 00:35:16,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-10 00:35:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-10 00:35:16,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:35:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-10 00:35:17,030 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:17,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667945186] [2025-01-10 00:35:17,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667945186] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:35:17,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:35:17,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-01-10 00:35:17,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692758266] [2025-01-10 00:35:17,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:35:17,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:35:17,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:17,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:35:17,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:35:17,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-01-10 00:35:17,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 421 flow. Second operand has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 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 00:35:17,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:17,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-01-10 00:35:17,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:17,623 INFO L124 PetriNetUnfolderBase]: 62/229 cut-off events. [2025-01-10 00:35:17,623 INFO L125 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2025-01-10 00:35:17,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 229 events. 62/229 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 327 event pairs, 2 based on Foata normal form. 12/240 useless extension candidates. Maximal degree in co-relation 738. Up to 95 conditions per place. [2025-01-10 00:35:17,624 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 24 selfloop transitions, 25 changer transitions 0/61 dead transitions. [2025-01-10 00:35:17,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 61 transitions, 500 flow [2025-01-10 00:35:17,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:35:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:35:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-01-10 00:35:17,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5141843971631206 [2025-01-10 00:35:17,625 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 421 flow. Second operand 6 states and 145 transitions. [2025-01-10 00:35:17,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 61 transitions, 500 flow [2025-01-10 00:35:17,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 61 transitions, 472 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 00:35:17,628 INFO L231 Difference]: Finished difference. Result has 75 places, 58 transitions, 434 flow [2025-01-10 00:35:17,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=75, PETRI_TRANSITIONS=58} [2025-01-10 00:35:17,628 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2025-01-10 00:35:17,628 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 58 transitions, 434 flow [2025-01-10 00:35:17,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 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 00:35:17,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:17,629 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:17,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 00:35:17,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:17,833 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:17,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1930966962, now seen corresponding path program 2 times [2025-01-10 00:35:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:17,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009714077] [2025-01-10 00:35:17,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:35:17,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:17,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:17,837 INFO L229 MonitoredProcess]: Starting monitored process 14 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 00:35:17,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 00:35:17,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-10 00:35:17,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:35:17,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:35:17,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:17,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 00:35:17,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:17,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:35:18,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 00:35:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:18,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:35:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:18,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009714077] [2025-01-10 00:35:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009714077] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:35:18,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:35:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-01-10 00:35:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746359932] [2025-01-10 00:35:18,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:35:18,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 00:35:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:18,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 00:35:18,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-01-10 00:35:19,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-01-10 00:35:19,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 58 transitions, 434 flow. Second operand has 16 states, 16 states have (on average 22.5625) internal successors, (361), 16 states have internal predecessors, (361), 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 00:35:19,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:19,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-01-10 00:35:19,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:19,529 INFO L124 PetriNetUnfolderBase]: 57/222 cut-off events. [2025-01-10 00:35:19,529 INFO L125 PetriNetUnfolderBase]: For 805/805 co-relation queries the response was YES. [2025-01-10 00:35:19,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 222 events. 57/222 cut-off events. For 805/805 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 314 event pairs, 16 based on Foata normal form. 2/223 useless extension candidates. Maximal degree in co-relation 752. Up to 72 conditions per place. [2025-01-10 00:35:19,530 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 36 selfloop transitions, 17 changer transitions 0/69 dead transitions. [2025-01-10 00:35:19,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 69 transitions, 561 flow [2025-01-10 00:35:19,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:35:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 00:35:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 260 transitions. [2025-01-10 00:35:19,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5029013539651838 [2025-01-10 00:35:19,538 INFO L175 Difference]: Start difference. First operand has 75 places, 58 transitions, 434 flow. Second operand 11 states and 260 transitions. [2025-01-10 00:35:19,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 69 transitions, 561 flow [2025-01-10 00:35:19,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 69 transitions, 527 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:35:19,541 INFO L231 Difference]: Finished difference. Result has 82 places, 58 transitions, 431 flow [2025-01-10 00:35:19,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=431, PETRI_PLACES=82, PETRI_TRANSITIONS=58} [2025-01-10 00:35:19,542 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2025-01-10 00:35:19,542 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 58 transitions, 431 flow [2025-01-10 00:35:19,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 22.5625) internal successors, (361), 16 states have internal predecessors, (361), 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 00:35:19,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:19,542 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:19,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 00:35:19,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:19,743 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:19,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:19,744 INFO L85 PathProgramCache]: Analyzing trace with hash -628157729, now seen corresponding path program 3 times [2025-01-10 00:35:19,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:19,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1350406783] [2025-01-10 00:35:19,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:35:19,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:19,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:19,747 INFO L229 MonitoredProcess]: Starting monitored process 15 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 00:35:19,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 00:35:19,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-01-10 00:35:19,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:35:19,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 00:35:19,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:19,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 00:35:19,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:19,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:35:20,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 00:35:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:20,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:35:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:20,553 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350406783] [2025-01-10 00:35:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350406783] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:35:20,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:35:20,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-01-10 00:35:20,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035151736] [2025-01-10 00:35:20,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:35:20,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:35:20,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:20,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:35:20,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-01-10 00:35:21,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-01-10 00:35:21,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 58 transitions, 431 flow. Second operand has 18 states, 18 states have (on average 22.666666666666668) internal successors, (408), 18 states have internal predecessors, (408), 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 00:35:21,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:21,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-01-10 00:35:21,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:21,718 INFO L124 PetriNetUnfolderBase]: 54/217 cut-off events. [2025-01-10 00:35:21,718 INFO L125 PetriNetUnfolderBase]: For 682/682 co-relation queries the response was YES. [2025-01-10 00:35:21,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 217 events. 54/217 cut-off events. For 682/682 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 304 event pairs, 14 based on Foata normal form. 2/218 useless extension candidates. Maximal degree in co-relation 750. Up to 64 conditions per place. [2025-01-10 00:35:21,719 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 38 selfloop transitions, 18 changer transitions 0/72 dead transitions. [2025-01-10 00:35:21,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 72 transitions, 580 flow [2025-01-10 00:35:21,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:35:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:35:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 305 transitions. [2025-01-10 00:35:21,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49918166939443537 [2025-01-10 00:35:21,723 INFO L175 Difference]: Start difference. First operand has 82 places, 58 transitions, 431 flow. Second operand 13 states and 305 transitions. [2025-01-10 00:35:21,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 72 transitions, 580 flow [2025-01-10 00:35:21,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 72 transitions, 542 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-01-10 00:35:21,727 INFO L231 Difference]: Finished difference. Result has 86 places, 58 transitions, 429 flow [2025-01-10 00:35:21,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=429, PETRI_PLACES=86, PETRI_TRANSITIONS=58} [2025-01-10 00:35:21,728 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 41 predicate places. [2025-01-10 00:35:21,728 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 58 transitions, 429 flow [2025-01-10 00:35:21,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 22.666666666666668) internal successors, (408), 18 states have internal predecessors, (408), 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 00:35:21,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:21,728 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:21,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 00:35:21,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:21,929 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:21,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:21,929 INFO L85 PathProgramCache]: Analyzing trace with hash -960558792, now seen corresponding path program 4 times [2025-01-10 00:35:21,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:21,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068229414] [2025-01-10 00:35:21,930 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:35:21,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:21,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:21,932 INFO L229 MonitoredProcess]: Starting monitored process 16 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 00:35:21,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 00:35:22,001 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-01-10 00:35:22,086 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:35:22,087 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:35:22,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:22,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 00:35:22,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:22,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:35:22,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 00:35:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:22,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:35:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:23,015 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:23,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068229414] [2025-01-10 00:35:23,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068229414] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:35:23,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:35:23,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-01-10 00:35:23,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104222171] [2025-01-10 00:35:23,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:35:23,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 00:35:23,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:23,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 00:35:23,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-01-10 00:35:23,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-01-10 00:35:23,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 58 transitions, 429 flow. Second operand has 20 states, 20 states have (on average 22.7) internal successors, (454), 20 states have internal predecessors, (454), 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 00:35:23,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:23,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-01-10 00:35:23,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:25,415 INFO L124 PetriNetUnfolderBase]: 48/217 cut-off events. [2025-01-10 00:35:25,416 INFO L125 PetriNetUnfolderBase]: For 731/731 co-relation queries the response was YES. [2025-01-10 00:35:25,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 217 events. 48/217 cut-off events. For 731/731 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 295 event pairs, 4 based on Foata normal form. 6/222 useless extension candidates. Maximal degree in co-relation 756. Up to 40 conditions per place. [2025-01-10 00:35:25,417 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 50 selfloop transitions, 27 changer transitions 0/93 dead transitions. [2025-01-10 00:35:25,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 93 transitions, 729 flow [2025-01-10 00:35:25,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 00:35:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-10 00:35:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 560 transitions. [2025-01-10 00:35:25,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49645390070921985 [2025-01-10 00:35:25,422 INFO L175 Difference]: Start difference. First operand has 86 places, 58 transitions, 429 flow. Second operand 24 states and 560 transitions. [2025-01-10 00:35:25,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 93 transitions, 729 flow [2025-01-10 00:35:25,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 679 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-01-10 00:35:25,426 INFO L231 Difference]: Finished difference. Result has 102 places, 63 transitions, 488 flow [2025-01-10 00:35:25,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=488, PETRI_PLACES=102, PETRI_TRANSITIONS=63} [2025-01-10 00:35:25,426 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 57 predicate places. [2025-01-10 00:35:25,426 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 63 transitions, 488 flow [2025-01-10 00:35:25,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 22.7) internal successors, (454), 20 states have internal predecessors, (454), 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 00:35:25,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:25,427 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:25,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 00:35:25,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:25,628 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:25,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:25,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1087122109, now seen corresponding path program 5 times [2025-01-10 00:35:25,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:25,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080148557] [2025-01-10 00:35:25,629 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:35:25,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:25,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:25,634 INFO L229 MonitoredProcess]: Starting monitored process 17 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 00:35:25,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 00:35:25,680 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 6 equivalence classes. [2025-01-10 00:35:25,741 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 00:35:25,741 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-10 00:35:25,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:25,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 00:35:25,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:25,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:35:26,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 00:35:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:26,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:35:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:26,797 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:26,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080148557] [2025-01-10 00:35:26,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080148557] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:35:26,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:35:26,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2025-01-10 00:35:26,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235412665] [2025-01-10 00:35:26,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:35:26,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 00:35:26,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:26,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 00:35:26,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-01-10 00:35:27,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-01-10 00:35:27,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 63 transitions, 488 flow. Second operand has 22 states, 22 states have (on average 22.681818181818183) internal successors, (499), 22 states have internal predecessors, (499), 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 00:35:27,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:27,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-01-10 00:35:27,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:29,507 INFO L124 PetriNetUnfolderBase]: 51/246 cut-off events. [2025-01-10 00:35:29,507 INFO L125 PetriNetUnfolderBase]: For 1108/1108 co-relation queries the response was YES. [2025-01-10 00:35:29,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 246 events. 51/246 cut-off events. For 1108/1108 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 333 event pairs, 4 based on Foata normal form. 6/251 useless extension candidates. Maximal degree in co-relation 910. Up to 45 conditions per place. [2025-01-10 00:35:29,509 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 55 selfloop transitions, 30 changer transitions 0/101 dead transitions. [2025-01-10 00:35:29,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 101 transitions, 840 flow [2025-01-10 00:35:29,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-10 00:35:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-10 00:35:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 648 transitions. [2025-01-10 00:35:29,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49240121580547114 [2025-01-10 00:35:29,512 INFO L175 Difference]: Start difference. First operand has 102 places, 63 transitions, 488 flow. Second operand 28 states and 648 transitions. [2025-01-10 00:35:29,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 101 transitions, 840 flow [2025-01-10 00:35:29,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 101 transitions, 803 flow, removed 2 selfloop flow, removed 16 redundant places. [2025-01-10 00:35:29,516 INFO L231 Difference]: Finished difference. Result has 119 places, 67 transitions, 585 flow [2025-01-10 00:35:29,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=585, PETRI_PLACES=119, PETRI_TRANSITIONS=67} [2025-01-10 00:35:29,516 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 74 predicate places. [2025-01-10 00:35:29,516 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 67 transitions, 585 flow [2025-01-10 00:35:29,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 22.681818181818183) internal successors, (499), 22 states have internal predecessors, (499), 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 00:35:29,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:29,516 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:29,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-10 00:35:29,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:29,717 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:29,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:29,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1467565216, now seen corresponding path program 3 times [2025-01-10 00:35:29,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:29,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1727489096] [2025-01-10 00:35:29,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:35:29,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:29,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:29,725 INFO L229 MonitoredProcess]: Starting monitored process 18 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 00:35:29,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 00:35:29,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 9 equivalence classes. [2025-01-10 00:35:29,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 59 statements. [2025-01-10 00:35:29,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 00:35:29,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:29,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 00:35:29,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:29,818 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-10 00:35:29,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-10 00:35:29,828 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-01-10 00:35:29,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-01-10 00:35:30,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:35:30,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-01-10 00:35:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-01-10 00:35:30,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:35:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-01-10 00:35:31,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:31,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727489096] [2025-01-10 00:35:31,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727489096] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:35:31,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:35:31,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2025-01-10 00:35:31,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112005443] [2025-01-10 00:35:31,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:35:31,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:35:31,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:31,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:35:31,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:35:32,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2025-01-10 00:35:32,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 67 transitions, 585 flow. Second operand has 14 states, 14 states have (on average 19.571428571428573) internal successors, (274), 14 states have internal predecessors, (274), 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 00:35:32,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:32,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2025-01-10 00:35:32,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:32,765 INFO L124 PetriNetUnfolderBase]: 77/264 cut-off events. [2025-01-10 00:35:32,765 INFO L125 PetriNetUnfolderBase]: For 1286/1286 co-relation queries the response was YES. [2025-01-10 00:35:32,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 264 events. 77/264 cut-off events. For 1286/1286 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 327 event pairs, 2 based on Foata normal form. 8/271 useless extension candidates. Maximal degree in co-relation 1040. Up to 146 conditions per place. [2025-01-10 00:35:32,766 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 33 selfloop transitions, 30 changer transitions 0/71 dead transitions. [2025-01-10 00:35:32,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 71 transitions, 699 flow [2025-01-10 00:35:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:35:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:35:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2025-01-10 00:35:32,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45896656534954405 [2025-01-10 00:35:32,771 INFO L175 Difference]: Start difference. First operand has 119 places, 67 transitions, 585 flow. Second operand 7 states and 151 transitions. [2025-01-10 00:35:32,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 71 transitions, 699 flow [2025-01-10 00:35:32,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 71 transitions, 630 flow, removed 6 selfloop flow, removed 25 redundant places. [2025-01-10 00:35:32,776 INFO L231 Difference]: Finished difference. Result has 98 places, 65 transitions, 550 flow [2025-01-10 00:35:32,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=550, PETRI_PLACES=98, PETRI_TRANSITIONS=65} [2025-01-10 00:35:32,776 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places. [2025-01-10 00:35:32,776 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 65 transitions, 550 flow [2025-01-10 00:35:32,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.571428571428573) internal successors, (274), 14 states have internal predecessors, (274), 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 00:35:32,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:32,777 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:32,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 00:35:32,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:32,978 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:32,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:32,978 INFO L85 PathProgramCache]: Analyzing trace with hash 843604886, now seen corresponding path program 6 times [2025-01-10 00:35:32,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:32,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [660275990] [2025-01-10 00:35:32,978 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 00:35:32,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:32,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:32,981 INFO L229 MonitoredProcess]: Starting monitored process 19 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 00:35:32,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 00:35:33,038 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 62 statements into 7 equivalence classes. [2025-01-10 00:35:33,208 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 00:35:33,208 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-01-10 00:35:33,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:35:33,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 00:35:33,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:35:33,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:35:33,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 00:35:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:33,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:35:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:35:34,476 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:35:34,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660275990] [2025-01-10 00:35:34,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660275990] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:35:34,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:35:34,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2025-01-10 00:35:34,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968027822] [2025-01-10 00:35:34,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:35:34,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 00:35:34,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:35:34,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 00:35:34,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-01-10 00:35:35,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2025-01-10 00:35:35,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 65 transitions, 550 flow. Second operand has 24 states, 24 states have (on average 22.708333333333332) internal successors, (545), 24 states have internal predecessors, (545), 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 00:35:35,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:35:35,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2025-01-10 00:35:35,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:35:37,982 INFO L124 PetriNetUnfolderBase]: 54/263 cut-off events. [2025-01-10 00:35:37,982 INFO L125 PetriNetUnfolderBase]: For 1509/1509 co-relation queries the response was YES. [2025-01-10 00:35:37,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 263 events. 54/263 cut-off events. For 1509/1509 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 318 event pairs, 4 based on Foata normal form. 6/268 useless extension candidates. Maximal degree in co-relation 1028. Up to 50 conditions per place. [2025-01-10 00:35:37,983 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 60 selfloop transitions, 33 changer transitions 0/107 dead transitions. [2025-01-10 00:35:37,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 107 transitions, 963 flow [2025-01-10 00:35:37,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-10 00:35:37,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-01-10 00:35:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 736 transitions. [2025-01-10 00:35:37,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2025-01-10 00:35:37,984 INFO L175 Difference]: Start difference. First operand has 98 places, 65 transitions, 550 flow. Second operand 32 states and 736 transitions. [2025-01-10 00:35:37,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 107 transitions, 963 flow [2025-01-10 00:35:37,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 107 transitions, 925 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 00:35:37,990 INFO L231 Difference]: Finished difference. Result has 130 places, 69 transitions, 674 flow [2025-01-10 00:35:37,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=674, PETRI_PLACES=130, PETRI_TRANSITIONS=69} [2025-01-10 00:35:37,991 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 85 predicate places. [2025-01-10 00:35:37,991 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 69 transitions, 674 flow [2025-01-10 00:35:37,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 22.708333333333332) internal successors, (545), 24 states have internal predecessors, (545), 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 00:35:37,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:35:37,991 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:38,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-10 00:35:38,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:38,192 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-01-10 00:35:38,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:35:38,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1256379823, now seen corresponding path program 7 times [2025-01-10 00:35:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:35:38,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1709518741] [2025-01-10 00:35:38,193 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 00:35:38,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:38,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:35:38,195 INFO L229 MonitoredProcess]: Starting monitored process 20 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 00:35:38,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-10 00:35:38,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 00:35:38,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:35:38,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:35:38,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:35:38,879 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:35:38,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 00:35:39,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:35:39,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:35:39,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:35:39,268 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 00:35:39,269 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:35:39,270 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2025-01-10 00:35:39,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 18 remaining) [2025-01-10 00:35:39,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (15 of 18 remaining) [2025-01-10 00:35:39,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2025-01-10 00:35:39,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2025-01-10 00:35:39,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2025-01-10 00:35:39,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2025-01-10 00:35:39,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2025-01-10 00:35:39,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2025-01-10 00:35:39,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (8 of 18 remaining) [2025-01-10 00:35:39,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2025-01-10 00:35:39,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 18 remaining) [2025-01-10 00:35:39,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2025-01-10 00:35:39,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2025-01-10 00:35:39,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2025-01-10 00:35:39,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2025-01-10 00:35:39,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 18 remaining) [2025-01-10 00:35:39,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 18 remaining) [2025-01-10 00:35:39,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-01-10 00:35:39,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:35:39,477 INFO L422 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:35:39,524 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:35:39,524 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:35:39,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:35:39 BasicIcfg [2025-01-10 00:35:39,530 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:35:39,530 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:35:39,530 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:35:39,530 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:35:39,532 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:35:04" (3/4) ... [2025-01-10 00:35:39,533 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:35:39,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:35:39,534 INFO L158 Benchmark]: Toolchain (without parser) took 36119.89ms. Allocated memory was 83.9MB in the beginning and 201.3MB in the end (delta: 117.4MB). Free memory was 57.3MB in the beginning and 112.7MB in the end (delta: -55.4MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. [2025-01-10 00:35:39,534 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:35:39,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.61ms. Allocated memory is still 83.9MB. Free memory was 57.3MB in the beginning and 24.7MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-10 00:35:39,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.95ms. Allocated memory is still 83.9MB. Free memory was 24.7MB in the beginning and 22.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:35:39,536 INFO L158 Benchmark]: Boogie Preprocessor took 74.72ms. Allocated memory is still 83.9MB. Free memory was 22.4MB in the beginning and 58.7MB in the end (delta: -36.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2025-01-10 00:35:39,536 INFO L158 Benchmark]: RCFGBuilder took 387.56ms. Allocated memory is still 83.9MB. Free memory was 58.2MB in the beginning and 25.5MB in the end (delta: 32.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:35:39,537 INFO L158 Benchmark]: TraceAbstraction took 35133.56ms. Allocated memory was 83.9MB in the beginning and 201.3MB in the end (delta: 117.4MB). Free memory was 56.6MB in the beginning and 112.8MB in the end (delta: -56.2MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. [2025-01-10 00:35:39,537 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 201.3MB. Free memory was 112.8MB in the beginning and 112.7MB in the end (delta: 11.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:35:39,538 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.61ms. Allocated memory is still 83.9MB. Free memory was 57.3MB in the beginning and 24.7MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.95ms. Allocated memory is still 83.9MB. Free memory was 24.7MB in the beginning and 22.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.72ms. Allocated memory is still 83.9MB. Free memory was 22.4MB in the beginning and 58.7MB in the end (delta: -36.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * RCFGBuilder took 387.56ms. Allocated memory is still 83.9MB. Free memory was 58.2MB in the beginning and 25.5MB in the end (delta: 32.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 35133.56ms. Allocated memory was 83.9MB in the beginning and 201.3MB in the end (delta: 117.4MB). Free memory was 56.6MB in the beginning and 112.8MB in the end (delta: -56.2MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 201.3MB. Free memory was 112.8MB in the beginning and 112.7MB in the end (delta: 11.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1119]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1119. Possible FailurePath: [L1108] 0 char *v; [L1121] 0 pthread_t t1, t2; [L1122] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, t1=67108863, v={0:0}] [L1111] 1 v = malloc(sizeof(char) * 8) [L1112] 1 return 0; [L1123] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, t1=67108863, v={536870912:0}] [L1124] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, t1=67108863, t2=67108864, v={536870912:0}] [L1116] COND TRUE 2 \read(*v) [L1116] FCALL 2 strcpy(v, "Bigshot") [L1117] 2 return 0; [L1125] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, t1=67108863, t2=67108864, v={536870912:0}] [L1126] EXPR 0 !v || v[0] == 'B' VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, t1=67108863, t2=67108864, v={536870912:0}] [L1126] EXPR 0 !v || v[0] == 'B' VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, v={536870912:0}] [L1126] EXPR 0 v[0] [L1126] EXPR 0 !v || v[0] == 'B' VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, t1=67108863, t2=67108864, v={536870912:0}] [L1126] CALL 0 __VERIFIER_assert(!v || v[0] == 'B') [L1107] COND FALSE 0 !(!expression) VAL [\old(arg)={0:0}, \old(expression)=1, \result={0:0}, arg={0:0}, expression=1, v={536870912:0}] [L1126] RET 0 __VERIFIER_assert(!v || v[0] == 'B') [L1127] 0 return 0; VAL [\old(arg)={0:0}, \result=0, \result={0:0}, arg={0:0}, t1=67108863, t2=67108864, v={536870912:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1122]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1124]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 63 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.0s, OverallIterations: 19, TraceHistogramMax: 9, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3138 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2791 mSDsluCounter, 2772 SdHoareTripleChecker+Invalid, 10.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2743 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10422 IncrementalHoareTripleChecker+Invalid, 10519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 29 mSDtfsCounter, 10422 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1113 GetRequests, 813 SyntacticMatches, 3 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1846 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=674occurred in iteration=18, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 632 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 984 ConstructedInterpolants, 107 QuantifiedInterpolants, 16149 SizeOfPredicates, 91 NumberOfNonLiveVariables, 1899 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 29 InterpolantComputations, 7 PerfectInterpolantSequences, 396/1244 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 00:35:39,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample