./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/test-context1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/test-context1.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 d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:30:01,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:30:01,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:30:01,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:30:01,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:30:01,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:30:01,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:30:01,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:30:01,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:30:01,648 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:30:01,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:30:01,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:30:01,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:30:01,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:30:01,649 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:30:01,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:30:01,650 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:30:01,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:30:01,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:30:01,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:30:01,650 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:30:01,650 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:30:01,650 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:30:01,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:30:01,650 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:30:01,650 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:30:01,650 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:30:01,650 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:30:01,650 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:30:01,651 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:30:01,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:30:01,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:30:01,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:30:01,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:30:01,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:30:01,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:30:01,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:30:01,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:30:01,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:30:01,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:30:01,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:30:01,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:30:01,652 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 -> d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e [2025-03-09 01:30:01,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:30:01,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:30:01,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:30:01,923 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:30:01,923 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:30:01,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-context1.wvr.c [2025-03-09 01:30:03,056 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acc281142/6e6838ae7db641efb9db01e087c51d4e/FLAGa12bd09a6 [2025-03-09 01:30:03,298 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:30:03,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-context1.wvr.c [2025-03-09 01:30:03,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acc281142/6e6838ae7db641efb9db01e087c51d4e/FLAGa12bd09a6 [2025-03-09 01:30:03,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acc281142/6e6838ae7db641efb9db01e087c51d4e [2025-03-09 01:30:03,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:30:03,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:30:03,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:30:03,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:30:03,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:30:03,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:30:03" (1/1) ... [2025-03-09 01:30:03,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e6e8ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:03, skipping insertion in model container [2025-03-09 01:30:03,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:30:03" (1/1) ... [2025-03-09 01:30:03,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:30:03,761 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:30:03,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:30:03,773 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:30:03,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:30:03,799 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:30:03,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:03 WrapperNode [2025-03-09 01:30:03,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:30:03,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:30:03,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:30:03,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:30:03,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:03" (1/1) ... [2025-03-09 01:30:03,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:03" (1/1) ... [2025-03-09 01:30:03,822 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 124 [2025-03-09 01:30:03,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:30:03,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:30:03,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:30:03,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:30:03,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:03" (1/1) ... [2025-03-09 01:30:03,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:03" (1/1) ... [2025-03-09 01:30:03,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:03" (1/1) ... [2025-03-09 01:30:03,848 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-09 01:30:03,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:03" (1/1) ... [2025-03-09 01:30:03,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:03" (1/1) ... [2025-03-09 01:30:03,856 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:03" (1/1) ... [2025-03-09 01:30:03,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:03" (1/1) ... [2025-03-09 01:30:03,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:03" (1/1) ... [2025-03-09 01:30:03,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:03" (1/1) ... [2025-03-09 01:30:03,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:30:03,864 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:30:03,864 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:30:03,864 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:30:03,865 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:03" (1/1) ... [2025-03-09 01:30:03,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:30:03,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:03,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:30:03,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:30:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:30:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:30:03,914 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:30:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:30:03,914 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:30:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:30:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:30:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:30:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:30:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:30:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:30:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:30:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:30:03,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:30:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:30:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:30:03,916 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:30:03,981 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:30:03,983 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:30:04,168 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:30:04,168 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:30:04,308 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:30:04,312 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:30:04,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:30:04 BoogieIcfgContainer [2025-03-09 01:30:04,313 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:30:04,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:30:04,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:30:04,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:30:04,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:30:03" (1/3) ... [2025-03-09 01:30:04,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356af7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:30:04, skipping insertion in model container [2025-03-09 01:30:04,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:03" (2/3) ... [2025-03-09 01:30:04,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356af7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:30:04, skipping insertion in model container [2025-03-09 01:30:04,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:30:04" (3/3) ... [2025-03-09 01:30:04,322 INFO L128 eAbstractionObserver]: Analyzing ICFG test-context1.wvr.c [2025-03-09 01:30:04,332 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:30:04,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-context1.wvr.c that has 3 procedures, 33 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-09 01:30:04,333 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:30:04,377 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:30:04,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 88 flow [2025-03-09 01:30:04,440 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2025-03-09 01:30:04,443 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:30:04,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 35 events. 5/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-09 01:30:04,450 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 37 transitions, 88 flow [2025-03-09 01:30:04,452 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 34 transitions, 80 flow [2025-03-09 01:30:04,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:30:04,472 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;@fb044a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:30:04,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-09 01:30:04,476 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:30:04,476 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:30:04,476 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:30:04,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:04,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:30:04,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:04,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:04,482 INFO L85 PathProgramCache]: Analyzing trace with hash 357522, now seen corresponding path program 1 times [2025-03-09 01:30:04,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:04,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361661114] [2025-03-09 01:30:04,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:04,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:04,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:30:04,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:30:04,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:04,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:04,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:04,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361661114] [2025-03-09 01:30:04,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361661114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:04,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:04,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:30:04,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501548523] [2025-03-09 01:30:04,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:04,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:30:04,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:04,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:30:04,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:30:04,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-09 01:30:04,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:04,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:04,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-09 01:30:04,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:04,846 INFO L124 PetriNetUnfolderBase]: 212/371 cut-off events. [2025-03-09 01:30:04,846 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-09 01:30:04,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 371 events. 212/371 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1442 event pairs, 176 based on Foata normal form. 1/263 useless extension candidates. Maximal degree in co-relation 705. Up to 364 conditions per place. [2025-03-09 01:30:04,852 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 23 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2025-03-09 01:30:04,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 120 flow [2025-03-09 01:30:04,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-03-09 01:30:04,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2025-03-09 01:30:04,865 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 80 flow. Second operand 3 states and 50 transitions. [2025-03-09 01:30:04,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 120 flow [2025-03-09 01:30:04,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:04,871 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2025-03-09 01:30:04,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-03-09 01:30:04,875 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-03-09 01:30:04,876 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2025-03-09 01:30:04,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:04,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:04,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:30:04,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:30:04,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:04,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:04,877 INFO L85 PathProgramCache]: Analyzing trace with hash 357523, now seen corresponding path program 1 times [2025-03-09 01:30:04,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:04,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978209414] [2025-03-09 01:30:04,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:04,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:04,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:30:04,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:30:04,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:04,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:05,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:05,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:05,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978209414] [2025-03-09 01:30:05,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978209414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:05,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:05,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:05,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671542642] [2025-03-09 01:30:05,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:05,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:05,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:05,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:05,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:30:05,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-09 01:30:05,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:05,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:05,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-09 01:30:05,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:05,259 INFO L124 PetriNetUnfolderBase]: 213/374 cut-off events. [2025-03-09 01:30:05,259 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:30:05,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 374 events. 213/374 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1466 event pairs, 176 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 737. Up to 369 conditions per place. [2025-03-09 01:30:05,261 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 25 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-03-09 01:30:05,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 132 flow [2025-03-09 01:30:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:05,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-03-09 01:30:05,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3918918918918919 [2025-03-09 01:30:05,263 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 58 transitions. [2025-03-09 01:30:05,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 132 flow [2025-03-09 01:30:05,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:05,265 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 89 flow [2025-03-09 01:30:05,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2025-03-09 01:30:05,265 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2025-03-09 01:30:05,265 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 89 flow [2025-03-09 01:30:05,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:05,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:05,266 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:30:05,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:30:05,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:05,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash 343591166, now seen corresponding path program 1 times [2025-03-09 01:30:05,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:05,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319244299] [2025-03-09 01:30:05,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:05,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:05,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:30:05,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:30:05,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:05,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:05,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:05,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:05,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319244299] [2025-03-09 01:30:05,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319244299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:05,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404428419] [2025-03-09 01:30:05,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:05,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:05,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:05,530 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:05,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:30:05,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:30:05,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:30:05,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:05,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:05,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:30:05,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:05,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-09 01:30:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:05,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:05,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404428419] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:05,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:05,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:05,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913877372] [2025-03-09 01:30:05,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:05,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:05,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:05,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:05,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:05,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-09 01:30:05,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 89 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:05,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:05,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-09 01:30:05,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:06,187 INFO L124 PetriNetUnfolderBase]: 214/376 cut-off events. [2025-03-09 01:30:06,188 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:30:06,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 376 events. 214/376 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1471 event pairs, 176 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 744. Up to 366 conditions per place. [2025-03-09 01:30:06,192 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 21 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2025-03-09 01:30:06,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 159 flow [2025-03-09 01:30:06,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:30:06,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:30:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2025-03-09 01:30:06,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30067567567567566 [2025-03-09 01:30:06,196 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 89 flow. Second operand 8 states and 89 transitions. [2025-03-09 01:30:06,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 159 flow [2025-03-09 01:30:06,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:06,198 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 114 flow [2025-03-09 01:30:06,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-03-09 01:30:06,199 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2025-03-09 01:30:06,199 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 114 flow [2025-03-09 01:30:06,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:06,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:06,200 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:06,210 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-09 01:30:06,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:06,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:06,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:06,401 INFO L85 PathProgramCache]: Analyzing trace with hash -442468755, now seen corresponding path program 1 times [2025-03-09 01:30:06,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:06,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491186633] [2025-03-09 01:30:06,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:06,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:06,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:30:06,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:30:06,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:06,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:06,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:06,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491186633] [2025-03-09 01:30:06,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491186633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:06,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:06,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:06,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92053669] [2025-03-09 01:30:06,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:06,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:06,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:06,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:06,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:30:06,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-09 01:30:06,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:06,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:06,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-09 01:30:06,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:06,554 INFO L124 PetriNetUnfolderBase]: 166/295 cut-off events. [2025-03-09 01:30:06,554 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-09 01:30:06,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 295 events. 166/295 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1078 event pairs, 132 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 582. Up to 284 conditions per place. [2025-03-09 01:30:06,558 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 25 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-03-09 01:30:06,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 168 flow [2025-03-09 01:30:06,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-03-09 01:30:06,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3581081081081081 [2025-03-09 01:30:06,560 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 114 flow. Second operand 4 states and 53 transitions. [2025-03-09 01:30:06,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 168 flow [2025-03-09 01:30:06,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 126 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-09 01:30:06,561 INFO L231 Difference]: Finished difference. Result has 33 places, 32 transitions, 76 flow [2025-03-09 01:30:06,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=32} [2025-03-09 01:30:06,561 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2025-03-09 01:30:06,562 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 32 transitions, 76 flow [2025-03-09 01:30:06,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:06,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:06,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:06,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:30:06,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:06,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:06,562 INFO L85 PathProgramCache]: Analyzing trace with hash -442468754, now seen corresponding path program 1 times [2025-03-09 01:30:06,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:06,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53871007] [2025-03-09 01:30:06,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:06,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:06,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:30:06,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:30:06,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:06,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:06,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:06,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53871007] [2025-03-09 01:30:06,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53871007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:06,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:06,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:06,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639190186] [2025-03-09 01:30:06,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:06,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:06,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:06,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:06,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:30:06,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:06,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 32 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:06,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:06,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:06,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:06,728 INFO L124 PetriNetUnfolderBase]: 233/434 cut-off events. [2025-03-09 01:30:06,728 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-09 01:30:06,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 434 events. 233/434 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1803 event pairs, 200 based on Foata normal form. 23/369 useless extension candidates. Maximal degree in co-relation 574. Up to 289 conditions per place. [2025-03-09 01:30:06,730 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 39 selfloop transitions, 3 changer transitions 2/47 dead transitions. [2025-03-09 01:30:06,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 198 flow [2025-03-09 01:30:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-03-09 01:30:06,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5202702702702703 [2025-03-09 01:30:06,733 INFO L175 Difference]: Start difference. First operand has 33 places, 32 transitions, 76 flow. Second operand 4 states and 77 transitions. [2025-03-09 01:30:06,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 198 flow [2025-03-09 01:30:06,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:06,734 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 86 flow [2025-03-09 01:30:06,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2025-03-09 01:30:06,734 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2025-03-09 01:30:06,735 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 86 flow [2025-03-09 01:30:06,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:06,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:06,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:06,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:30:06,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:06,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:06,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1563401561, now seen corresponding path program 1 times [2025-03-09 01:30:06,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:06,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404593447] [2025-03-09 01:30:06,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:06,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:06,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:30:06,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:30:06,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:06,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:06,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:06,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:06,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404593447] [2025-03-09 01:30:06,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404593447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:06,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956431523] [2025-03-09 01:30:06,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:06,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:06,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:06,890 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:06,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:30:06,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:30:06,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:30:06,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:06,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:06,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:30:06,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:07,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:07,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 31 [2025-03-09 01:30:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:07,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956431523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:07,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:07,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:07,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438498102] [2025-03-09 01:30:07,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:07,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:07,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:07,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:07,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:07,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:07,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 86 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:07,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:07,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:07,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:07,334 INFO L124 PetriNetUnfolderBase]: 290/546 cut-off events. [2025-03-09 01:30:07,334 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-09 01:30:07,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 546 events. 290/546 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2321 event pairs, 248 based on Foata normal form. 11/444 useless extension candidates. Maximal degree in co-relation 883. Up to 392 conditions per place. [2025-03-09 01:30:07,337 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 39 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2025-03-09 01:30:07,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 214 flow [2025-03-09 01:30:07,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-03-09 01:30:07,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2025-03-09 01:30:07,338 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 86 flow. Second operand 5 states and 85 transitions. [2025-03-09 01:30:07,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 214 flow [2025-03-09 01:30:07,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:07,339 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 108 flow [2025-03-09 01:30:07,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-03-09 01:30:07,340 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2025-03-09 01:30:07,340 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 108 flow [2025-03-09 01:30:07,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:07,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:07,340 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:07,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:30:07,540 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,SelfDestructingSolverStorable5 [2025-03-09 01:30:07,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:07,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:07,541 INFO L85 PathProgramCache]: Analyzing trace with hash 670919363, now seen corresponding path program 1 times [2025-03-09 01:30:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:07,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097909786] [2025-03-09 01:30:07,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:07,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:07,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:30:07,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:30:07,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:07,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:07,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:07,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097909786] [2025-03-09 01:30:07,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097909786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:07,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508562494] [2025-03-09 01:30:07,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:07,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:07,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:07,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:07,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:30:07,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:30:07,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:30:07,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:07,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:07,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:30:07,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:07,837 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-09 01:30:07,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:07,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508562494] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:07,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:07,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-09 01:30:07,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099836227] [2025-03-09 01:30:07,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:07,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:30:07,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:07,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:30:07,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:30:07,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:07,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 108 flow. Second operand has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:07,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:07,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:07,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:08,233 INFO L124 PetriNetUnfolderBase]: 547/1012 cut-off events. [2025-03-09 01:30:08,234 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2025-03-09 01:30:08,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2328 conditions, 1012 events. 547/1012 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4979 event pairs, 341 based on Foata normal form. 24/837 useless extension candidates. Maximal degree in co-relation 1051. Up to 401 conditions per place. [2025-03-09 01:30:08,239 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 79 selfloop transitions, 10 changer transitions 2/94 dead transitions. [2025-03-09 01:30:08,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 94 transitions, 446 flow [2025-03-09 01:30:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2025-03-09 01:30:08,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4984984984984985 [2025-03-09 01:30:08,241 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 108 flow. Second operand 9 states and 166 transitions. [2025-03-09 01:30:08,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 94 transitions, 446 flow [2025-03-09 01:30:08,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 94 transitions, 432 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:08,243 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 154 flow [2025-03-09 01:30:08,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=154, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-03-09 01:30:08,244 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2025-03-09 01:30:08,244 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 154 flow [2025-03-09 01:30:08,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.357142857142858) internal successors, (145), 14 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:08,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:08,244 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:08,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:08,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:08,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:08,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2063130296, now seen corresponding path program 2 times [2025-03-09 01:30:08,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:08,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139145721] [2025-03-09 01:30:08,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:08,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:08,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 01:30:08,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 14 statements. [2025-03-09 01:30:08,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:08,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 01:30:08,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139145721] [2025-03-09 01:30:08,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139145721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:08,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:08,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:08,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826005092] [2025-03-09 01:30:08,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:08,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:08,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:08,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:08,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:30:08,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:08,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 154 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-09 01:30:08,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:08,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:08,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:08,667 INFO L124 PetriNetUnfolderBase]: 483/910 cut-off events. [2025-03-09 01:30:08,669 INFO L125 PetriNetUnfolderBase]: For 553/553 co-relation queries the response was YES. [2025-03-09 01:30:08,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2080 conditions, 910 events. 483/910 cut-off events. For 553/553 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4514 event pairs, 446 based on Foata normal form. 33/793 useless extension candidates. Maximal degree in co-relation 1634. Up to 888 conditions per place. [2025-03-09 01:30:08,674 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 26 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2025-03-09 01:30:08,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 186 flow [2025-03-09 01:30:08,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-03-09 01:30:08,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3716216216216216 [2025-03-09 01:30:08,676 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 154 flow. Second operand 4 states and 55 transitions. [2025-03-09 01:30:08,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 186 flow [2025-03-09 01:30:08,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 170 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:08,680 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 118 flow [2025-03-09 01:30:08,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-03-09 01:30:08,681 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2025-03-09 01:30:08,682 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 118 flow [2025-03-09 01:30:08,683 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-09 01:30:08,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:08,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:08,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:30:08,683 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:08,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:08,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1918652826, now seen corresponding path program 1 times [2025-03-09 01:30:08,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:08,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050397645] [2025-03-09 01:30:08,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:08,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:08,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:30:08,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:08,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:08,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:08,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:08,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050397645] [2025-03-09 01:30:08,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050397645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:08,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:08,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:08,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203706716] [2025-03-09 01:30:08,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:08,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:30:08,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:08,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:30:08,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:30:08,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:08,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:08,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:08,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:08,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:08,817 INFO L124 PetriNetUnfolderBase]: 547/1011 cut-off events. [2025-03-09 01:30:08,818 INFO L125 PetriNetUnfolderBase]: For 420/420 co-relation queries the response was YES. [2025-03-09 01:30:08,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2328 conditions, 1011 events. 547/1011 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4891 event pairs, 362 based on Foata normal form. 5/847 useless extension candidates. Maximal degree in co-relation 1856. Up to 714 conditions per place. [2025-03-09 01:30:08,821 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 36 selfloop transitions, 3 changer transitions 4/46 dead transitions. [2025-03-09 01:30:08,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 246 flow [2025-03-09 01:30:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:08,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-09 01:30:08,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5315315315315315 [2025-03-09 01:30:08,822 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 118 flow. Second operand 3 states and 59 transitions. [2025-03-09 01:30:08,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 246 flow [2025-03-09 01:30:08,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:08,824 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 127 flow [2025-03-09 01:30:08,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2025-03-09 01:30:08,825 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2025-03-09 01:30:08,825 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 127 flow [2025-03-09 01:30:08,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:08,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:08,825 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:08,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:30:08,825 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:08,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:08,826 INFO L85 PathProgramCache]: Analyzing trace with hash 888066586, now seen corresponding path program 1 times [2025-03-09 01:30:08,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:08,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084160133] [2025-03-09 01:30:08,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:08,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:08,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:30:08,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:30:08,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:08,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:30:09,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:09,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084160133] [2025-03-09 01:30:09,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084160133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:09,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:09,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:30:09,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169985530] [2025-03-09 01:30:09,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:09,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:30:09,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:09,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:30:09,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:30:09,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:09,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:09,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:09,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:09,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:09,205 INFO L124 PetriNetUnfolderBase]: 629/1135 cut-off events. [2025-03-09 01:30:09,205 INFO L125 PetriNetUnfolderBase]: For 777/777 co-relation queries the response was YES. [2025-03-09 01:30:09,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 1135 events. 629/1135 cut-off events. For 777/777 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5206 event pairs, 136 based on Foata normal form. 2/953 useless extension candidates. Maximal degree in co-relation 1903. Up to 302 conditions per place. [2025-03-09 01:30:09,211 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 48 selfloop transitions, 8 changer transitions 12/71 dead transitions. [2025-03-09 01:30:09,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 71 transitions, 370 flow [2025-03-09 01:30:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:30:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:30:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-03-09 01:30:09,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2025-03-09 01:30:09,212 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 127 flow. Second operand 6 states and 110 transitions. [2025-03-09 01:30:09,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 71 transitions, 370 flow [2025-03-09 01:30:09,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 355 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:09,214 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 149 flow [2025-03-09 01:30:09,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2025-03-09 01:30:09,215 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2025-03-09 01:30:09,215 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 149 flow [2025-03-09 01:30:09,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:09,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:09,215 INFO L206 CegarLoopForPetriNet]: trace histogram [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-09 01:30:09,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:30:09,215 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:09,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:09,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1816168355, now seen corresponding path program 2 times [2025-03-09 01:30:09,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:09,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146430496] [2025-03-09 01:30:09,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:09,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:09,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-09 01:30:09,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:30:09,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:09,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:09,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:09,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146430496] [2025-03-09 01:30:09,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146430496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:09,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075782138] [2025-03-09 01:30:09,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:09,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:09,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:09,495 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:09,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:30:09,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-09 01:30:09,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:30:09,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:09,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:09,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:30:09,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:30:09,591 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:30:09,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075782138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:09,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:30:09,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-09 01:30:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669546461] [2025-03-09 01:30:09,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:09,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:09,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:09,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:09,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:30:09,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:09,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:09,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:09,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:09,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:09,714 INFO L124 PetriNetUnfolderBase]: 936/1678 cut-off events. [2025-03-09 01:30:09,714 INFO L125 PetriNetUnfolderBase]: For 1518/1518 co-relation queries the response was YES. [2025-03-09 01:30:09,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4066 conditions, 1678 events. 936/1678 cut-off events. For 1518/1518 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 8055 event pairs, 409 based on Foata normal form. 33/1441 useless extension candidates. Maximal degree in co-relation 3112. Up to 667 conditions per place. [2025-03-09 01:30:09,719 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 54 selfloop transitions, 7 changer transitions 3/67 dead transitions. [2025-03-09 01:30:09,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 395 flow [2025-03-09 01:30:09,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:09,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-03-09 01:30:09,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5743243243243243 [2025-03-09 01:30:09,720 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 149 flow. Second operand 4 states and 85 transitions. [2025-03-09 01:30:09,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 395 flow [2025-03-09 01:30:09,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 377 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:09,723 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 190 flow [2025-03-09 01:30:09,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2025-03-09 01:30:09,723 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2025-03-09 01:30:09,723 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 190 flow [2025-03-09 01:30:09,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:09,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:09,723 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:09,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:30:09,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:09,924 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:09,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:09,925 INFO L85 PathProgramCache]: Analyzing trace with hash 269483246, now seen corresponding path program 3 times [2025-03-09 01:30:09,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:09,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056113868] [2025-03-09 01:30:09,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:09,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:09,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 3 equivalence classes. [2025-03-09 01:30:09,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 34 statements. [2025-03-09 01:30:09,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:09,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:30:10,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:10,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056113868] [2025-03-09 01:30:10,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056113868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:10,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108419165] [2025-03-09 01:30:10,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:10,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:10,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:10,070 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:10,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:30:10,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 3 equivalence classes. [2025-03-09 01:30:10,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 34 statements. [2025-03-09 01:30:10,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:10,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:10,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:30:10,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:30:10,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:10,296 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:30:10,296 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 27 treesize of output 11 [2025-03-09 01:30:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:30:10,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108419165] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:10,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:10,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 13 [2025-03-09 01:30:10,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058377637] [2025-03-09 01:30:10,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:10,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:30:10,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:10,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:30:10,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:30:10,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:10,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 190 flow. Second operand has 14 states, 14 states have (on average 11.785714285714286) internal successors, (165), 14 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:10,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:10,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:10,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:10,708 INFO L124 PetriNetUnfolderBase]: 959/1673 cut-off events. [2025-03-09 01:30:10,708 INFO L125 PetriNetUnfolderBase]: For 2490/2490 co-relation queries the response was YES. [2025-03-09 01:30:10,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 1673 events. 959/1673 cut-off events. For 2490/2490 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7551 event pairs, 140 based on Foata normal form. 4/1415 useless extension candidates. Maximal degree in co-relation 4462. Up to 300 conditions per place. [2025-03-09 01:30:10,713 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 84 selfloop transitions, 16 changer transitions 45/148 dead transitions. [2025-03-09 01:30:10,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 148 transitions, 810 flow [2025-03-09 01:30:10,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:30:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:30:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2025-03-09 01:30:10,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5382882882882883 [2025-03-09 01:30:10,715 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 190 flow. Second operand 12 states and 239 transitions. [2025-03-09 01:30:10,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 148 transitions, 810 flow [2025-03-09 01:30:10,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 148 transitions, 742 flow, removed 34 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:10,721 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 265 flow [2025-03-09 01:30:10,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=265, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2025-03-09 01:30:10,722 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2025-03-09 01:30:10,722 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 265 flow [2025-03-09 01:30:10,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.785714285714286) internal successors, (165), 14 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:10,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:10,723 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:10,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:10,927 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,SelfDestructingSolverStorable11 [2025-03-09 01:30:10,927 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:10,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:10,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2084630832, now seen corresponding path program 4 times [2025-03-09 01:30:10,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:10,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892351993] [2025-03-09 01:30:10,929 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:10,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:10,938 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-09 01:30:10,958 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:30:10,958 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:10,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:11,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:30:11,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:11,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892351993] [2025-03-09 01:30:11,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892351993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:11,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460989856] [2025-03-09 01:30:11,064 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:11,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:11,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:11,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:11,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:30:11,104 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-09 01:30:11,129 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:30:11,129 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:11,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:11,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:30:11,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:15,284 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:30:15,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:15,349 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:30:15,349 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 28 treesize of output 11 [2025-03-09 01:30:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:30:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460989856] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:15,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:15,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 01:30:15,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59951908] [2025-03-09 01:30:15,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:15,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:30:15,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:15,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:30:15,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=116, Unknown=1, NotChecked=0, Total=156 [2025-03-09 01:30:15,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:15,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 265 flow. Second operand has 13 states, 13 states have (on average 12.76923076923077) internal successors, (166), 13 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:15,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:15,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:15,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:16,158 INFO L124 PetriNetUnfolderBase]: 2718/4674 cut-off events. [2025-03-09 01:30:16,159 INFO L125 PetriNetUnfolderBase]: For 6985/6985 co-relation queries the response was YES. [2025-03-09 01:30:16,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12205 conditions, 4674 events. 2718/4674 cut-off events. For 6985/6985 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 25481 event pairs, 176 based on Foata normal form. 24/3972 useless extension candidates. Maximal degree in co-relation 12170. Up to 850 conditions per place. [2025-03-09 01:30:16,174 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 124 selfloop transitions, 43 changer transitions 66/236 dead transitions. [2025-03-09 01:30:16,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 236 transitions, 1455 flow [2025-03-09 01:30:16,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:30:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-09 01:30:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 349 transitions. [2025-03-09 01:30:16,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.589527027027027 [2025-03-09 01:30:16,176 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 265 flow. Second operand 16 states and 349 transitions. [2025-03-09 01:30:16,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 236 transitions, 1455 flow [2025-03-09 01:30:16,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 236 transitions, 1295 flow, removed 62 selfloop flow, removed 6 redundant places. [2025-03-09 01:30:16,217 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 652 flow [2025-03-09 01:30:16,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=652, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2025-03-09 01:30:16,218 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 42 predicate places. [2025-03-09 01:30:16,218 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 652 flow [2025-03-09 01:30:16,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.76923076923077) internal successors, (166), 13 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:16,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:16,219 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:16,225 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-09 01:30:16,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:16,421 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:16,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:16,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1517178927, now seen corresponding path program 5 times [2025-03-09 01:30:16,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:16,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965370172] [2025-03-09 01:30:16,422 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:16,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:16,429 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-03-09 01:30:16,439 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:30:16,439 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:30:16,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:30:16,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:16,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965370172] [2025-03-09 01:30:16,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965370172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:16,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214551798] [2025-03-09 01:30:16,550 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:16,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:16,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:16,552 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:16,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:30:16,594 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-03-09 01:30:16,618 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:30:16,619 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:30:16,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:16,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:30:16,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 01:30:16,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 01:30:16,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214551798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:16,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:16,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-03-09 01:30:16,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195605060] [2025-03-09 01:30:16,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:16,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:30:16,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:16,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:30:16,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:30:16,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:16,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 652 flow. Second operand has 20 states, 20 states have (on average 11.55) internal successors, (231), 20 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:16,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:16,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:16,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:17,694 INFO L124 PetriNetUnfolderBase]: 3384/5890 cut-off events. [2025-03-09 01:30:17,695 INFO L125 PetriNetUnfolderBase]: For 14192/14192 co-relation queries the response was YES. [2025-03-09 01:30:17,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16406 conditions, 5890 events. 3384/5890 cut-off events. For 14192/14192 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 35246 event pairs, 2456 based on Foata normal form. 51/5018 useless extension candidates. Maximal degree in co-relation 15871. Up to 4666 conditions per place. [2025-03-09 01:30:17,719 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 63 selfloop transitions, 6 changer transitions 96/168 dead transitions. [2025-03-09 01:30:17,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 168 transitions, 1292 flow [2025-03-09 01:30:17,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:30:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:30:17,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 229 transitions. [2025-03-09 01:30:17,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4760914760914761 [2025-03-09 01:30:17,721 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 652 flow. Second operand 13 states and 229 transitions. [2025-03-09 01:30:17,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 168 transitions, 1292 flow [2025-03-09 01:30:17,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 168 transitions, 1180 flow, removed 51 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:17,757 INFO L231 Difference]: Finished difference. Result has 96 places, 72 transitions, 602 flow [2025-03-09 01:30:17,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=602, PETRI_PLACES=96, PETRI_TRANSITIONS=72} [2025-03-09 01:30:17,758 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 60 predicate places. [2025-03-09 01:30:17,758 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 72 transitions, 602 flow [2025-03-09 01:30:17,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.55) internal successors, (231), 20 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:17,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:17,759 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:17,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:30:17,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:17,959 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:17,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash -165619074, now seen corresponding path program 6 times [2025-03-09 01:30:17,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:17,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512731212] [2025-03-09 01:30:17,960 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:17,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:17,968 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-03-09 01:30:18,003 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:30:18,003 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-09 01:30:18,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:18,608 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:30:18,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:18,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512731212] [2025-03-09 01:30:18,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512731212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:18,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202417303] [2025-03-09 01:30:18,609 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:18,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:18,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:18,611 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:18,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:30:18,649 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-03-09 01:30:18,798 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:30:18,798 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-09 01:30:18,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:18,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:18,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:30:18,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:18,965 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:30:18,965 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 28 treesize of output 11 [2025-03-09 01:30:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:30:18,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202417303] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:18,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:18,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 18 [2025-03-09 01:30:18,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889774376] [2025-03-09 01:30:18,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:18,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:30:18,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:18,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:30:18,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:30:19,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:19,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 72 transitions, 602 flow. Second operand has 19 states, 19 states have (on average 11.631578947368421) internal successors, (221), 19 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:19,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:19,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:19,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:20,296 INFO L124 PetriNetUnfolderBase]: 3388/5840 cut-off events. [2025-03-09 01:30:20,296 INFO L125 PetriNetUnfolderBase]: For 14363/14363 co-relation queries the response was YES. [2025-03-09 01:30:20,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16376 conditions, 5840 events. 3388/5840 cut-off events. For 14363/14363 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 33387 event pairs, 388 based on Foata normal form. 2/4940 useless extension candidates. Maximal degree in co-relation 15889. Up to 1102 conditions per place. [2025-03-09 01:30:20,315 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 103 selfloop transitions, 53 changer transitions 103/262 dead transitions. [2025-03-09 01:30:20,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 262 transitions, 1790 flow [2025-03-09 01:30:20,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:30:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-09 01:30:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 387 transitions. [2025-03-09 01:30:20,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.522972972972973 [2025-03-09 01:30:20,319 INFO L175 Difference]: Start difference. First operand has 96 places, 72 transitions, 602 flow. Second operand 20 states and 387 transitions. [2025-03-09 01:30:20,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 262 transitions, 1790 flow [2025-03-09 01:30:20,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 262 transitions, 1748 flow, removed 19 selfloop flow, removed 9 redundant places. [2025-03-09 01:30:20,353 INFO L231 Difference]: Finished difference. Result has 102 places, 79 transitions, 760 flow [2025-03-09 01:30:20,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=760, PETRI_PLACES=102, PETRI_TRANSITIONS=79} [2025-03-09 01:30:20,354 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 66 predicate places. [2025-03-09 01:30:20,354 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 79 transitions, 760 flow [2025-03-09 01:30:20,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.631578947368421) internal successors, (221), 19 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:20,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:20,354 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:20,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:20,554 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,SelfDestructingSolverStorable14 [2025-03-09 01:30:20,555 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:20,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash 689619332, now seen corresponding path program 7 times [2025-03-09 01:30:20,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:20,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889928850] [2025-03-09 01:30:20,556 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:30:20,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:20,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:30:20,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:30:20,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:20,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 01:30:20,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:20,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889928850] [2025-03-09 01:30:20,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889928850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:20,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40709516] [2025-03-09 01:30:20,665 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:30:20,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:20,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:20,667 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:20,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:30:20,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:30:20,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:30:20,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:20,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:20,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:30:20,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 01:30:20,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 01:30:20,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40709516] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:20,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:20,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2025-03-09 01:30:20,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343190354] [2025-03-09 01:30:20,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:20,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:30:20,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:20,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:30:20,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:30:20,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:20,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 79 transitions, 760 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:20,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:20,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:20,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:21,444 INFO L124 PetriNetUnfolderBase]: 5194/8942 cut-off events. [2025-03-09 01:30:21,445 INFO L125 PetriNetUnfolderBase]: For 28972/28972 co-relation queries the response was YES. [2025-03-09 01:30:21,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26424 conditions, 8942 events. 5194/8942 cut-off events. For 28972/28972 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 54099 event pairs, 1080 based on Foata normal form. 22/7575 useless extension candidates. Maximal degree in co-relation 26285. Up to 2214 conditions per place. [2025-03-09 01:30:21,473 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 98 selfloop transitions, 63 changer transitions 0/164 dead transitions. [2025-03-09 01:30:21,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 164 transitions, 1770 flow [2025-03-09 01:30:21,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:30:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:30:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-03-09 01:30:21,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5990990990990991 [2025-03-09 01:30:21,476 INFO L175 Difference]: Start difference. First operand has 102 places, 79 transitions, 760 flow. Second operand 6 states and 133 transitions. [2025-03-09 01:30:21,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 164 transitions, 1770 flow [2025-03-09 01:30:21,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 164 transitions, 1660 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-03-09 01:30:21,503 INFO L231 Difference]: Finished difference. Result has 96 places, 108 transitions, 1248 flow [2025-03-09 01:30:21,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1248, PETRI_PLACES=96, PETRI_TRANSITIONS=108} [2025-03-09 01:30:21,504 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 60 predicate places. [2025-03-09 01:30:21,504 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 108 transitions, 1248 flow [2025-03-09 01:30:21,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:21,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:21,504 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:21,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:21,710 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,SelfDestructingSolverStorable15 [2025-03-09 01:30:21,710 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:21,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:21,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2083030712, now seen corresponding path program 8 times [2025-03-09 01:30:21,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:21,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761067803] [2025-03-09 01:30:21,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:21,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:21,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-09 01:30:21,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:30:21,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:21,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:21,964 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 53 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 01:30:21,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:21,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761067803] [2025-03-09 01:30:21,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761067803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:21,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166205132] [2025-03-09 01:30:21,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:21,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:21,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:21,966 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-09 01:30:21,969 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-09 01:30:22,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-09 01:30:22,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:30:22,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:22,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:22,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:30:22,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 01:30:22,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:22,214 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:30:22,215 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 27 treesize of output 11 [2025-03-09 01:30:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 01:30:22,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166205132] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:22,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:22,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2025-03-09 01:30:22,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333026713] [2025-03-09 01:30:22,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:22,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:30:22,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:22,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:30:22,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:30:22,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:22,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 108 transitions, 1248 flow. Second operand has 18 states, 18 states have (on average 11.833333333333334) internal successors, (213), 18 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:22,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:22,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:22,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:24,967 INFO L124 PetriNetUnfolderBase]: 11384/19742 cut-off events. [2025-03-09 01:30:24,968 INFO L125 PetriNetUnfolderBase]: For 79445/79445 co-relation queries the response was YES. [2025-03-09 01:30:25,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58693 conditions, 19742 events. 11384/19742 cut-off events. For 79445/79445 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 135817 event pairs, 1060 based on Foata normal form. 235/16881 useless extension candidates. Maximal degree in co-relation 57467. Up to 3650 conditions per place. [2025-03-09 01:30:25,033 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 430 selfloop transitions, 152 changer transitions 234/819 dead transitions. [2025-03-09 01:30:25,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 819 transitions, 6465 flow [2025-03-09 01:30:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-09 01:30:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-09 01:30:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 1185 transitions. [2025-03-09 01:30:25,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.561877667140825 [2025-03-09 01:30:25,038 INFO L175 Difference]: Start difference. First operand has 96 places, 108 transitions, 1248 flow. Second operand 57 states and 1185 transitions. [2025-03-09 01:30:25,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 819 transitions, 6465 flow [2025-03-09 01:30:25,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 819 transitions, 6277 flow, removed 94 selfloop flow, removed 0 redundant places. [2025-03-09 01:30:25,152 INFO L231 Difference]: Finished difference. Result has 172 places, 183 transitions, 2721 flow [2025-03-09 01:30:25,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=2721, PETRI_PLACES=172, PETRI_TRANSITIONS=183} [2025-03-09 01:30:25,152 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 136 predicate places. [2025-03-09 01:30:25,153 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 183 transitions, 2721 flow [2025-03-09 01:30:25,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.833333333333334) internal successors, (213), 18 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:25,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:25,153 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:25,159 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-09 01:30:25,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:30:25,357 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:25,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:25,357 INFO L85 PathProgramCache]: Analyzing trace with hash 122808602, now seen corresponding path program 9 times [2025-03-09 01:30:25,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:25,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569622358] [2025-03-09 01:30:25,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:25,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:25,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 5 equivalence classes. [2025-03-09 01:30:25,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 48 of 50 statements. [2025-03-09 01:30:25,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 01:30:25,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 01:30:25,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:25,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569622358] [2025-03-09 01:30:25,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569622358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:25,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302038675] [2025-03-09 01:30:25,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:25,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:25,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:25,594 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-09 01:30:25,596 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-09 01:30:25,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 5 equivalence classes. [2025-03-09 01:30:25,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 48 of 50 statements. [2025-03-09 01:30:25,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 01:30:25,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:25,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 01:30:25,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 01:30:25,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:26,012 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:30:26,013 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 28 treesize of output 11 [2025-03-09 01:30:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 01:30:26,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302038675] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:26,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:26,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 26 [2025-03-09 01:30:26,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508994478] [2025-03-09 01:30:26,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:26,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-09 01:30:26,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:26,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 01:30:26,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2025-03-09 01:30:26,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:26,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 183 transitions, 2721 flow. Second operand has 27 states, 27 states have (on average 11.74074074074074) internal successors, (317), 27 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:26,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:26,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:26,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:31,682 INFO L124 PetriNetUnfolderBase]: 24183/41441 cut-off events. [2025-03-09 01:30:31,682 INFO L125 PetriNetUnfolderBase]: For 273589/273589 co-relation queries the response was YES. [2025-03-09 01:30:31,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136453 conditions, 41441 events. 24183/41441 cut-off events. For 273589/273589 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 308056 event pairs, 1584 based on Foata normal form. 101/35105 useless extension candidates. Maximal degree in co-relation 135260. Up to 7625 conditions per place. [2025-03-09 01:30:31,926 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 446 selfloop transitions, 357 changer transitions 238/1044 dead transitions. [2025-03-09 01:30:31,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 1044 transitions, 11484 flow [2025-03-09 01:30:31,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-09 01:30:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-03-09 01:30:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 1202 transitions. [2025-03-09 01:30:31,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5801158301158301 [2025-03-09 01:30:31,929 INFO L175 Difference]: Start difference. First operand has 172 places, 183 transitions, 2721 flow. Second operand 56 states and 1202 transitions. [2025-03-09 01:30:31,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 1044 transitions, 11484 flow [2025-03-09 01:30:32,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 1044 transitions, 9904 flow, removed 624 selfloop flow, removed 11 redundant places. [2025-03-09 01:30:32,345 INFO L231 Difference]: Finished difference. Result has 236 places, 412 transitions, 7077 flow [2025-03-09 01:30:32,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=7077, PETRI_PLACES=236, PETRI_TRANSITIONS=412} [2025-03-09 01:30:32,345 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 200 predicate places. [2025-03-09 01:30:32,345 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 412 transitions, 7077 flow [2025-03-09 01:30:32,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 11.74074074074074) internal successors, (317), 27 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:32,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:32,345 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:32,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:32,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:30:32,546 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:32,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:32,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1873367111, now seen corresponding path program 10 times [2025-03-09 01:30:32,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:32,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030734871] [2025-03-09 01:30:32,547 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:32,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:32,552 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-09 01:30:32,566 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 01:30:32,566 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:32,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 26 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 01:30:32,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:32,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030734871] [2025-03-09 01:30:32,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030734871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:32,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445715869] [2025-03-09 01:30:32,735 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:32,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:32,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:32,737 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-09 01:30:32,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-09 01:30:32,782 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-09 01:30:32,844 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 01:30:32,844 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:32,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:32,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:30:32,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:33,084 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 26 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 01:30:33,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 16 proven. 50 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 01:30:33,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445715869] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:33,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:33,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-03-09 01:30:33,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522693877] [2025-03-09 01:30:33,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:33,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-09 01:30:33,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:33,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 01:30:33,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=904, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 01:30:33,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:33,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 412 transitions, 7077 flow. Second operand has 35 states, 35 states have (on average 11.285714285714286) internal successors, (395), 35 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:33,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:33,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:33,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:39,103 INFO L124 PetriNetUnfolderBase]: 21360/36656 cut-off events. [2025-03-09 01:30:39,103 INFO L125 PetriNetUnfolderBase]: For 259210/259210 co-relation queries the response was YES. [2025-03-09 01:30:39,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122626 conditions, 36656 events. 21360/36656 cut-off events. For 259210/259210 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 277603 event pairs, 13662 based on Foata normal form. 198/31156 useless extension candidates. Maximal degree in co-relation 121414. Up to 24651 conditions per place. [2025-03-09 01:30:39,453 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 352 selfloop transitions, 121 changer transitions 29/505 dead transitions. [2025-03-09 01:30:39,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 505 transitions, 9430 flow [2025-03-09 01:30:39,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:30:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:30:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 239 transitions. [2025-03-09 01:30:39,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4613899613899614 [2025-03-09 01:30:39,454 INFO L175 Difference]: Start difference. First operand has 236 places, 412 transitions, 7077 flow. Second operand 14 states and 239 transitions. [2025-03-09 01:30:39,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 505 transitions, 9430 flow [2025-03-09 01:30:40,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 505 transitions, 6437 flow, removed 1445 selfloop flow, removed 13 redundant places. [2025-03-09 01:30:40,736 INFO L231 Difference]: Finished difference. Result has 223 places, 398 transitions, 5101 flow [2025-03-09 01:30:40,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4337, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5101, PETRI_PLACES=223, PETRI_TRANSITIONS=398} [2025-03-09 01:30:40,736 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 187 predicate places. [2025-03-09 01:30:40,736 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 398 transitions, 5101 flow [2025-03-09 01:30:40,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 11.285714285714286) internal successors, (395), 35 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:40,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:40,736 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:40,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:40,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:40,937 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:40,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:40,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1575438072, now seen corresponding path program 11 times [2025-03-09 01:30:40,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:40,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619806108] [2025-03-09 01:30:40,938 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:40,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:40,944 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 6 equivalence classes. [2025-03-09 01:30:40,962 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 01:30:40,963 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 01:30:40,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:41,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:41,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619806108] [2025-03-09 01:30:41,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619806108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:41,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991889542] [2025-03-09 01:30:41,464 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:41,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:41,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:41,466 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-09 01:30:41,466 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-09 01:30:41,505 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 6 equivalence classes. [2025-03-09 01:30:41,549 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 01:30:41,549 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 01:30:41,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:41,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-09 01:30:41,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 01:30:41,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:42,026 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:30:42,027 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 28 treesize of output 11 [2025-03-09 01:30:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:30:42,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991889542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:42,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:42,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 12] total 39 [2025-03-09 01:30:42,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650819346] [2025-03-09 01:30:42,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:42,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-09 01:30:42,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:42,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-09 01:30:42,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1439, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 01:30:42,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:42,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 398 transitions, 5101 flow. Second operand has 40 states, 40 states have (on average 11.375) internal successors, (455), 40 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:42,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:42,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:42,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:53,750 INFO L124 PetriNetUnfolderBase]: 40458/69262 cut-off events. [2025-03-09 01:30:53,751 INFO L125 PetriNetUnfolderBase]: For 164882/164882 co-relation queries the response was YES. [2025-03-09 01:30:54,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188287 conditions, 69262 events. 40458/69262 cut-off events. For 164882/164882 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 552015 event pairs, 2404 based on Foata normal form. 23/58503 useless extension candidates. Maximal degree in co-relation 187427. Up to 12800 conditions per place. [2025-03-09 01:30:54,539 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 471 selfloop transitions, 495 changer transitions 498/1467 dead transitions. [2025-03-09 01:30:54,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 1467 transitions, 14223 flow [2025-03-09 01:30:54,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-09 01:30:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2025-03-09 01:30:54,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 1352 transitions. [2025-03-09 01:30:54,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.54538120209762 [2025-03-09 01:30:54,541 INFO L175 Difference]: Start difference. First operand has 223 places, 398 transitions, 5101 flow. Second operand 67 states and 1352 transitions. [2025-03-09 01:30:54,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 1467 transitions, 14223 flow [2025-03-09 01:30:55,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 1467 transitions, 13676 flow, removed 268 selfloop flow, removed 5 redundant places. [2025-03-09 01:30:55,752 INFO L231 Difference]: Finished difference. Result has 294 places, 532 transitions, 7296 flow [2025-03-09 01:30:55,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4716, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=7296, PETRI_PLACES=294, PETRI_TRANSITIONS=532} [2025-03-09 01:30:55,753 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 258 predicate places. [2025-03-09 01:30:55,753 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 532 transitions, 7296 flow [2025-03-09 01:30:55,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 11.375) internal successors, (455), 40 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:55,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:55,753 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:55,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 01:30:55,954 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,SelfDestructingSolverStorable19 [2025-03-09 01:30:55,954 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:30:55,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:55,954 INFO L85 PathProgramCache]: Analyzing trace with hash -511645425, now seen corresponding path program 12 times [2025-03-09 01:30:55,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:55,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807701219] [2025-03-09 01:30:55,955 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:55,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:55,963 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 6 equivalence classes. [2025-03-09 01:30:55,994 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 01:30:55,994 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-09 01:30:55,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 40 proven. 63 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-09 01:30:56,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:56,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807701219] [2025-03-09 01:30:56,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807701219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:56,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776787031] [2025-03-09 01:30:56,291 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:56,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:56,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:56,293 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-09 01:30:56,295 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-09 01:30:56,339 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 6 equivalence classes. [2025-03-09 01:30:56,387 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 01:30:56,387 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-09 01:30:56,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:56,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:30:56,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 45 proven. 58 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-09 01:30:56,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 45 proven. 58 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-09 01:30:56,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776787031] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:56,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:56,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2025-03-09 01:30:56,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800320925] [2025-03-09 01:30:56,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:56,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-09 01:30:56,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:56,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-09 01:30:56,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2025-03-09 01:30:56,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:30:56,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 532 transitions, 7296 flow. Second operand has 30 states, 30 states have (on average 11.2) internal successors, (336), 30 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:56,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:56,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:30:56,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand