./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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-queue-add-2.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 8c3fe688d0e9a9929009fc24c8ef56c8fc1bfa15613131b287e178eb7d2f1f1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:15:45,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:15:45,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:15:45,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:15:45,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:15:45,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:15:45,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:15:45,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:15:45,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:15:45,601 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:15:45,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:15:45,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:15:45,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:15:45,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:15:45,602 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:15:45,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:15:45,602 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:15:45,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:15:45,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:15:45,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:15:45,603 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:15:45,603 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:15:45,603 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:15:45,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:15:45,603 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:15:45,603 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:15:45,603 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:15:45,603 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:15:45,603 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:15:45,603 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:15:45,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:15:45,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:15:45,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:15:45,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:15:45,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:15:45,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:15:45,604 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:15:45,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:15:45,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:15:45,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:15:45,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:15:45,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:15:45,605 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 -> 8c3fe688d0e9a9929009fc24c8ef56c8fc1bfa15613131b287e178eb7d2f1f1e [2025-03-04 10:15:45,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:15:45,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:15:45,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:15:45,827 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:15:45,827 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:15:45,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c [2025-03-04 10:15:46,932 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d82afc22/35e626e0abe44acea45a44dcc368b4c1/FLAG4818ced75 [2025-03-04 10:15:47,164 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:15:47,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c [2025-03-04 10:15:47,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d82afc22/35e626e0abe44acea45a44dcc368b4c1/FLAG4818ced75 [2025-03-04 10:15:47,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d82afc22/35e626e0abe44acea45a44dcc368b4c1 [2025-03-04 10:15:47,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:15:47,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:15:47,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:15:47,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:15:47,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:15:47,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:15:47" (1/1) ... [2025-03-04 10:15:47,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb921b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:47, skipping insertion in model container [2025-03-04 10:15:47,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:15:47" (1/1) ... [2025-03-04 10:15:47,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:15:47,642 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-04 10:15:47,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:15:47,652 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:15:47,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:15:47,678 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:15:47,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:47 WrapperNode [2025-03-04 10:15:47,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:15:47,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:15:47,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:15:47,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:15:47,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:47" (1/1) ... [2025-03-04 10:15:47,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:47" (1/1) ... [2025-03-04 10:15:47,702 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 142 [2025-03-04 10:15:47,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:15:47,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:15:47,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:15:47,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:15:47,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:47" (1/1) ... [2025-03-04 10:15:47,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:47" (1/1) ... [2025-03-04 10:15:47,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:47" (1/1) ... [2025-03-04 10:15:47,731 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 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-04 10:15:47,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:47" (1/1) ... [2025-03-04 10:15:47,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:47" (1/1) ... [2025-03-04 10:15:47,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:47" (1/1) ... [2025-03-04 10:15:47,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:47" (1/1) ... [2025-03-04 10:15:47,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:47" (1/1) ... [2025-03-04 10:15:47,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:47" (1/1) ... [2025-03-04 10:15:47,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:15:47,751 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:15:47,751 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:15:47,751 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:15:47,752 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:47" (1/1) ... [2025-03-04 10:15:47,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:15:47,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:47,776 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-04 10:15:47,778 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-04 10:15:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:15:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:15:47,795 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:15:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:15:47,795 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:15:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:15:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:15:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:15:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:15:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:15:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:15:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:15:47,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:15:47,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:15:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:15:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:15:47,796 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:15:47,868 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:15:47,869 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:15:48,125 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:15:48,125 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:15:48,308 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:15:48,308 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:15:48,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:15:48 BoogieIcfgContainer [2025-03-04 10:15:48,308 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:15:48,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:15:48,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:15:48,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:15:48,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:15:47" (1/3) ... [2025-03-04 10:15:48,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c09d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:15:48, skipping insertion in model container [2025-03-04 10:15:48,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:47" (2/3) ... [2025-03-04 10:15:48,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c09d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:15:48, skipping insertion in model container [2025-03-04 10:15:48,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:15:48" (3/3) ... [2025-03-04 10:15:48,321 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2025-03-04 10:15:48,340 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:15:48,341 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-2.wvr.c that has 3 procedures, 36 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-03-04 10:15:48,342 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:15:48,416 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:15:48,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 92 flow [2025-03-04 10:15:48,476 INFO L124 PetriNetUnfolderBase]: 4/37 cut-off events. [2025-03-04 10:15:48,478 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:15:48,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 37 events. 4/37 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 81 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-04 10:15:48,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 39 transitions, 92 flow [2025-03-04 10:15:48,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 36 transitions, 84 flow [2025-03-04 10:15:48,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:15:48,517 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;@74e13fe1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:15:48,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 10:15:48,520 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:15:48,523 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:15:48,524 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:15:48,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:48,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:15:48,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:15:48,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:48,531 INFO L85 PathProgramCache]: Analyzing trace with hash 409273, now seen corresponding path program 1 times [2025-03-04 10:15:48,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:48,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814236960] [2025-03-04 10:15:48,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:48,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:48,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:15:48,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:15:48,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:48,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:48,686 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-04 10:15:48,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:48,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814236960] [2025-03-04 10:15:48,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814236960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:48,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:48,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:15:48,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836780898] [2025-03-04 10:15:48,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:48,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:15:48,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:48,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:15:48,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:15:48,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-04 10:15:48,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04 10:15:48,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:48,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-04 10:15:48,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:48,853 INFO L124 PetriNetUnfolderBase]: 207/401 cut-off events. [2025-03-04 10:15:48,854 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 10:15:48,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 401 events. 207/401 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1792 event pairs, 172 based on Foata normal form. 1/281 useless extension candidates. Maximal degree in co-relation 721. Up to 336 conditions per place. [2025-03-04 10:15:48,858 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 24 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2025-03-04 10:15:48,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 128 flow [2025-03-04 10:15:48,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:15:48,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:15:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-04 10:15:48,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47863247863247865 [2025-03-04 10:15:48,867 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 84 flow. Second operand 3 states and 56 transitions. [2025-03-04 10:15:48,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 128 flow [2025-03-04 10:15:48,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:15:48,872 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 72 flow [2025-03-04 10:15:48,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2025-03-04 10:15:48,880 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2025-03-04 10:15:48,880 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 72 flow [2025-03-04 10:15:48,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04 10:15:48,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:48,880 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:15:48,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:15:48,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:15:48,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:48,881 INFO L85 PathProgramCache]: Analyzing trace with hash 409274, now seen corresponding path program 1 times [2025-03-04 10:15:48,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:48,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123786028] [2025-03-04 10:15:48,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:48,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:48,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:15:48,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:15:48,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:48,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:49,151 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-04 10:15:49,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:49,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123786028] [2025-03-04 10:15:49,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123786028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:49,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:49,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:15:49,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792086697] [2025-03-04 10:15:49,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:49,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:15:49,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:49,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:15:49,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:15:49,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-04 10:15:49,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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-04 10:15:49,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:49,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-04 10:15:49,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:49,322 INFO L124 PetriNetUnfolderBase]: 208/404 cut-off events. [2025-03-04 10:15:49,322 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:15:49,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 404 events. 208/404 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1803 event pairs, 172 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 741. Up to 341 conditions per place. [2025-03-04 10:15:49,324 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 26 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2025-03-04 10:15:49,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 140 flow [2025-03-04 10:15:49,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-03-04 10:15:49,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42948717948717946 [2025-03-04 10:15:49,326 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 72 flow. Second operand 4 states and 67 transitions. [2025-03-04 10:15:49,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 140 flow [2025-03-04 10:15:49,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:49,327 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 95 flow [2025-03-04 10:15:49,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-03-04 10:15:49,328 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2025-03-04 10:15:49,328 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 95 flow [2025-03-04 10:15:49,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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-04 10:15:49,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:49,328 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:15:49,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:15:49,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:15:49,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:49,329 INFO L85 PathProgramCache]: Analyzing trace with hash 393325656, now seen corresponding path program 1 times [2025-03-04 10:15:49,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:49,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320016119] [2025-03-04 10:15:49,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:49,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:49,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:15:49,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:15:49,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:49,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:49,565 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-04 10:15:49,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:49,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320016119] [2025-03-04 10:15:49,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320016119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:49,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685933817] [2025-03-04 10:15:49,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:49,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:49,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:49,569 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-04 10:15:49,570 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-04 10:15:49,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:15:49,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:15:49,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:49,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:49,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:15:49,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:49,691 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-04 10:15:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:49,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:49,957 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-04 10:15:49,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685933817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:49,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:49,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:15:49,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982368465] [2025-03-04 10:15:49,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:49,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:15:49,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:49,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:15:49,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:49,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-04 10:15:49,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 95 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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-04 10:15:49,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:49,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-04 10:15:49,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:50,203 INFO L124 PetriNetUnfolderBase]: 208/403 cut-off events. [2025-03-04 10:15:50,203 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:15:50,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 403 events. 208/403 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1791 event pairs, 172 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 748. Up to 337 conditions per place. [2025-03-04 10:15:50,207 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 22 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2025-03-04 10:15:50,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 149 flow [2025-03-04 10:15:50,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:15:50,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:15:50,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-03-04 10:15:50,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2025-03-04 10:15:50,208 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 95 flow. Second operand 6 states and 84 transitions. [2025-03-04 10:15:50,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 149 flow [2025-03-04 10:15:50,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:15:50,209 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 102 flow [2025-03-04 10:15:50,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-03-04 10:15:50,209 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2025-03-04 10:15:50,210 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 102 flow [2025-03-04 10:15:50,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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-04 10:15:50,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:50,210 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:15:50,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:15:50,410 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-04 10:15:50,410 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:15:50,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash -689735564, now seen corresponding path program 1 times [2025-03-04 10:15:50,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:50,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404149435] [2025-03-04 10:15:50,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:50,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:50,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:15:50,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:15:50,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:50,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:50,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:50,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404149435] [2025-03-04 10:15:50,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404149435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:50,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:50,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:15:50,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922341034] [2025-03-04 10:15:50,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:50,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:15:50,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:50,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:15:50,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:15:50,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-04 10:15:50,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-04 10:15:50,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:50,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-04 10:15:50,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:50,541 INFO L124 PetriNetUnfolderBase]: 143/285 cut-off events. [2025-03-04 10:15:50,541 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:15:50,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 285 events. 143/285 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1105 event pairs, 113 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 523. Up to 230 conditions per place. [2025-03-04 10:15:50,543 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 23 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-03-04 10:15:50,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 148 flow [2025-03-04 10:15:50,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-03-04 10:15:50,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2025-03-04 10:15:50,544 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 102 flow. Second operand 4 states and 62 transitions. [2025-03-04 10:15:50,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 148 flow [2025-03-04 10:15:50,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 118 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-04 10:15:50,545 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 72 flow [2025-03-04 10:15:50,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2025-03-04 10:15:50,545 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -6 predicate places. [2025-03-04 10:15:50,545 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 72 flow [2025-03-04 10:15:50,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-04 10:15:50,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:50,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:15:50,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:15:50,545 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:15:50,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:50,546 INFO L85 PathProgramCache]: Analyzing trace with hash -689735563, now seen corresponding path program 1 times [2025-03-04 10:15:50,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:50,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500161697] [2025-03-04 10:15:50,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:50,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:50,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:15:50,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:15:50,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:50,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:50,604 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-04 10:15:50,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:50,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500161697] [2025-03-04 10:15:50,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500161697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:50,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:50,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:15:50,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117244075] [2025-03-04 10:15:50,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:50,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:15:50,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:50,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:15:50,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:15:50,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2025-03-04 10:15:50,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-04 10:15:50,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:50,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2025-03-04 10:15:50,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:50,680 INFO L124 PetriNetUnfolderBase]: 155/317 cut-off events. [2025-03-04 10:15:50,680 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:15:50,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 317 events. 155/317 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1227 event pairs, 126 based on Foata normal form. 17/276 useless extension candidates. Maximal degree in co-relation 515. Up to 233 conditions per place. [2025-03-04 10:15:50,681 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 23 selfloop transitions, 2 changer transitions 8/38 dead transitions. [2025-03-04 10:15:50,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 154 flow [2025-03-04 10:15:50,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-03-04 10:15:50,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5064102564102564 [2025-03-04 10:15:50,682 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 72 flow. Second operand 4 states and 79 transitions. [2025-03-04 10:15:50,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 154 flow [2025-03-04 10:15:50,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:50,683 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 81 flow [2025-03-04 10:15:50,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-03-04 10:15:50,683 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2025-03-04 10:15:50,683 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 81 flow [2025-03-04 10:15:50,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-04 10:15:50,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:50,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:50,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:15:50,684 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:15:50,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash 896318999, now seen corresponding path program 1 times [2025-03-04 10:15:50,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:50,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646433332] [2025-03-04 10:15:50,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:50,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:15:50,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:15:50,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:50,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:50,822 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-04 10:15:50,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:50,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646433332] [2025-03-04 10:15:50,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646433332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:50,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:50,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:15:50,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924774447] [2025-03-04 10:15:50,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:50,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:15:50,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:50,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:15:50,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:15:50,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2025-03-04 10:15:50,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-04 10:15:50,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:50,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2025-03-04 10:15:50,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:50,893 INFO L124 PetriNetUnfolderBase]: 89/186 cut-off events. [2025-03-04 10:15:50,893 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 10:15:50,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 186 events. 89/186 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 588 event pairs, 66 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 369. Up to 143 conditions per place. [2025-03-04 10:15:50,895 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 20 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-03-04 10:15:50,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 113 flow [2025-03-04 10:15:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-03-04 10:15:50,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2025-03-04 10:15:50,896 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 81 flow. Second operand 4 states and 63 transitions. [2025-03-04 10:15:50,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 113 flow [2025-03-04 10:15:50,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:50,896 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 69 flow [2025-03-04 10:15:50,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=69, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2025-03-04 10:15:50,897 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2025-03-04 10:15:50,897 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 69 flow [2025-03-04 10:15:50,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-04 10:15:50,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:50,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:50,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:15:50,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:15:50,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1419123930, now seen corresponding path program 1 times [2025-03-04 10:15:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:50,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632108765] [2025-03-04 10:15:50,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:50,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:50,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:15:50,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:15:50,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:50,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:51,064 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-04 10:15:51,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:51,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632108765] [2025-03-04 10:15:51,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632108765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:51,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:51,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:15:51,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048182659] [2025-03-04 10:15:51,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:51,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:15:51,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:51,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:15:51,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:15:51,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-04 10:15:51,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 69 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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-04 10:15:51,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:51,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-04 10:15:51,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:51,212 INFO L124 PetriNetUnfolderBase]: 229/427 cut-off events. [2025-03-04 10:15:51,213 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 10:15:51,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 427 events. 229/427 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1765 event pairs, 63 based on Foata normal form. 1/427 useless extension candidates. Maximal degree in co-relation 929. Up to 155 conditions per place. [2025-03-04 10:15:51,215 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 48 selfloop transitions, 9 changer transitions 7/67 dead transitions. [2025-03-04 10:15:51,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 67 transitions, 304 flow [2025-03-04 10:15:51,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:15:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:15:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2025-03-04 10:15:51,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40705128205128205 [2025-03-04 10:15:51,216 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 69 flow. Second operand 8 states and 127 transitions. [2025-03-04 10:15:51,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 67 transitions, 304 flow [2025-03-04 10:15:51,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 67 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:51,218 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 124 flow [2025-03-04 10:15:51,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=124, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2025-03-04 10:15:51,218 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2025-03-04 10:15:51,219 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 124 flow [2025-03-04 10:15:51,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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-04 10:15:51,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:51,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:51,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:15:51,219 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:15:51,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:51,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1929176550, now seen corresponding path program 2 times [2025-03-04 10:15:51,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:51,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026101630] [2025-03-04 10:15:51,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:51,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:15:51,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-04 10:15:51,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:15:51,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:51,276 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-04 10:15:51,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:51,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026101630] [2025-03-04 10:15:51,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026101630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:51,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:51,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:15:51,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241561646] [2025-03-04 10:15:51,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:51,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:15:51,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:51,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:15:51,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:15:51,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2025-03-04 10:15:51,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:51,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:51,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2025-03-04 10:15:51,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:51,335 INFO L124 PetriNetUnfolderBase]: 145/309 cut-off events. [2025-03-04 10:15:51,335 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-03-04 10:15:51,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 309 events. 145/309 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1177 event pairs, 37 based on Foata normal form. 6/311 useless extension candidates. Maximal degree in co-relation 795. Up to 214 conditions per place. [2025-03-04 10:15:51,337 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 28 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2025-03-04 10:15:51,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 199 flow [2025-03-04 10:15:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:15:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:15:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-04 10:15:51,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49572649572649574 [2025-03-04 10:15:51,338 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 124 flow. Second operand 3 states and 58 transitions. [2025-03-04 10:15:51,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 199 flow [2025-03-04 10:15:51,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 189 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 10:15:51,340 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 133 flow [2025-03-04 10:15:51,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2025-03-04 10:15:51,341 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2025-03-04 10:15:51,341 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 133 flow [2025-03-04 10:15:51,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:51,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:51,341 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] [2025-03-04 10:15:51,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:15:51,341 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:15:51,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:51,342 INFO L85 PathProgramCache]: Analyzing trace with hash -911974179, now seen corresponding path program 1 times [2025-03-04 10:15:51,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:51,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854229830] [2025-03-04 10:15:51,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:51,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:51,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:15:51,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:15:51,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:51,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:15:51,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:51,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854229830] [2025-03-04 10:15:51,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854229830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:51,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278042669] [2025-03-04 10:15:51,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:51,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:51,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:51,506 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-04 10:15:51,507 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-04 10:15:51,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:15:51,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:15:51,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:51,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:51,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:15:51,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:15:51,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:15:51,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278042669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:51,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:51,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-04 10:15:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562787515] [2025-03-04 10:15:51,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:51,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:15:51,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:51,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:15:51,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:15:51,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2025-03-04 10:15:51,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 133 flow. Second operand has 13 states, 13 states have (on average 12.538461538461538) internal successors, (163), 13 states have internal predecessors, (163), 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-04 10:15:51,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:51,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2025-03-04 10:15:51,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:51,986 INFO L124 PetriNetUnfolderBase]: 250/570 cut-off events. [2025-03-04 10:15:51,986 INFO L125 PetriNetUnfolderBase]: For 485/485 co-relation queries the response was YES. [2025-03-04 10:15:51,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 570 events. 250/570 cut-off events. For 485/485 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2745 event pairs, 52 based on Foata normal form. 24/588 useless extension candidates. Maximal degree in co-relation 838. Up to 214 conditions per place. [2025-03-04 10:15:51,989 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 49 selfloop transitions, 10 changer transitions 5/72 dead transitions. [2025-03-04 10:15:51,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 389 flow [2025-03-04 10:15:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:15:51,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:15:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2025-03-04 10:15:51,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2025-03-04 10:15:51,990 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 133 flow. Second operand 9 states and 153 transitions. [2025-03-04 10:15:51,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 72 transitions, 389 flow [2025-03-04 10:15:51,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 364 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:51,993 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 184 flow [2025-03-04 10:15:51,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-03-04 10:15:51,993 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2025-03-04 10:15:51,993 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 184 flow [2025-03-04 10:15:51,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.538461538461538) internal successors, (163), 13 states have internal predecessors, (163), 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-04 10:15:51,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:51,994 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:52,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:15:52,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-04 10:15:52,195 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:15:52,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:52,195 INFO L85 PathProgramCache]: Analyzing trace with hash -812622973, now seen corresponding path program 1 times [2025-03-04 10:15:52,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:52,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468156730] [2025-03-04 10:15:52,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:52,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:52,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:15:52,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:15:52,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:52,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:52,306 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-04 10:15:52,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:52,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468156730] [2025-03-04 10:15:52,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468156730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:52,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781933019] [2025-03-04 10:15:52,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:52,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:52,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:52,309 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-04 10:15:52,310 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-04 10:15:52,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:15:52,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:15:52,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:52,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:52,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:15:52,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:52,411 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-04 10:15:52,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:52,473 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-04 10:15:52,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781933019] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:52,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:52,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:15:52,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371586025] [2025-03-04 10:15:52,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:52,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:15:52,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:52,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:15:52,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:15:52,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2025-03-04 10:15:52,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 184 flow. Second operand has 12 states, 12 states have (on average 13.0) internal successors, (156), 12 states have internal predecessors, (156), 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-04 10:15:52,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:52,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2025-03-04 10:15:52,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:52,599 INFO L124 PetriNetUnfolderBase]: 192/433 cut-off events. [2025-03-04 10:15:52,600 INFO L125 PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES. [2025-03-04 10:15:52,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1240 conditions, 433 events. 192/433 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1878 event pairs, 126 based on Foata normal form. 12/441 useless extension candidates. Maximal degree in co-relation 872. Up to 248 conditions per place. [2025-03-04 10:15:52,602 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 24 selfloop transitions, 5 changer transitions 18/55 dead transitions. [2025-03-04 10:15:52,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 324 flow [2025-03-04 10:15:52,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:15:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:15:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2025-03-04 10:15:52,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4139194139194139 [2025-03-04 10:15:52,603 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 184 flow. Second operand 7 states and 113 transitions. [2025-03-04 10:15:52,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 324 flow [2025-03-04 10:15:52,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 309 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 10:15:52,605 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 163 flow [2025-03-04 10:15:52,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2025-03-04 10:15:52,606 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 15 predicate places. [2025-03-04 10:15:52,606 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 163 flow [2025-03-04 10:15:52,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.0) internal successors, (156), 12 states have internal predecessors, (156), 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-04 10:15:52,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:52,606 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-04 10:15:52,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:15:52,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:52,812 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:15:52,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:52,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1557927709, now seen corresponding path program 2 times [2025-03-04 10:15:52,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:52,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076891436] [2025-03-04 10:15:52,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:52,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:52,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:15:52,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 26 statements. [2025-03-04 10:15:52,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:15:52,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:52,906 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-04 10:15:52,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:52,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076891436] [2025-03-04 10:15:52,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076891436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:52,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:52,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:15:52,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929657299] [2025-03-04 10:15:52,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:52,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:15:52,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:52,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:15:52,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:15:52,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-04 10:15:52,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-04 10:15:52,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:52,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-04 10:15:52,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:53,018 INFO L124 PetriNetUnfolderBase]: 183/363 cut-off events. [2025-03-04 10:15:53,019 INFO L125 PetriNetUnfolderBase]: For 420/421 co-relation queries the response was YES. [2025-03-04 10:15:53,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 363 events. 183/363 cut-off events. For 420/421 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1292 event pairs, 25 based on Foata normal form. 12/372 useless extension candidates. Maximal degree in co-relation 1046. Up to 126 conditions per place. [2025-03-04 10:15:53,021 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 48 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2025-03-04 10:15:53,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 380 flow [2025-03-04 10:15:53,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:15:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:15:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-03-04 10:15:53,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4188034188034188 [2025-03-04 10:15:53,022 INFO L175 Difference]: Start difference. First operand has 54 places, 37 transitions, 163 flow. Second operand 6 states and 98 transitions. [2025-03-04 10:15:53,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 380 flow [2025-03-04 10:15:53,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 334 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-03-04 10:15:53,024 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 186 flow [2025-03-04 10:15:53,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2025-03-04 10:15:53,024 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2025-03-04 10:15:53,024 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 186 flow [2025-03-04 10:15:53,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-04 10:15:53,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:53,025 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] [2025-03-04 10:15:53,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:15:53,025 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:15:53,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:53,025 INFO L85 PathProgramCache]: Analyzing trace with hash 177405489, now seen corresponding path program 2 times [2025-03-04 10:15:53,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:53,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569010240] [2025-03-04 10:15:53,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:53,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:53,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:15:53,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:15:53,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:53,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:53,085 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-04 10:15:53,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:53,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569010240] [2025-03-04 10:15:53,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569010240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:53,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:53,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:15:53,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876452514] [2025-03-04 10:15:53,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:53,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:15:53,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:53,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:15:53,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:15:53,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2025-03-04 10:15:53,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-04 10:15:53,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:53,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2025-03-04 10:15:53,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:53,171 INFO L124 PetriNetUnfolderBase]: 226/532 cut-off events. [2025-03-04 10:15:53,171 INFO L125 PetriNetUnfolderBase]: For 537/552 co-relation queries the response was YES. [2025-03-04 10:15:53,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 532 events. 226/532 cut-off events. For 537/552 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2501 event pairs, 51 based on Foata normal form. 16/539 useless extension candidates. Maximal degree in co-relation 1418. Up to 171 conditions per place. [2025-03-04 10:15:53,174 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 48 selfloop transitions, 8 changer transitions 4/68 dead transitions. [2025-03-04 10:15:53,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 393 flow [2025-03-04 10:15:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:53,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-03-04 10:15:53,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2025-03-04 10:15:53,175 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 186 flow. Second operand 4 states and 88 transitions. [2025-03-04 10:15:53,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 393 flow [2025-03-04 10:15:53,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 387 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 10:15:53,176 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 219 flow [2025-03-04 10:15:53,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-03-04 10:15:53,177 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2025-03-04 10:15:53,177 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 219 flow [2025-03-04 10:15:53,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-04 10:15:53,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:53,177 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, 1] [2025-03-04 10:15:53,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:15:53,177 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:15:53,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:53,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1273631936, now seen corresponding path program 1 times [2025-03-04 10:15:53,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:53,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590364765] [2025-03-04 10:15:53,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:53,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:15:53,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:15:53,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:53,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:15:53,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:53,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590364765] [2025-03-04 10:15:53,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590364765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:53,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266189668] [2025-03-04 10:15:53,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:53,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:53,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:53,760 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-04 10:15:53,761 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-04 10:15:53,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:15:53,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:15:53,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:53,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:53,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 10:15:53,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:54,138 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 11 treesize of output 3 [2025-03-04 10:15:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:15:54,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:54,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:15:54,448 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 26 treesize of output 18 [2025-03-04 10:15:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:15:54,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266189668] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:54,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:54,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2025-03-04 10:15:54,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409077800] [2025-03-04 10:15:54,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:54,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 10:15:54,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:54,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 10:15:54,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1305, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 10:15:54,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-04 10:15:54,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 219 flow. Second operand has 40 states, 40 states have (on average 7.95) internal successors, (318), 40 states have internal predecessors, (318), 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-04 10:15:54,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:54,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-04 10:15:54,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:57,546 INFO L124 PetriNetUnfolderBase]: 1199/2113 cut-off events. [2025-03-04 10:15:57,546 INFO L125 PetriNetUnfolderBase]: For 2704/2704 co-relation queries the response was YES. [2025-03-04 10:15:57,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6660 conditions, 2113 events. 1199/2113 cut-off events. For 2704/2704 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10899 event pairs, 101 based on Foata normal form. 4/2117 useless extension candidates. Maximal degree in co-relation 5085. Up to 663 conditions per place. [2025-03-04 10:15:57,556 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 183 selfloop transitions, 103 changer transitions 44/331 dead transitions. [2025-03-04 10:15:57,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 331 transitions, 2116 flow [2025-03-04 10:15:57,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-04 10:15:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-03-04 10:15:57,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 608 transitions. [2025-03-04 10:15:57,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30568124685771747 [2025-03-04 10:15:57,560 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 219 flow. Second operand 51 states and 608 transitions. [2025-03-04 10:15:57,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 331 transitions, 2116 flow [2025-03-04 10:15:57,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 331 transitions, 2036 flow, removed 40 selfloop flow, removed 1 redundant places. [2025-03-04 10:15:57,569 INFO L231 Difference]: Finished difference. Result has 128 places, 147 transitions, 1307 flow [2025-03-04 10:15:57,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=1307, PETRI_PLACES=128, PETRI_TRANSITIONS=147} [2025-03-04 10:15:57,570 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 89 predicate places. [2025-03-04 10:15:57,570 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 147 transitions, 1307 flow [2025-03-04 10:15:57,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.95) internal successors, (318), 40 states have internal predecessors, (318), 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-04 10:15:57,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:57,571 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, 1] [2025-03-04 10:15:57,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:15:57,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:57,771 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:15:57,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:57,772 INFO L85 PathProgramCache]: Analyzing trace with hash 219351280, now seen corresponding path program 2 times [2025-03-04 10:15:57,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:57,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528222586] [2025-03-04 10:15:57,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:57,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:57,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 10:15:57,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:15:57,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:57,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:15:58,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:58,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528222586] [2025-03-04 10:15:58,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528222586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:58,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621201761] [2025-03-04 10:15:58,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:58,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:58,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:58,273 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-04 10:15:58,275 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-04 10:15:58,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 10:15:58,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:15:58,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:58,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:58,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 10:15:58,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:58,535 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 12 treesize of output 3 [2025-03-04 10:15:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:15:58,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:58,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:15:58,851 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 26 treesize of output 18 [2025-03-04 10:15:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:15:59,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621201761] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:59,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:59,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2025-03-04 10:15:59,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090536456] [2025-03-04 10:15:59,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:59,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 10:15:59,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:59,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 10:15:59,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1505, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 10:15:59,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-04 10:15:59,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 147 transitions, 1307 flow. Second operand has 42 states, 42 states have (on average 7.880952380952381) internal successors, (331), 42 states have internal predecessors, (331), 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-04 10:15:59,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:59,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-04 10:15:59,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:05,621 INFO L124 PetriNetUnfolderBase]: 3358/5838 cut-off events. [2025-03-04 10:16:05,621 INFO L125 PetriNetUnfolderBase]: For 27052/27052 co-relation queries the response was YES. [2025-03-04 10:16:05,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26777 conditions, 5838 events. 3358/5838 cut-off events. For 27052/27052 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 36874 event pairs, 109 based on Foata normal form. 14/5852 useless extension candidates. Maximal degree in co-relation 26682. Up to 1213 conditions per place. [2025-03-04 10:16:05,662 INFO L140 encePairwiseOnDemand]: 23/39 looper letters, 365 selfloop transitions, 477 changer transitions 118/961 dead transitions. [2025-03-04 10:16:05,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 961 transitions, 9403 flow [2025-03-04 10:16:05,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2025-03-04 10:16:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2025-03-04 10:16:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 1420 transitions. [2025-03-04 10:16:05,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32221465849784436 [2025-03-04 10:16:05,668 INFO L175 Difference]: Start difference. First operand has 128 places, 147 transitions, 1307 flow. Second operand 113 states and 1420 transitions. [2025-03-04 10:16:05,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 961 transitions, 9403 flow [2025-03-04 10:16:05,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 961 transitions, 8905 flow, removed 242 selfloop flow, removed 8 redundant places. [2025-03-04 10:16:05,773 INFO L231 Difference]: Finished difference. Result has 269 places, 580 transitions, 7095 flow [2025-03-04 10:16:05,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=113, PETRI_FLOW=7095, PETRI_PLACES=269, PETRI_TRANSITIONS=580} [2025-03-04 10:16:05,773 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 230 predicate places. [2025-03-04 10:16:05,774 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 580 transitions, 7095 flow [2025-03-04 10:16:05,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.880952380952381) internal successors, (331), 42 states have internal predecessors, (331), 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-04 10:16:05,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:05,775 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, 1] [2025-03-04 10:16:05,780 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-04 10:16:05,975 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,SelfDestructingSolverStorable13 [2025-03-04 10:16:05,976 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:16:05,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:05,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1588150320, now seen corresponding path program 3 times [2025-03-04 10:16:05,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:05,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161040124] [2025-03-04 10:16:05,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:16:05,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:05,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-03-04 10:16:06,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 29 statements. [2025-03-04 10:16:06,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:16:06,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:16:06,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:06,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161040124] [2025-03-04 10:16:06,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161040124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:06,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526284593] [2025-03-04 10:16:06,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:16:06,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:06,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:06,238 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-04 10:16:06,239 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-04 10:16:06,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-03-04 10:16:06,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 29 statements. [2025-03-04 10:16:06,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:16:06,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:06,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:16:06,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:16:06,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:06,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:16:06,616 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 37 treesize of output 21 [2025-03-04 10:16:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:16:06,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526284593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:06,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:06,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 10:16:06,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073204562] [2025-03-04 10:16:06,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:06,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:16:06,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:06,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:16:06,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:16:06,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-04 10:16:06,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 580 transitions, 7095 flow. Second operand has 24 states, 24 states have (on average 8.083333333333334) internal successors, (194), 24 states have internal predecessors, (194), 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-04 10:16:06,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:06,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-04 10:16:06,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:08,421 INFO L124 PetriNetUnfolderBase]: 3438/6008 cut-off events. [2025-03-04 10:16:08,422 INFO L125 PetriNetUnfolderBase]: For 90336/90336 co-relation queries the response was YES. [2025-03-04 10:16:08,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37442 conditions, 6008 events. 3438/6008 cut-off events. For 90336/90336 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 38324 event pairs, 128 based on Foata normal form. 1/6009 useless extension candidates. Maximal degree in co-relation 37235. Up to 1743 conditions per place. [2025-03-04 10:16:08,471 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 532 selfloop transitions, 388 changer transitions 32/953 dead transitions. [2025-03-04 10:16:08,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 953 transitions, 13295 flow [2025-03-04 10:16:08,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 10:16:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 10:16:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 380 transitions. [2025-03-04 10:16:08,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3247863247863248 [2025-03-04 10:16:08,473 INFO L175 Difference]: Start difference. First operand has 269 places, 580 transitions, 7095 flow. Second operand 30 states and 380 transitions. [2025-03-04 10:16:08,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 953 transitions, 13295 flow [2025-03-04 10:16:09,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 953 transitions, 10619 flow, removed 1271 selfloop flow, removed 29 redundant places. [2025-03-04 10:16:09,012 INFO L231 Difference]: Finished difference. Result has 271 places, 728 transitions, 8299 flow [2025-03-04 10:16:09,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=5458, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=8299, PETRI_PLACES=271, PETRI_TRANSITIONS=728} [2025-03-04 10:16:09,013 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 232 predicate places. [2025-03-04 10:16:09,013 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 728 transitions, 8299 flow [2025-03-04 10:16:09,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.083333333333334) internal successors, (194), 24 states have internal predecessors, (194), 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-04 10:16:09,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:09,013 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, 1] [2025-03-04 10:16:09,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:16:09,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:16:09,213 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:16:09,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:09,214 INFO L85 PathProgramCache]: Analyzing trace with hash 353668322, now seen corresponding path program 4 times [2025-03-04 10:16:09,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:09,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259754794] [2025-03-04 10:16:09,214 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:16:09,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:09,218 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-04 10:16:09,226 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:16:09,226 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:16:09,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:16:09,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:09,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259754794] [2025-03-04 10:16:09,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259754794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:09,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016390510] [2025-03-04 10:16:09,403 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:16:09,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:09,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:09,405 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-04 10:16:09,407 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-04 10:16:09,448 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-04 10:16:09,468 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:16:09,468 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:16:09,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:09,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 10:16:09,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:09,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:16:09,684 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 15 [2025-03-04 10:16:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:16:09,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:10,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:16:10,091 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 26 treesize of output 18 [2025-03-04 10:16:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:16:10,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016390510] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:10,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:10,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 36 [2025-03-04 10:16:10,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431106983] [2025-03-04 10:16:10,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:10,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 10:16:10,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:10,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 10:16:10,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1136, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 10:16:10,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-04 10:16:10,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 728 transitions, 8299 flow. Second operand has 37 states, 37 states have (on average 8.054054054054054) internal successors, (298), 37 states have internal predecessors, (298), 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-04 10:16:10,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:10,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-04 10:16:10,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:16,054 INFO L124 PetriNetUnfolderBase]: 5256/9163 cut-off events. [2025-03-04 10:16:16,055 INFO L125 PetriNetUnfolderBase]: For 141043/141043 co-relation queries the response was YES. [2025-03-04 10:16:16,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55668 conditions, 9163 events. 5256/9163 cut-off events. For 141043/141043 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 63167 event pairs, 318 based on Foata normal form. 16/9179 useless extension candidates. Maximal degree in co-relation 55513. Up to 3517 conditions per place. [2025-03-04 10:16:16,119 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 708 selfloop transitions, 729 changer transitions 144/1582 dead transitions. [2025-03-04 10:16:16,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 1582 transitions, 21035 flow [2025-03-04 10:16:16,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-03-04 10:16:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2025-03-04 10:16:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 1206 transitions. [2025-03-04 10:16:16,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30022404779686335 [2025-03-04 10:16:16,122 INFO L175 Difference]: Start difference. First operand has 271 places, 728 transitions, 8299 flow. Second operand 103 states and 1206 transitions. [2025-03-04 10:16:16,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 1582 transitions, 21035 flow [2025-03-04 10:16:17,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 1582 transitions, 19667 flow, removed 537 selfloop flow, removed 7 redundant places. [2025-03-04 10:16:17,382 INFO L231 Difference]: Finished difference. Result has 413 places, 1139 transitions, 15854 flow [2025-03-04 10:16:17,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=7946, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=383, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=103, PETRI_FLOW=15854, PETRI_PLACES=413, PETRI_TRANSITIONS=1139} [2025-03-04 10:16:17,383 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 374 predicate places. [2025-03-04 10:16:17,383 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 1139 transitions, 15854 flow [2025-03-04 10:16:17,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 8.054054054054054) internal successors, (298), 37 states have internal predecessors, (298), 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-04 10:16:17,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:17,384 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:17,390 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-04 10:16:17,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:17,588 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:16:17,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:17,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1221187880, now seen corresponding path program 5 times [2025-03-04 10:16:17,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:17,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985223793] [2025-03-04 10:16:17,588 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:16:17,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:17,594 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-03-04 10:16:17,611 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:16:17,611 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:16:17,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:16:18,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:18,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985223793] [2025-03-04 10:16:18,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985223793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:18,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109034992] [2025-03-04 10:16:18,225 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:16:18,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:18,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:18,227 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-04 10:16:18,228 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-04 10:16:18,260 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-03-04 10:16:18,277 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:16:18,278 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:16:18,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:18,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:16:18,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 10:16:18,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:18,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:16:18,586 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 26 treesize of output 18 [2025-03-04 10:16:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:16:18,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109034992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:18,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:18,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 10] total 33 [2025-03-04 10:16:18,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282247706] [2025-03-04 10:16:18,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:18,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 10:16:18,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:18,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 10:16:18,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:16:18,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-04 10:16:18,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 1139 transitions, 15854 flow. Second operand has 34 states, 34 states have (on average 8.117647058823529) internal successors, (276), 34 states have internal predecessors, (276), 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-04 10:16:18,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:18,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-04 10:16:18,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:21,076 INFO L124 PetriNetUnfolderBase]: 4752/8261 cut-off events. [2025-03-04 10:16:21,076 INFO L125 PetriNetUnfolderBase]: For 151245/151245 co-relation queries the response was YES. [2025-03-04 10:16:21,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56906 conditions, 8261 events. 4752/8261 cut-off events. For 151245/151245 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 55619 event pairs, 479 based on Foata normal form. 2/8263 useless extension candidates. Maximal degree in co-relation 56766. Up to 4325 conditions per place. [2025-03-04 10:16:21,177 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 726 selfloop transitions, 507 changer transitions 11/1245 dead transitions. [2025-03-04 10:16:21,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 1245 transitions, 19430 flow [2025-03-04 10:16:21,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:16:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 10:16:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 245 transitions. [2025-03-04 10:16:21,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3141025641025641 [2025-03-04 10:16:21,179 INFO L175 Difference]: Start difference. First operand has 413 places, 1139 transitions, 15854 flow. Second operand 20 states and 245 transitions. [2025-03-04 10:16:21,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 1245 transitions, 19430 flow [2025-03-04 10:16:22,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 1245 transitions, 18718 flow, removed 298 selfloop flow, removed 29 redundant places. [2025-03-04 10:16:22,807 INFO L231 Difference]: Finished difference. Result has 393 places, 1155 transitions, 16948 flow [2025-03-04 10:16:22,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=15171, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=489, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=16948, PETRI_PLACES=393, PETRI_TRANSITIONS=1155} [2025-03-04 10:16:22,808 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 354 predicate places. [2025-03-04 10:16:22,808 INFO L471 AbstractCegarLoop]: Abstraction has has 393 places, 1155 transitions, 16948 flow [2025-03-04 10:16:22,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.117647058823529) internal successors, (276), 34 states have internal predecessors, (276), 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-04 10:16:22,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:22,809 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:22,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:16:23,009 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,SelfDestructingSolverStorable16 [2025-03-04 10:16:23,009 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:16:23,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:23,010 INFO L85 PathProgramCache]: Analyzing trace with hash -869056016, now seen corresponding path program 6 times [2025-03-04 10:16:23,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:23,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953651194] [2025-03-04 10:16:23,010 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:16:23,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:23,016 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-03-04 10:16:23,028 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 10:16:23,028 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:16:23,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:16:23,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:23,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953651194] [2025-03-04 10:16:23,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953651194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:23,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043023497] [2025-03-04 10:16:23,199 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:16:23,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:23,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:23,201 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-04 10:16:23,203 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-04 10:16:23,240 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-03-04 10:16:23,258 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 31 statements. [2025-03-04 10:16:23,258 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:16:23,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:23,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:16:23,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:16:23,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:23,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:16:23,499 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 26 treesize of output 18 [2025-03-04 10:16:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:16:23,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043023497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:23,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:23,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2025-03-04 10:16:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280735302] [2025-03-04 10:16:23,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:23,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 10:16:23,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:23,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 10:16:23,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:16:23,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-04 10:16:23,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 1155 transitions, 16948 flow. Second operand has 21 states, 21 states have (on average 8.238095238095237) internal successors, (173), 21 states have internal predecessors, (173), 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-04 10:16:23,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:23,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-04 10:16:23,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:25,801 INFO L124 PetriNetUnfolderBase]: 4723/8202 cut-off events. [2025-03-04 10:16:25,802 INFO L125 PetriNetUnfolderBase]: For 157146/157146 co-relation queries the response was YES. [2025-03-04 10:16:25,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58155 conditions, 8202 events. 4723/8202 cut-off events. For 157146/157146 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 55109 event pairs, 468 based on Foata normal form. 1/8203 useless extension candidates. Maximal degree in co-relation 57961. Up to 4174 conditions per place. [2025-03-04 10:16:25,879 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 649 selfloop transitions, 582 changer transitions 25/1257 dead transitions. [2025-03-04 10:16:25,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 1257 transitions, 20313 flow [2025-03-04 10:16:25,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:16:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 10:16:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 268 transitions. [2025-03-04 10:16:25,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32722832722832723 [2025-03-04 10:16:25,883 INFO L175 Difference]: Start difference. First operand has 393 places, 1155 transitions, 16948 flow. Second operand 21 states and 268 transitions. [2025-03-04 10:16:25,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 1257 transitions, 20313 flow [2025-03-04 10:16:27,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 1257 transitions, 20202 flow, removed 23 selfloop flow, removed 14 redundant places. [2025-03-04 10:16:27,391 INFO L231 Difference]: Finished difference. Result has 401 places, 1154 transitions, 18088 flow [2025-03-04 10:16:27,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=16840, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=578, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=18088, PETRI_PLACES=401, PETRI_TRANSITIONS=1154} [2025-03-04 10:16:27,392 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 362 predicate places. [2025-03-04 10:16:27,392 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 1154 transitions, 18088 flow [2025-03-04 10:16:27,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.238095238095237) internal successors, (173), 21 states have internal predecessors, (173), 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-04 10:16:27,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:27,392 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:27,398 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-04 10:16:27,593 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,SelfDestructingSolverStorable17 [2025-03-04 10:16:27,593 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:16:27,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:27,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1520857782, now seen corresponding path program 7 times [2025-03-04 10:16:27,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:27,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976946126] [2025-03-04 10:16:27,594 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:16:27,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:27,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:16:27,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:16:27,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:27,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:16:28,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:28,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976946126] [2025-03-04 10:16:28,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976946126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:28,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173402705] [2025-03-04 10:16:28,140 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:16:28,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:28,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:28,143 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:16:28,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:16:28,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:16:28,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:16:28,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:28,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:28,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 10:16:28,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:16:28,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:28,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:16:28,859 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 26 treesize of output 18 [2025-03-04 10:16:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:16:28,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173402705] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:28,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:16:28,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17, 12] total 35 [2025-03-04 10:16:28,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307486663] [2025-03-04 10:16:28,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:28,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:16:28,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:28,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:16:28,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1125, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:16:28,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-04 10:16:28,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 1154 transitions, 18088 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-04 10:16:28,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:28,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-04 10:16:28,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:31,010 INFO L124 PetriNetUnfolderBase]: 4712/8172 cut-off events. [2025-03-04 10:16:31,011 INFO L125 PetriNetUnfolderBase]: For 164323/164323 co-relation queries the response was YES. [2025-03-04 10:16:31,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60379 conditions, 8172 events. 4712/8172 cut-off events. For 164323/164323 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 54494 event pairs, 451 based on Foata normal form. 1/8173 useless extension candidates. Maximal degree in co-relation 60185. Up to 5237 conditions per place. [2025-03-04 10:16:31,084 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 703 selfloop transitions, 549 changer transitions 21/1274 dead transitions. [2025-03-04 10:16:31,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 1274 transitions, 21923 flow [2025-03-04 10:16:31,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:16:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:16:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 181 transitions. [2025-03-04 10:16:31,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3315018315018315 [2025-03-04 10:16:31,085 INFO L175 Difference]: Start difference. First operand has 401 places, 1154 transitions, 18088 flow. Second operand 14 states and 181 transitions. [2025-03-04 10:16:31,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 1274 transitions, 21923 flow [2025-03-04 10:16:32,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 1274 transitions, 21053 flow, removed 13 selfloop flow, removed 13 redundant places. [2025-03-04 10:16:32,522 INFO L231 Difference]: Finished difference. Result has 400 places, 1177 transitions, 18993 flow [2025-03-04 10:16:32,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=17259, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=522, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=18993, PETRI_PLACES=400, PETRI_TRANSITIONS=1177} [2025-03-04 10:16:32,523 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 361 predicate places. [2025-03-04 10:16:32,523 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 1177 transitions, 18993 flow [2025-03-04 10:16:32,524 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-04 10:16:32,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:32,524 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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-04 10:16:32,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:16:32,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:32,724 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:16:32,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:32,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1463112507, now seen corresponding path program 8 times [2025-03-04 10:16:32,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:32,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098921946] [2025-03-04 10:16:32,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:32,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:32,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 10:16:32,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:16:32,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:32,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:16:32,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:32,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098921946] [2025-03-04 10:16:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098921946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:32,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112458413] [2025-03-04 10:16:32,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:32,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:32,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:32,809 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:16:32,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:16:32,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 10:16:32,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:16:32,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:32,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:32,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:16:32,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:16:32,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:16:33,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112458413] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:33,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:33,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-03-04 10:16:33,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832386189] [2025-03-04 10:16:33,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:33,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:16:33,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:33,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:16:33,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:16:33,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2025-03-04 10:16:33,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 1177 transitions, 18993 flow. Second operand has 22 states, 22 states have (on average 13.0) internal successors, (286), 22 states have internal predecessors, (286), 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-04 10:16:33,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:33,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2025-03-04 10:16:33,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:34,009 INFO L124 PetriNetUnfolderBase]: 1323/2837 cut-off events. [2025-03-04 10:16:34,009 INFO L125 PetriNetUnfolderBase]: For 79292/79336 co-relation queries the response was YES. [2025-03-04 10:16:34,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23894 conditions, 2837 events. 1323/2837 cut-off events. For 79292/79336 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19713 event pairs, 342 based on Foata normal form. 326/3148 useless extension candidates. Maximal degree in co-relation 23775. Up to 1032 conditions per place. [2025-03-04 10:16:34,036 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 166 selfloop transitions, 12 changer transitions 245/495 dead transitions. [2025-03-04 10:16:34,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 495 transitions, 8687 flow [2025-03-04 10:16:34,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:16:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:16:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 196 transitions. [2025-03-04 10:16:34,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4188034188034188 [2025-03-04 10:16:34,037 INFO L175 Difference]: Start difference. First operand has 400 places, 1177 transitions, 18993 flow. Second operand 12 states and 196 transitions. [2025-03-04 10:16:34,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 495 transitions, 8687 flow [2025-03-04 10:16:34,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 495 transitions, 8111 flow, removed 159 selfloop flow, removed 57 redundant places. [2025-03-04 10:16:34,482 INFO L231 Difference]: Finished difference. Result has 272 places, 224 transitions, 3474 flow [2025-03-04 10:16:34,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=7017, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3474, PETRI_PLACES=272, PETRI_TRANSITIONS=224} [2025-03-04 10:16:34,483 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 233 predicate places. [2025-03-04 10:16:34,483 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 224 transitions, 3474 flow [2025-03-04 10:16:34,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.0) internal successors, (286), 22 states have internal predecessors, (286), 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-04 10:16:34,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:34,483 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 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-04 10:16:34,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:16:34,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:34,684 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:16:34,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:34,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1353919153, now seen corresponding path program 9 times [2025-03-04 10:16:34,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:34,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581666664] [2025-03-04 10:16:34,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:16:34,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:34,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-03-04 10:16:34,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:16:34,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:16:34,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:16:34,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:34,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581666664] [2025-03-04 10:16:34,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581666664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:34,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074689364] [2025-03-04 10:16:34,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:16:34,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:34,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:34,738 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:16:34,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:16:34,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-03-04 10:16:34,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:16:34,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:16:34,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:34,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:16:34,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:16:34,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:34,955 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:16:34,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074689364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:34,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:34,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2025-03-04 10:16:34,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33980089] [2025-03-04 10:16:34,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:34,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:16:34,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:34,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:16:34,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:16:34,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2025-03-04 10:16:34,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 224 transitions, 3474 flow. Second operand has 17 states, 17 states have (on average 13.058823529411764) internal successors, (222), 17 states have internal predecessors, (222), 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-04 10:16:34,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:34,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2025-03-04 10:16:34,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:35,441 INFO L124 PetriNetUnfolderBase]: 1355/2664 cut-off events. [2025-03-04 10:16:35,441 INFO L125 PetriNetUnfolderBase]: For 30017/30040 co-relation queries the response was YES. [2025-03-04 10:16:35,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19713 conditions, 2664 events. 1355/2664 cut-off events. For 30017/30040 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 16138 event pairs, 140 based on Foata normal form. 37/2688 useless extension candidates. Maximal degree in co-relation 19642. Up to 954 conditions per place. [2025-03-04 10:16:35,462 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 169 selfloop transitions, 77 changer transitions 46/353 dead transitions. [2025-03-04 10:16:35,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 353 transitions, 5487 flow [2025-03-04 10:16:35,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:16:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:16:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 238 transitions. [2025-03-04 10:16:35,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2025-03-04 10:16:35,467 INFO L175 Difference]: Start difference. First operand has 272 places, 224 transitions, 3474 flow. Second operand 14 states and 238 transitions. [2025-03-04 10:16:35,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 353 transitions, 5487 flow [2025-03-04 10:16:35,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 353 transitions, 4729 flow, removed 131 selfloop flow, removed 41 redundant places. [2025-03-04 10:16:35,604 INFO L231 Difference]: Finished difference. Result has 171 places, 233 transitions, 3370 flow [2025-03-04 10:16:35,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2921, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3370, PETRI_PLACES=171, PETRI_TRANSITIONS=233} [2025-03-04 10:16:35,604 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 132 predicate places. [2025-03-04 10:16:35,604 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 233 transitions, 3370 flow [2025-03-04 10:16:35,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.058823529411764) internal successors, (222), 17 states have internal predecessors, (222), 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-04 10:16:35,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:35,604 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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-04 10:16:35,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:16:35,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 10:16:35,805 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:16:35,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:35,805 INFO L85 PathProgramCache]: Analyzing trace with hash 934977361, now seen corresponding path program 10 times [2025-03-04 10:16:35,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:35,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065604888] [2025-03-04 10:16:35,805 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:16:35,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:35,810 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-04 10:16:35,822 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:16:35,822 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:16:35,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:16:35,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:35,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065604888] [2025-03-04 10:16:35,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065604888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:35,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604986321] [2025-03-04 10:16:35,907 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:16:35,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:35,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:35,909 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:16:35,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:16:35,951 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-04 10:16:35,984 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:16:35,985 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:16:35,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:35,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:16:35,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:36,273 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:16:36,273 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-04 10:16:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:16:36,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:36,392 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-04 10:16:36,393 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 26 treesize of output 14 [2025-03-04 10:16:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:16:36,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604986321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:36,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:36,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 25 [2025-03-04 10:16:36,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930935645] [2025-03-04 10:16:36,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:36,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:16:36,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:36,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:16:36,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:16:36,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-04 10:16:36,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 233 transitions, 3370 flow. Second operand has 26 states, 26 states have (on average 10.923076923076923) internal successors, (284), 26 states have internal predecessors, (284), 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-04 10:16:36,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:36,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-04 10:16:36,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:39,046 INFO L124 PetriNetUnfolderBase]: 6642/11923 cut-off events. [2025-03-04 10:16:39,046 INFO L125 PetriNetUnfolderBase]: For 108372/108469 co-relation queries the response was YES. [2025-03-04 10:16:39,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83469 conditions, 11923 events. 6642/11923 cut-off events. For 108372/108469 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 81443 event pairs, 497 based on Foata normal form. 899/12815 useless extension candidates. Maximal degree in co-relation 83421. Up to 4559 conditions per place. [2025-03-04 10:16:39,176 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 866 selfloop transitions, 456 changer transitions 13/1377 dead transitions. [2025-03-04 10:16:39,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 1377 transitions, 22118 flow [2025-03-04 10:16:39,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-04 10:16:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-03-04 10:16:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 835 transitions. [2025-03-04 10:16:39,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41173570019723865 [2025-03-04 10:16:39,180 INFO L175 Difference]: Start difference. First operand has 171 places, 233 transitions, 3370 flow. Second operand 52 states and 835 transitions. [2025-03-04 10:16:39,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 1377 transitions, 22118 flow [2025-03-04 10:16:39,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 1377 transitions, 19097 flow, removed 509 selfloop flow, removed 16 redundant places. [2025-03-04 10:16:39,751 INFO L231 Difference]: Finished difference. Result has 220 places, 660 transitions, 11588 flow [2025-03-04 10:16:39,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2889, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=11588, PETRI_PLACES=220, PETRI_TRANSITIONS=660} [2025-03-04 10:16:39,752 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 181 predicate places. [2025-03-04 10:16:39,752 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 660 transitions, 11588 flow [2025-03-04 10:16:39,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.923076923076923) internal successors, (284), 26 states have internal predecessors, (284), 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-04 10:16:39,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:39,752 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, 1] [2025-03-04 10:16:39,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:16:39,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 10:16:39,952 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:16:39,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:39,953 INFO L85 PathProgramCache]: Analyzing trace with hash 836981350, now seen corresponding path program 11 times [2025-03-04 10:16:39,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:39,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726187505] [2025-03-04 10:16:39,953 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:16:39,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:39,959 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-03-04 10:16:39,965 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:16:39,965 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:16:39,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:16:40,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:40,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726187505] [2025-03-04 10:16:40,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726187505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:40,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105712010] [2025-03-04 10:16:40,345 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:16:40,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:40,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:40,347 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:16:40,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:16:40,390 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-03-04 10:16:40,413 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:16:40,413 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:16:40,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:40,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 10:16:40,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:16:41,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:41,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:16:41,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 53 [2025-03-04 10:16:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:16:41,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105712010] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:41,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:41,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 19] total 50 [2025-03-04 10:16:41,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280973675] [2025-03-04 10:16:41,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:41,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 10:16:41,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:41,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 10:16:41,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=2271, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 10:16:41,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-04 10:16:41,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 660 transitions, 11588 flow. Second operand has 51 states, 51 states have (on average 7.96078431372549) internal successors, (406), 51 states have internal predecessors, (406), 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-04 10:16:41,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:41,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-04 10:16:41,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:59,460 INFO L124 PetriNetUnfolderBase]: 22990/39168 cut-off events. [2025-03-04 10:16:59,460 INFO L125 PetriNetUnfolderBase]: For 1263250/1263250 co-relation queries the response was YES. [2025-03-04 10:16:59,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326874 conditions, 39168 events. 22990/39168 cut-off events. For 1263250/1263250 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 298770 event pairs, 943 based on Foata normal form. 358/39526 useless extension candidates. Maximal degree in co-relation 326793. Up to 14035 conditions per place. [2025-03-04 10:16:59,971 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 1036 selfloop transitions, 1872 changer transitions 621/3530 dead transitions. [2025-03-04 10:16:59,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 3530 transitions, 67669 flow [2025-03-04 10:16:59,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2025-03-04 10:16:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2025-03-04 10:16:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 2377 transitions. [2025-03-04 10:16:59,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3002399898951623 [2025-03-04 10:16:59,975 INFO L175 Difference]: Start difference. First operand has 220 places, 660 transitions, 11588 flow. Second operand 203 states and 2377 transitions. [2025-03-04 10:16:59,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 3530 transitions, 67669 flow [2025-03-04 10:17:06,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 3530 transitions, 64700 flow, removed 1341 selfloop flow, removed 8 redundant places. [2025-03-04 10:17:06,452 INFO L231 Difference]: Finished difference. Result has 507 places, 2362 transitions, 49088 flow [2025-03-04 10:17:06,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=10810, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=464, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=203, PETRI_FLOW=49088, PETRI_PLACES=507, PETRI_TRANSITIONS=2362} [2025-03-04 10:17:06,453 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 468 predicate places. [2025-03-04 10:17:06,453 INFO L471 AbstractCegarLoop]: Abstraction has has 507 places, 2362 transitions, 49088 flow [2025-03-04 10:17:06,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 7.96078431372549) internal successors, (406), 51 states have internal predecessors, (406), 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-04 10:17:06,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:06,453 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, 1] [2025-03-04 10:17:06,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:17:06,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:06,654 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-04 10:17:06,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:06,654 INFO L85 PathProgramCache]: Analyzing trace with hash 706030052, now seen corresponding path program 12 times [2025-03-04 10:17:06,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:06,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556047057] [2025-03-04 10:17:06,654 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:17:06,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:06,659 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-03-04 10:17:06,669 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:17:06,669 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-04 10:17:06,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:17:07,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:07,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556047057] [2025-03-04 10:17:07,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556047057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:07,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964264938] [2025-03-04 10:17:07,572 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:17:07,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:07,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:07,577 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:17:07,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:17:07,620 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-03-04 10:17:07,667 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:17:07,667 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-04 10:17:07,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:07,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 10:17:07,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:08,365 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2025-03-04 10:17:08,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 18 [2025-03-04 10:17:08,554 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:17:08,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:17:09,185 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2025-03-04 10:17:09,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 45 [2025-03-04 10:17:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:17:09,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964264938] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:17:09,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:17:09,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 58 [2025-03-04 10:17:09,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105125405] [2025-03-04 10:17:09,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:17:09,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-04 10:17:09,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:09,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-04 10:17:09,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=2993, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 10:17:09,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-04 10:17:09,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 2362 transitions, 49088 flow. Second operand has 59 states, 59 states have (on average 7.762711864406779) internal successors, (458), 59 states have internal predecessors, (458), 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-04 10:17:09,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:09,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-04 10:17:09,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand