./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 608e0c2870f111f9f6921442a1f1a544ee956a8de04c7629c0edf3e54cde4da3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:28:57,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:28:57,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:28:57,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:28:57,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:28:57,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:28:57,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:28:57,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:28:57,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:28:57,690 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:28:57,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:28:57,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:28:57,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:28:57,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:28:57,691 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:28:57,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:28:57,692 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:28:57,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:28:57,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:28:57,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:28:57,692 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:28:57,692 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:28:57,692 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:28:57,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:28:57,692 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:28:57,692 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:28:57,693 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:28:57,693 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:28:57,693 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:28:57,693 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:28:57,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:28:57,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:28:57,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:28:57,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:28:57,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:28:57,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:28:57,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:28:57,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:28:57,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:28:57,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:28:57,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:28:57,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:28:57,694 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/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 -> 608e0c2870f111f9f6921442a1f1a544ee956a8de04c7629c0edf3e54cde4da3 [2025-03-09 01:28:57,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:28:57,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:28:57,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:28:57,914 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:28:57,914 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:28:57,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c [2025-03-09 01:28:58,998 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e73964cc5/41530458853e4921b2eed4f51792aa35/FLAGb3f1ceb46 [2025-03-09 01:28:59,181 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:28:59,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c [2025-03-09 01:28:59,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e73964cc5/41530458853e4921b2eed4f51792aa35/FLAGb3f1ceb46 [2025-03-09 01:28:59,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e73964cc5/41530458853e4921b2eed4f51792aa35 [2025-03-09 01:28:59,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:28:59,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:28:59,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:28:59,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:28:59,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:28:59,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:28:59" (1/1) ... [2025-03-09 01:28:59,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3807b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:59, skipping insertion in model container [2025-03-09 01:28:59,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:28:59" (1/1) ... [2025-03-09 01:28:59,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:28:59,700 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:28:59,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:28:59,713 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:28:59,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:28:59,742 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:28:59,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:59 WrapperNode [2025-03-09 01:28:59,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:28:59,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:28:59,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:28:59,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:28:59,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:59" (1/1) ... [2025-03-09 01:28:59,753 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:59" (1/1) ... [2025-03-09 01:28:59,772 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 122 [2025-03-09 01:28:59,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:28:59,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:28:59,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:28:59,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:28:59,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:59" (1/1) ... [2025-03-09 01:28:59,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:59" (1/1) ... [2025-03-09 01:28:59,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:59" (1/1) ... [2025-03-09 01:28:59,798 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-09 01:28:59,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:59" (1/1) ... [2025-03-09 01:28:59,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:59" (1/1) ... [2025-03-09 01:28:59,804 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:59" (1/1) ... [2025-03-09 01:28:59,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:59" (1/1) ... [2025-03-09 01:28:59,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:59" (1/1) ... [2025-03-09 01:28:59,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:59" (1/1) ... [2025-03-09 01:28:59,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:28:59,816 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:28:59,816 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:28:59,816 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:28:59,817 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:59" (1/1) ... [2025-03-09 01:28:59,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:28:59,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:59,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:28:59,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:28:59,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:28:59,861 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:28:59,861 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:28:59,861 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:28:59,862 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:28:59,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:28:59,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:28:59,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:28:59,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:28:59,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:28:59,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:28:59,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:28:59,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:28:59,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:28:59,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:28:59,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:28:59,863 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:28:59,934 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:28:59,936 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:29:00,174 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:29:00,175 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:29:00,345 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:29:00,345 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:29:00,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:29:00 BoogieIcfgContainer [2025-03-09 01:29:00,346 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:29:00,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:29:00,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:29:00,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:29:00,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:28:59" (1/3) ... [2025-03-09 01:29:00,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674453c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:29:00, skipping insertion in model container [2025-03-09 01:29:00,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:59" (2/3) ... [2025-03-09 01:29:00,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674453c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:29:00, skipping insertion in model container [2025-03-09 01:29:00,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:29:00" (3/3) ... [2025-03-09 01:29:00,353 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2025-03-09 01:29:00,363 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:29:00,364 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-queue.wvr.c that has 3 procedures, 33 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-09 01:29:00,364 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:29:00,410 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:29:00,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 88 flow [2025-03-09 01:29:00,460 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2025-03-09 01:29:00,462 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:29:00,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 35 events. 5/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-09 01:29:00,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 37 transitions, 88 flow [2025-03-09 01:29:00,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 34 transitions, 80 flow [2025-03-09 01:29:00,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:29:00,484 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;@40bc7819, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:29:00,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-09 01:29:00,486 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:29:00,487 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:29:00,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:29:00,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:00,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:29:00,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:00,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:00,494 INFO L85 PathProgramCache]: Analyzing trace with hash 346121, now seen corresponding path program 1 times [2025-03-09 01:29:00,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:00,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959469967] [2025-03-09 01:29:00,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:00,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:00,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:29:00,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:29:00,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:00,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:29:00,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:00,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959469967] [2025-03-09 01:29:00,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959469967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:00,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:00,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:29:00,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324166494] [2025-03-09 01:29:00,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:00,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:29:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:00,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:29:00,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:29:00,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-09 01:29:00,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-03-09 01:29:00,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:00,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-09 01:29:00,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:00,842 INFO L124 PetriNetUnfolderBase]: 212/371 cut-off events. [2025-03-09 01:29:00,842 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-09 01:29:00,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 371 events. 212/371 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1444 event pairs, 176 based on Foata normal form. 1/264 useless extension candidates. Maximal degree in co-relation 705. Up to 364 conditions per place. [2025-03-09 01:29:00,848 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 23 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2025-03-09 01:29:00,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 120 flow [2025-03-09 01:29:00,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:29:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:29:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-03-09 01:29:00,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2025-03-09 01:29:00,862 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 80 flow. Second operand 3 states and 50 transitions. [2025-03-09 01:29:00,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 120 flow [2025-03-09 01:29:00,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:29:00,866 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2025-03-09 01:29:00,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-03-09 01:29:00,872 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-03-09 01:29:00,872 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2025-03-09 01:29:00,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-03-09 01:29:00,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:00,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:29:00,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:29:00,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:00,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:00,874 INFO L85 PathProgramCache]: Analyzing trace with hash 346122, now seen corresponding path program 1 times [2025-03-09 01:29:00,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:00,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570990938] [2025-03-09 01:29:00,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:00,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:00,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:29:00,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:29:00,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:00,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:29:01,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:01,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570990938] [2025-03-09 01:29:01,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570990938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:01,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:01,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:29:01,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861428502] [2025-03-09 01:29:01,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:01,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:29:01,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:01,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:29:01,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:29:01,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-09 01:29:01,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-03-09 01:29:01,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:01,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-09 01:29:01,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:01,238 INFO L124 PetriNetUnfolderBase]: 213/374 cut-off events. [2025-03-09 01:29:01,238 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:29:01,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 374 events. 213/374 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1459 event pairs, 176 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 737. Up to 369 conditions per place. [2025-03-09 01:29:01,241 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 25 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-03-09 01:29:01,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 132 flow [2025-03-09 01:29:01,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:29:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:29:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-03-09 01:29:01,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3918918918918919 [2025-03-09 01:29:01,244 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 58 transitions. [2025-03-09 01:29:01,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 132 flow [2025-03-09 01:29:01,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:29:01,246 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 89 flow [2025-03-09 01:29:01,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2025-03-09 01:29:01,246 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2025-03-09 01:29:01,246 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 89 flow [2025-03-09 01:29:01,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-03-09 01:29:01,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:01,247 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:29:01,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:29:01,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:01,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash 332633975, now seen corresponding path program 1 times [2025-03-09 01:29:01,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:01,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730611595] [2025-03-09 01:29:01,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:01,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:01,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:29:01,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:29:01,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:01,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:29:01,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:01,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730611595] [2025-03-09 01:29:01,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730611595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:01,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102989267] [2025-03-09 01:29:01,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:01,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:01,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:01,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:29:01,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:29:01,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:29:01,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:29:01,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:01,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:01,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:29:01,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:01,590 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 10 treesize of output 9 [2025-03-09 01:29:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:29:01,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:29:01,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102989267] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:01,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:01,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:29:01,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017213589] [2025-03-09 01:29:01,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:01,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:29:01,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:01,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:29:01,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:29:01,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-09 01:29:01,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 89 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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-03-09 01:29:01,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:01,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-09 01:29:01,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:02,121 INFO L124 PetriNetUnfolderBase]: 214/376 cut-off events. [2025-03-09 01:29:02,122 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:29:02,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 376 events. 214/376 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1459 event pairs, 176 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 744. Up to 366 conditions per place. [2025-03-09 01:29:02,125 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 21 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2025-03-09 01:29:02,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 159 flow [2025-03-09 01:29:02,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:29:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:29:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2025-03-09 01:29:02,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30067567567567566 [2025-03-09 01:29:02,128 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 89 flow. Second operand 8 states and 89 transitions. [2025-03-09 01:29:02,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 159 flow [2025-03-09 01:29:02,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:29:02,129 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 114 flow [2025-03-09 01:29:02,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-03-09 01:29:02,130 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2025-03-09 01:29:02,130 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 114 flow [2025-03-09 01:29:02,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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-03-09 01:29:02,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:02,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:02,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:29:02,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:02,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:02,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1895453906, now seen corresponding path program 1 times [2025-03-09 01:29:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:02,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334266763] [2025-03-09 01:29:02,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:02,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:02,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:29:02,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:29:02,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:02,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:29:02,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:02,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334266763] [2025-03-09 01:29:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334266763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:02,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:02,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:29:02,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326980050] [2025-03-09 01:29:02,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:02,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:29:02,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:02,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:29:02,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:29:02,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:29:02,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-03-09 01:29:02,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:02,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:29:02,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:02,507 INFO L124 PetriNetUnfolderBase]: 281/515 cut-off events. [2025-03-09 01:29:02,507 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-09 01:29:02,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 515 events. 281/515 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2229 event pairs, 244 based on Foata normal form. 23/406 useless extension candidates. Maximal degree in co-relation 745. Up to 370 conditions per place. [2025-03-09 01:29:02,511 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 41 selfloop transitions, 3 changer transitions 2/49 dead transitions. [2025-03-09 01:29:02,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 240 flow [2025-03-09 01:29:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:29:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:29:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-03-09 01:29:02,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5472972972972973 [2025-03-09 01:29:02,513 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 114 flow. Second operand 4 states and 81 transitions. [2025-03-09 01:29:02,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 240 flow [2025-03-09 01:29:02,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 198 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-09 01:29:02,515 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 91 flow [2025-03-09 01:29:02,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-03-09 01:29:02,515 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2025-03-09 01:29:02,515 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 91 flow [2025-03-09 01:29:02,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-03-09 01:29:02,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:02,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:02,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:29:02,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:02,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1292445119, now seen corresponding path program 1 times [2025-03-09 01:29:02,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:02,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359757601] [2025-03-09 01:29:02,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:02,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:02,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:29:02,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:29:02,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:02,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:29:02,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:02,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359757601] [2025-03-09 01:29:02,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359757601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:02,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612447946] [2025-03-09 01:29:02,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:02,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:02,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:02,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:29:02,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:29:02,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:29:02,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:29:02,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:02,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:02,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:29:02,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:02,739 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-03-09 01:29:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:29:02,809 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:29:02,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612447946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:02,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:29:02,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-03-09 01:29:02,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136636196] [2025-03-09 01:29:02,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:02,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:29:02,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:02,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:29:02,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:29:02,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:29:02,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:29:02,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:02,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:29:02,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:02,901 INFO L124 PetriNetUnfolderBase]: 233/434 cut-off events. [2025-03-09 01:29:02,901 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-09 01:29:02,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 434 events. 233/434 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1831 event pairs, 200 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 648. Up to 419 conditions per place. [2025-03-09 01:29:02,903 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 25 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-03-09 01:29:02,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 141 flow [2025-03-09 01:29:02,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:29:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:29:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-03-09 01:29:02,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38513513513513514 [2025-03-09 01:29:02,904 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 91 flow. Second operand 4 states and 57 transitions. [2025-03-09 01:29:02,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 141 flow [2025-03-09 01:29:02,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:29:02,907 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 86 flow [2025-03-09 01:29:02,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2025-03-09 01:29:02,908 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2025-03-09 01:29:02,909 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 86 flow [2025-03-09 01:29:02,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:29:02,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:02,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:02,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:29:03,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:03,113 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:03,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1292445118, now seen corresponding path program 1 times [2025-03-09 01:29:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:03,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039201153] [2025-03-09 01:29:03,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:03,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:29:03,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:29:03,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:03,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:29:03,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:03,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039201153] [2025-03-09 01:29:03,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039201153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:03,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:03,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:29:03,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170354854] [2025-03-09 01:29:03,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:03,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:29:03,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:03,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:29:03,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:29:03,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-09 01:29:03,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-03-09 01:29:03,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:03,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-09 01:29:03,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:03,221 INFO L124 PetriNetUnfolderBase]: 191/363 cut-off events. [2025-03-09 01:29:03,221 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-09 01:29:03,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 363 events. 191/363 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1467 event pairs, 162 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 458. Up to 348 conditions per place. [2025-03-09 01:29:03,223 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 23 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2025-03-09 01:29:03,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 132 flow [2025-03-09 01:29:03,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:29:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:29:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-03-09 01:29:03,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34459459459459457 [2025-03-09 01:29:03,224 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 86 flow. Second operand 4 states and 51 transitions. [2025-03-09 01:29:03,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 132 flow [2025-03-09 01:29:03,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:29:03,225 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 81 flow [2025-03-09 01:29:03,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2025-03-09 01:29:03,226 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2025-03-09 01:29:03,226 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 81 flow [2025-03-09 01:29:03,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-03-09 01:29:03,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:03,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:03,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:29:03,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:03,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:03,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1057095895, now seen corresponding path program 1 times [2025-03-09 01:29:03,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:03,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116146833] [2025-03-09 01:29:03,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:03,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:03,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:29:03,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:29:03,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:03,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:29:03,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:03,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116146833] [2025-03-09 01:29:03,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116146833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:03,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:03,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:29:03,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110343208] [2025-03-09 01:29:03,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:03,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:29:03,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:03,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:29:03,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:29:03,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:29:03,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03-09 01:29:03,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:03,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:29:03,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:03,332 INFO L124 PetriNetUnfolderBase]: 272/497 cut-off events. [2025-03-09 01:29:03,332 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-09 01:29:03,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 497 events. 272/497 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2016 event pairs, 150 based on Foata normal form. 2/422 useless extension candidates. Maximal degree in co-relation 751. Up to 315 conditions per place. [2025-03-09 01:29:03,334 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 34 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2025-03-09 01:29:03,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 193 flow [2025-03-09 01:29:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:29:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:29:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-09 01:29:03,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5315315315315315 [2025-03-09 01:29:03,336 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 81 flow. Second operand 3 states and 59 transitions. [2025-03-09 01:29:03,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 193 flow [2025-03-09 01:29:03,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:29:03,337 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 84 flow [2025-03-09 01:29:03,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-03-09 01:29:03,338 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2025-03-09 01:29:03,338 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 84 flow [2025-03-09 01:29:03,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03-09 01:29:03,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:03,338 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:03,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:29:03,338 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:03,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:03,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1820184053, now seen corresponding path program 1 times [2025-03-09 01:29:03,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:03,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694626836] [2025-03-09 01:29:03,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:03,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:03,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:29:03,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:29:03,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:03,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:29:03,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:03,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694626836] [2025-03-09 01:29:03,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694626836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:03,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:03,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:29:03,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62408575] [2025-03-09 01:29:03,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:03,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:29:03,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:03,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:29:03,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:29:03,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:29:03,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-03-09 01:29:03,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:03,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:29:03,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:03,424 INFO L124 PetriNetUnfolderBase]: 252/452 cut-off events. [2025-03-09 01:29:03,425 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-09 01:29:03,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 452 events. 252/452 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1663 event pairs, 113 based on Foata normal form. 11/391 useless extension candidates. Maximal degree in co-relation 983. Up to 306 conditions per place. [2025-03-09 01:29:03,427 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 33 selfloop transitions, 2 changer transitions 6/44 dead transitions. [2025-03-09 01:29:03,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 199 flow [2025-03-09 01:29:03,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:29:03,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:29:03,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-03-09 01:29:03,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2025-03-09 01:29:03,429 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 84 flow. Second operand 3 states and 60 transitions. [2025-03-09 01:29:03,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 199 flow [2025-03-09 01:29:03,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:29:03,431 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 96 flow [2025-03-09 01:29:03,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2025-03-09 01:29:03,431 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2025-03-09 01:29:03,431 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 96 flow [2025-03-09 01:29:03,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-03-09 01:29:03,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:03,432 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:03,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:29:03,433 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:03,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:03,434 INFO L85 PathProgramCache]: Analyzing trace with hash 936257017, now seen corresponding path program 1 times [2025-03-09 01:29:03,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:03,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567173290] [2025-03-09 01:29:03,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:03,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:03,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:29:03,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:29:03,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:03,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:29:03,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:03,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567173290] [2025-03-09 01:29:03,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567173290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:03,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803366220] [2025-03-09 01:29:03,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:03,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:03,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:03,717 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:29:03,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:29:03,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:29:03,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:29:03,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:03,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:03,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 01:29:03,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:03,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-09 01:29:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:29:03,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:04,275 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 38 treesize of output 34 [2025-03-09 01:29:04,288 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:29:04,288 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 46 treesize of output 37 [2025-03-09 01:29:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:29:04,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803366220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:04,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:04,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-09 01:29:04,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037023590] [2025-03-09 01:29:04,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:04,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:29:04,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:04,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:29:04,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:29:04,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:29:04,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 96 flow. Second operand has 15 states, 15 states have (on average 11.8) internal successors, (177), 15 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:29:04,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:04,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:29:04,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:04,793 INFO L124 PetriNetUnfolderBase]: 581/1029 cut-off events. [2025-03-09 01:29:04,793 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2025-03-09 01:29:04,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2398 conditions, 1029 events. 581/1029 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4645 event pairs, 251 based on Foata normal form. 2/871 useless extension candidates. Maximal degree in co-relation 1339. Up to 294 conditions per place. [2025-03-09 01:29:04,797 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 30 selfloop transitions, 6 changer transitions 48/87 dead transitions. [2025-03-09 01:29:04,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 87 transitions, 418 flow [2025-03-09 01:29:04,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:29:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:29:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2025-03-09 01:29:04,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46846846846846846 [2025-03-09 01:29:04,800 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 96 flow. Second operand 9 states and 156 transitions. [2025-03-09 01:29:04,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 87 transitions, 418 flow [2025-03-09 01:29:04,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 87 transitions, 411 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-09 01:29:04,802 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 110 flow [2025-03-09 01:29:04,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=110, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2025-03-09 01:29:04,803 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2025-03-09 01:29:04,804 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 110 flow [2025-03-09 01:29:04,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.8) internal successors, (177), 15 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:29:04,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:04,805 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:04,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:29:05,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:05,006 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:05,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:05,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1297917046, now seen corresponding path program 2 times [2025-03-09 01:29:05,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:05,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238431150] [2025-03-09 01:29:05,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:29:05,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:05,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-09 01:29:05,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-09 01:29:05,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:29:05,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:29:05,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:05,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238431150] [2025-03-09 01:29:05,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238431150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:05,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:05,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:29:05,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434979577] [2025-03-09 01:29:05,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:05,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:29:05,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:05,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:29:05,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:29:05,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:29:05,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-03-09 01:29:05,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:05,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:29:05,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:05,209 INFO L124 PetriNetUnfolderBase]: 331/587 cut-off events. [2025-03-09 01:29:05,209 INFO L125 PetriNetUnfolderBase]: For 351/351 co-relation queries the response was YES. [2025-03-09 01:29:05,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 587 events. 331/587 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2155 event pairs, 68 based on Foata normal form. 1/497 useless extension candidates. Maximal degree in co-relation 1398. Up to 157 conditions per place. [2025-03-09 01:29:05,212 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 49 selfloop transitions, 4 changer transitions 12/68 dead transitions. [2025-03-09 01:29:05,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 68 transitions, 341 flow [2025-03-09 01:29:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:29:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:29:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2025-03-09 01:29:05,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5513513513513514 [2025-03-09 01:29:05,213 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 110 flow. Second operand 5 states and 102 transitions. [2025-03-09 01:29:05,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 68 transitions, 341 flow [2025-03-09 01:29:05,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 68 transitions, 315 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-03-09 01:29:05,215 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 110 flow [2025-03-09 01:29:05,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-03-09 01:29:05,215 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2025-03-09 01:29:05,216 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 110 flow [2025-03-09 01:29:05,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-03-09 01:29:05,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:05,216 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:05,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:29:05,216 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:05,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash -317968211, now seen corresponding path program 3 times [2025-03-09 01:29:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:05,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021530347] [2025-03-09 01:29:05,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:29:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:05,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-03-09 01:29:05,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 31 statements. [2025-03-09 01:29:05,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:29:05,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:29:05,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:05,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021530347] [2025-03-09 01:29:05,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021530347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:05,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:05,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:29:05,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591402951] [2025-03-09 01:29:05,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:05,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:29:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:05,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:29:05,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:29:05,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:29:05,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-03-09 01:29:05,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:05,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:29:05,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:05,398 INFO L124 PetriNetUnfolderBase]: 719/1269 cut-off events. [2025-03-09 01:29:05,399 INFO L125 PetriNetUnfolderBase]: For 747/747 co-relation queries the response was YES. [2025-03-09 01:29:05,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3001 conditions, 1269 events. 719/1269 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5535 event pairs, 280 based on Foata normal form. 22/1093 useless extension candidates. Maximal degree in co-relation 2972. Up to 462 conditions per place. [2025-03-09 01:29:05,403 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 54 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2025-03-09 01:29:05,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 342 flow [2025-03-09 01:29:05,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:29:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:29:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-03-09 01:29:05,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5743243243243243 [2025-03-09 01:29:05,404 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 110 flow. Second operand 4 states and 85 transitions. [2025-03-09 01:29:05,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 342 flow [2025-03-09 01:29:05,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 64 transitions, 328 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 01:29:05,406 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 174 flow [2025-03-09 01:29:05,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2025-03-09 01:29:05,406 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2025-03-09 01:29:05,406 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 174 flow [2025-03-09 01:29:05,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-03-09 01:29:05,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:05,407 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:05,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:29:05,407 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:05,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:05,407 INFO L85 PathProgramCache]: Analyzing trace with hash -273393397, now seen corresponding path program 4 times [2025-03-09 01:29:05,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:05,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105675911] [2025-03-09 01:29:05,409 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:29:05,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:05,417 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-09 01:29:05,432 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:29:05,432 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:29:05,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:29:05,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:05,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105675911] [2025-03-09 01:29:05,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105675911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:05,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731092021] [2025-03-09 01:29:05,540 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:29:05,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:05,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:05,541 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:29:05,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:29:05,579 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-09 01:29:05,605 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:29:05,606 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:29:05,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:05,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:29:05,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:29:05,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:05,666 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:29:05,667 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 24 treesize of output 11 [2025-03-09 01:29:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:29:05,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731092021] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:05,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:05,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-09 01:29:05,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299048677] [2025-03-09 01:29:05,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:05,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:29:05,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:05,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:29:05,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:29:05,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:29:05,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-03-09 01:29:05,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:05,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:29:05,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:05,864 INFO L124 PetriNetUnfolderBase]: 959/1673 cut-off events. [2025-03-09 01:29:05,865 INFO L125 PetriNetUnfolderBase]: For 1715/1715 co-relation queries the response was YES. [2025-03-09 01:29:05,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4288 conditions, 1673 events. 959/1673 cut-off events. For 1715/1715 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7595 event pairs, 190 based on Foata normal form. 4/1415 useless extension candidates. Maximal degree in co-relation 4259. Up to 427 conditions per place. [2025-03-09 01:29:05,871 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 56 selfloop transitions, 12 changer transitions 18/89 dead transitions. [2025-03-09 01:29:05,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 89 transitions, 502 flow [2025-03-09 01:29:05,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:29:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:29:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2025-03-09 01:29:05,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5765765765765766 [2025-03-09 01:29:05,872 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 174 flow. Second operand 6 states and 128 transitions. [2025-03-09 01:29:05,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 89 transitions, 502 flow [2025-03-09 01:29:05,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 488 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-03-09 01:29:05,876 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 249 flow [2025-03-09 01:29:05,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-03-09 01:29:05,877 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2025-03-09 01:29:05,877 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 249 flow [2025-03-09 01:29:05,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-03-09 01:29:05,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:05,877 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:05,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:29:06,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:06,078 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:06,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:06,078 INFO L85 PathProgramCache]: Analyzing trace with hash -880026115, now seen corresponding path program 5 times [2025-03-09 01:29:06,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:06,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129269128] [2025-03-09 01:29:06,078 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:29:06,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:06,083 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 3 equivalence classes. [2025-03-09 01:29:06,095 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:29:06,095 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:29:06,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:06,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:06,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129269128] [2025-03-09 01:29:06,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129269128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:06,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655584824] [2025-03-09 01:29:06,447 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:29:06,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:06,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:06,449 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:29:06,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:29:06,487 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 3 equivalence classes. [2025-03-09 01:29:06,508 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:29:06,509 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:29:06,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:06,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 01:29:06,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:06,762 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:29:06,762 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 23 treesize of output 10 [2025-03-09 01:29:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:06,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:06,795 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-09 01:29:06,796 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 25 treesize of output 13 [2025-03-09 01:29:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:07,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655584824] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:07,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:07,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-09 01:29:07,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245110890] [2025-03-09 01:29:07,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:07,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:29:07,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:07,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:29:07,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:29:07,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:29:07,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 249 flow. Second operand has 22 states, 22 states have (on average 11.409090909090908) internal successors, (251), 22 states have internal predecessors, (251), 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-03-09 01:29:07,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:07,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:29:07,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:08,621 INFO L124 PetriNetUnfolderBase]: 3117/5391 cut-off events. [2025-03-09 01:29:08,622 INFO L125 PetriNetUnfolderBase]: For 8768/8768 co-relation queries the response was YES. [2025-03-09 01:29:08,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14530 conditions, 5391 events. 3117/5391 cut-off events. For 8768/8768 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 30327 event pairs, 560 based on Foata normal form. 6/4561 useless extension candidates. Maximal degree in co-relation 10037. Up to 1226 conditions per place. [2025-03-09 01:29:08,643 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 216 selfloop transitions, 48 changer transitions 45/312 dead transitions. [2025-03-09 01:29:08,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 312 transitions, 1980 flow [2025-03-09 01:29:08,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 01:29:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-09 01:29:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 493 transitions. [2025-03-09 01:29:08,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.532972972972973 [2025-03-09 01:29:08,646 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 249 flow. Second operand 25 states and 493 transitions. [2025-03-09 01:29:08,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 312 transitions, 1980 flow [2025-03-09 01:29:08,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 312 transitions, 1812 flow, removed 56 selfloop flow, removed 4 redundant places. [2025-03-09 01:29:08,660 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 841 flow [2025-03-09 01:29:08,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=841, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2025-03-09 01:29:08,660 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 46 predicate places. [2025-03-09 01:29:08,660 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 841 flow [2025-03-09 01:29:08,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.409090909090908) internal successors, (251), 22 states have internal predecessors, (251), 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-03-09 01:29:08,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:08,661 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:08,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:29:08,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-09 01:29:08,861 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:08,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:08,862 INFO L85 PathProgramCache]: Analyzing trace with hash -441732044, now seen corresponding path program 6 times [2025-03-09 01:29:08,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:08,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140270164] [2025-03-09 01:29:08,862 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:29:08,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:08,868 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 4 equivalence classes. [2025-03-09 01:29:08,888 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 36 statements. [2025-03-09 01:29:08,888 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:29:08,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:29:09,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:09,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140270164] [2025-03-09 01:29:09,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140270164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:09,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385028522] [2025-03-09 01:29:09,022 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:29:09,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:09,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:09,024 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:29:09,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:29:09,063 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 4 equivalence classes. [2025-03-09 01:29:09,085 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 36 statements. [2025-03-09 01:29:09,085 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:29:09,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:09,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:29:09,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:09,148 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:29:09,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:09,171 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-09 01:29:09,171 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 25 treesize of output 13 [2025-03-09 01:29:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:29:09,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385028522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:09,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:09,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-09 01:29:09,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622314798] [2025-03-09 01:29:09,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:09,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:29:09,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:09,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:29:09,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:29:09,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:29:09,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 841 flow. Second operand has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 11 states have internal predecessors, (141), 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-03-09 01:29:09,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:09,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:29:09,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:10,142 INFO L124 PetriNetUnfolderBase]: 7344/12606 cut-off events. [2025-03-09 01:29:10,143 INFO L125 PetriNetUnfolderBase]: For 22754/22754 co-relation queries the response was YES. [2025-03-09 01:29:10,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34376 conditions, 12606 events. 7344/12606 cut-off events. For 22754/22754 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 82027 event pairs, 1383 based on Foata normal form. 59/10711 useless extension candidates. Maximal degree in co-relation 32645. Up to 2300 conditions per place. [2025-03-09 01:29:10,197 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 149 selfloop transitions, 104 changer transitions 54/310 dead transitions. [2025-03-09 01:29:10,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 310 transitions, 2825 flow [2025-03-09 01:29:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:29:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:29:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 285 transitions. [2025-03-09 01:29:10,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925155925155925 [2025-03-09 01:29:10,199 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 841 flow. Second operand 13 states and 285 transitions. [2025-03-09 01:29:10,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 310 transitions, 2825 flow [2025-03-09 01:29:10,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 310 transitions, 2357 flow, removed 232 selfloop flow, removed 2 redundant places. [2025-03-09 01:29:10,239 INFO L231 Difference]: Finished difference. Result has 103 places, 167 transitions, 1881 flow [2025-03-09 01:29:10,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1881, PETRI_PLACES=103, PETRI_TRANSITIONS=167} [2025-03-09 01:29:10,240 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 67 predicate places. [2025-03-09 01:29:10,240 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 167 transitions, 1881 flow [2025-03-09 01:29:10,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.818181818181818) internal successors, (141), 11 states have internal predecessors, (141), 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-03-09 01:29:10,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:10,241 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:10,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:29:10,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:10,441 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:10,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:10,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1525592604, now seen corresponding path program 7 times [2025-03-09 01:29:10,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:10,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363604127] [2025-03-09 01:29:10,442 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:29:10,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:10,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 01:29:10,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:29:10,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:10,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 01:29:10,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:10,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363604127] [2025-03-09 01:29:10,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363604127] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:10,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142150893] [2025-03-09 01:29:10,549 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:29:10,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:10,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:10,551 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:29:10,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:29:10,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 01:29:10,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:29:10,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:10,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:10,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:29:10,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 01:29:10,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 01:29:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142150893] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:10,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:10,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-09 01:29:10,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558506266] [2025-03-09 01:29:10,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:10,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:29:10,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:10,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:29:10,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:29:10,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:29:10,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 167 transitions, 1881 flow. Second operand has 18 states, 18 states have (on average 11.222222222222221) internal successors, (202), 18 states have internal predecessors, (202), 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-03-09 01:29:10,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:10,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:29:10,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:11,236 INFO L124 PetriNetUnfolderBase]: 2973/5189 cut-off events. [2025-03-09 01:29:11,236 INFO L125 PetriNetUnfolderBase]: For 11864/11864 co-relation queries the response was YES. [2025-03-09 01:29:11,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14560 conditions, 5189 events. 2973/5189 cut-off events. For 11864/11864 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 30667 event pairs, 2359 based on Foata normal form. 52/4426 useless extension candidates. Maximal degree in co-relation 14498. Up to 4122 conditions per place. [2025-03-09 01:29:11,254 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 63 selfloop transitions, 6 changer transitions 48/120 dead transitions. [2025-03-09 01:29:11,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 120 transitions, 1197 flow [2025-03-09 01:29:11,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:29:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:29:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2025-03-09 01:29:11,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43543543543543545 [2025-03-09 01:29:11,255 INFO L175 Difference]: Start difference. First operand has 103 places, 167 transitions, 1881 flow. Second operand 9 states and 145 transitions. [2025-03-09 01:29:11,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 120 transitions, 1197 flow [2025-03-09 01:29:11,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 120 transitions, 988 flow, removed 92 selfloop flow, removed 10 redundant places. [2025-03-09 01:29:11,286 INFO L231 Difference]: Finished difference. Result has 90 places, 72 transitions, 575 flow [2025-03-09 01:29:11,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=575, PETRI_PLACES=90, PETRI_TRANSITIONS=72} [2025-03-09 01:29:11,287 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 54 predicate places. [2025-03-09 01:29:11,287 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 72 transitions, 575 flow [2025-03-09 01:29:11,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.222222222222221) internal successors, (202), 18 states have internal predecessors, (202), 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-03-09 01:29:11,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:11,287 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:11,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:29:11,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:11,488 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:11,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:11,489 INFO L85 PathProgramCache]: Analyzing trace with hash -187907309, now seen corresponding path program 8 times [2025-03-09 01:29:11,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:11,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307794801] [2025-03-09 01:29:11,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:29:11,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:11,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 01:29:11,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:29:11,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:29:11,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:29:11,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:11,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307794801] [2025-03-09 01:29:11,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307794801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:11,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908151778] [2025-03-09 01:29:11,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:29:11,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:11,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:11,749 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:29:11,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:29:11,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 01:29:11,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:29:11,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:29:11,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:11,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:29:11,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:29:12,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:12,318 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:29:12,318 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 24 treesize of output 11 [2025-03-09 01:29:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:29:12,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908151778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:12,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:12,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2025-03-09 01:29:12,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312584080] [2025-03-09 01:29:12,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:12,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 01:29:12,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:12,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 01:29:12,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2025-03-09 01:29:12,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:29:12,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 72 transitions, 575 flow. Second operand has 29 states, 29 states have (on average 11.379310344827585) internal successors, (330), 29 states have internal predecessors, (330), 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-03-09 01:29:12,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:12,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:29:12,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:14,276 INFO L124 PetriNetUnfolderBase]: 8912/15388 cut-off events. [2025-03-09 01:29:14,276 INFO L125 PetriNetUnfolderBase]: For 17639/17639 co-relation queries the response was YES. [2025-03-09 01:29:14,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39096 conditions, 15388 events. 8912/15388 cut-off events. For 17639/17639 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 107980 event pairs, 3264 based on Foata normal form. 80/13068 useless extension candidates. Maximal degree in co-relation 37675. Up to 3538 conditions per place. [2025-03-09 01:29:14,319 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 69 selfloop transitions, 15 changer transitions 259/346 dead transitions. [2025-03-09 01:29:14,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 346 transitions, 2883 flow [2025-03-09 01:29:14,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:29:14,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 01:29:14,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 359 transitions. [2025-03-09 01:29:14,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.462033462033462 [2025-03-09 01:29:14,321 INFO L175 Difference]: Start difference. First operand has 90 places, 72 transitions, 575 flow. Second operand 21 states and 359 transitions. [2025-03-09 01:29:14,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 346 transitions, 2883 flow [2025-03-09 01:29:14,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 346 transitions, 2815 flow, removed 22 selfloop flow, removed 7 redundant places. [2025-03-09 01:29:14,392 INFO L231 Difference]: Finished difference. Result has 104 places, 79 transitions, 752 flow [2025-03-09 01:29:14,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=752, PETRI_PLACES=104, PETRI_TRANSITIONS=79} [2025-03-09 01:29:14,392 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 68 predicate places. [2025-03-09 01:29:14,392 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 79 transitions, 752 flow [2025-03-09 01:29:14,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 11.379310344827585) internal successors, (330), 29 states have internal predecessors, (330), 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-03-09 01:29:14,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:14,393 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:14,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:29:14,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 01:29:14,594 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:29:14,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:14,594 INFO L85 PathProgramCache]: Analyzing trace with hash 398545465, now seen corresponding path program 9 times [2025-03-09 01:29:14,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:14,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786665597] [2025-03-09 01:29:14,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:29:14,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:14,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 6 equivalence classes. [2025-03-09 01:29:14,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 46 statements. [2025-03-09 01:29:14,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:29:14,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:14,801 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:29:14,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:14,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786665597] [2025-03-09 01:29:14,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786665597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:14,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8949225] [2025-03-09 01:29:14,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:29:14,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:14,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:14,804 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:29:14,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:29:14,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 6 equivalence classes. [2025-03-09 01:29:14,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 46 statements. [2025-03-09 01:29:14,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:29:14,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:14,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:29:14,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:15,108 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:29:15,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:15,253 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:29:15,254 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 24 treesize of output 11 [2025-03-09 01:29:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:29:15,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8949225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:15,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:15,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-09 01:29:15,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545504175] [2025-03-09 01:29:15,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:15,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:29:15,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:15,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:29:15,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:29:15,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:29:15,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 79 transitions, 752 flow. Second operand has 18 states, 18 states have (on average 12.277777777777779) internal successors, (221), 18 states have internal predecessors, (221), 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-03-09 01:29:15,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:15,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:29:15,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:16,033 INFO L124 PetriNetUnfolderBase]: 3838/6594 cut-off events. [2025-03-09 01:29:16,033 INFO L125 PetriNetUnfolderBase]: For 12748/12748 co-relation queries the response was YES. [2025-03-09 01:29:16,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17854 conditions, 6594 events. 3838/6594 cut-off events. For 12748/12748 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 38619 event pairs, 752 based on Foata normal form. 16/5589 useless extension candidates. Maximal degree in co-relation 17818. Up to 1725 conditions per place. [2025-03-09 01:29:16,049 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 0 selfloop transitions, 0 changer transitions 169/169 dead transitions. [2025-03-09 01:29:16,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 169 transitions, 1506 flow [2025-03-09 01:29:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:29:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:29:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2025-03-09 01:29:16,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.543918918918919 [2025-03-09 01:29:16,051 INFO L175 Difference]: Start difference. First operand has 104 places, 79 transitions, 752 flow. Second operand 8 states and 161 transitions. [2025-03-09 01:29:16,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 169 transitions, 1506 flow [2025-03-09 01:29:16,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 169 transitions, 1151 flow, removed 112 selfloop flow, removed 23 redundant places. [2025-03-09 01:29:16,083 INFO L231 Difference]: Finished difference. Result has 77 places, 0 transitions, 0 flow [2025-03-09 01:29:16,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=77, PETRI_TRANSITIONS=0} [2025-03-09 01:29:16,084 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 41 predicate places. [2025-03-09 01:29:16,084 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 0 transitions, 0 flow [2025-03-09 01:29:16,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.277777777777779) internal successors, (221), 18 states have internal predecessors, (221), 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-03-09 01:29:16,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2025-03-09 01:29:16,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-03-09 01:29:16,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-03-09 01:29:16,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2025-03-09 01:29:16,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2025-03-09 01:29:16,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-03-09 01:29:16,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (7 of 14 remaining) [2025-03-09 01:29:16,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2025-03-09 01:29:16,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2025-03-09 01:29:16,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2025-03-09 01:29:16,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2025-03-09 01:29:16,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-03-09 01:29:16,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-03-09 01:29:16,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2025-03-09 01:29:16,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:29:16,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:29:16,293 INFO L422 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:16,297 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:29:16,297 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:29:16,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:29:16 BasicIcfg [2025-03-09 01:29:16,302 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:29:16,303 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:29:16,303 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:29:16,303 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:29:16,303 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:29:00" (3/4) ... [2025-03-09 01:29:16,305 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:29:16,306 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-09 01:29:16,306 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-09 01:29:16,311 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2025-03-09 01:29:16,311 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2025-03-09 01:29:16,312 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-09 01:29:16,312 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-09 01:29:16,371 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:29:16,372 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:29:16,372 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:29:16,373 INFO L158 Benchmark]: Toolchain (without parser) took 16812.16ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 105.2MB in the beginning and 515.5MB in the end (delta: -410.3MB). Peak memory consumption was 376.1MB. Max. memory is 16.1GB. [2025-03-09 01:29:16,373 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:29:16,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.96ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 93.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:29:16,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.25ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:29:16,374 INFO L158 Benchmark]: Boogie Preprocessor took 41.53ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 90.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:29:16,375 INFO L158 Benchmark]: IcfgBuilder took 529.56ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 53.8MB in the end (delta: 36.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 01:29:16,375 INFO L158 Benchmark]: TraceAbstraction took 15955.01ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 53.8MB in the beginning and 520.0MB in the end (delta: -466.2MB). Peak memory consumption was 703.3MB. Max. memory is 16.1GB. [2025-03-09 01:29:16,375 INFO L158 Benchmark]: Witness Printer took 69.21ms. Allocated memory is still 931.1MB. Free memory was 520.0MB in the beginning and 515.5MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:29:16,377 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.27ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.96ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 93.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.25ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.53ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 90.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 529.56ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 53.8MB in the end (delta: 36.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15955.01ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 53.8MB in the beginning and 520.0MB in the end (delta: -466.2MB). Peak memory consumption was 703.3MB. Max. memory is 16.1GB. * Witness Printer took 69.21ms. Allocated memory is still 931.1MB. Free memory was 520.0MB in the beginning and 515.5MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 70]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 59 edges, 14 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: 15.9s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1471 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1439 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 173 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3915 IncrementalHoareTripleChecker+Invalid, 4023 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 4 mSDtfsCounter, 3915 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 665 GetRequests, 462 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1881occurred in iteration=14, InterpolantAutomatonStates: 133, 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, 5.4s InterpolantComputationTime, 666 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 895 ConstructedInterpolants, 51 QuantifiedInterpolants, 8360 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1547 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 34 InterpolantComputations, 9 PerfectInterpolantSequences, 385/604 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 01:29:16,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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: TRUE